( en | de | ru )

 

Disambiguation of "Italiano, Giuseppe F."

Author of the publication

copydeleteadd this publication to your clipboard
Inferring Tie Strength in Temporal Networks.

, , and . ECML/PKDD (2), volume 13714 of Lecture Notes in Computer Science, page 69-85. Springer, (2022)

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 Amato

 

Other publications of authors with the same name

Sorting and searching in the presence of memory faults (without redundancy)., and . STOC, page 101-110. ACM, (2004)A new approach to dynamic all pairs shortest paths., and . STOC, page 159-166. ACM, (2003)All-Pairs $2$-reachability in Õ(nω) Time., , , , and . CoRR, (2016)Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study., , , , and . ALENEX, page 169-183. SIAM, (2018)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)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)Dynamically Switching Vertices in Planar Graphs (Extended Abstract)., and . ESA, volume 1284 of Lecture Notes in Computer Science, page 186-199. Springer, (1997)Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version)., and . SWAT, volume 621 of Lecture Notes in Computer Science, page 221-232. Springer, (1992)Getting Back to the Past in the Union-Find Problem., , and . STACS, volume 294 of Lecture Notes in Computer Science, page 8-17. Springer, (1988)