( en | de | ru )

 

Disambiguation of "Italiano, Giuseppe F."

Author of the publication

copydeleteadd this publication to your clipboard
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.

, , , , , and . J. Algorithms, 15 (1): 173 (1993)see: J. Algorithms 13(1): 33-54 (1992).

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Giuseppe F Vercellino

Giuseppe F Miozzari

Giuseppe Olivato

Giuseppe Veltri

Giuseppe Bosco

 

Other publications of authors with the same name

All-Pairs $2$-reachability in Õ(nω) Time., , , , and . CoRR, (2016)On Robust Graph Spanners, , , and . CoRR, (2013)Personal data disclosure and data breaches: the customer's viewpoint, , and . CoRR, (2012)Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study., , , , and . ALENEX, page 169-183. SIAM, (2018)A new approach to dynamic all pairs shortest paths., and . STOC, page 159-166. ACM, (2003)Sorting and searching in the presence of memory faults (without redundancy)., and . STOC, page 101-110. ACM, (2004)Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract)., and . ICALP, volume 1256 of Lecture Notes in Computer Science, page 605-615. Springer, (1997)Topics in Data Structures., and . Algorithms and Theory of Computation Handbook, CRC Press, (1999)Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments., , , , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 605-617. Springer, (2007)The Price of Resiliency: A Case Study on Sorting with Memory Faults., , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 768-779. Springer, (2006)