( en | de | ru )

 

Disambiguation of "Italiano, Giuseppe F."

Author of the publication

copydeleteadd this publication to your clipboard
The Set Union Problem With Unlimited Backtracking.

, , , and . SIAM J. Comput., 23 (1): 50-70 (1994)

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

Concurrent Algorithms and Data Types Animation over the Internet., , , and . IFIP Congress: Fundamentals - Foundations of Computer Science, volume 117 of books@ocg.at, page 63-80. Austrian Computer Society, (1998)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)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)Inferring Tie Strength in Temporal Networks., , and . ECML/PKDD (2), volume 13714 of Lecture Notes in Computer Science, page 69-85. Springer, (2022)Planar Reachability Under Single Vertex or Edge Failures., , and . SODA, page 2739-2758. SIAM, (2021)Engineering Shortest Path Algorithms., and . WEA, volume 3059 of Lecture Notes in Computer Science, page 191-198. Springer, (2004)Efficient cross-trees for external memory., and . External Memory Algorithms, volume 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 87-106. DIMACS/AMS, (1998)The (not so) Critical Nodes of Criminal Networks., , and . SocInfo Workshops, volume 8852 of Lecture Notes in Computer Science, page 87-96. Springer, (2014)