( en | de | ru )

 

Disambiguation of "Franciosa, Paolo Giulio"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Searching with Linear Constraints.

, , , , and . PODS, page 169-178. ACM Press, (1998)

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.

Giordano Paolo

Giulio Mazzolo

Giulio Donati

Giulio Meiattini

Giulio Pellitta

 

Other publications of authors with the same name

Separating Sets of Hyperrectangles., and . MFCS, volume 452 of Lecture Notes in Computer Science, page 165-172. Springer, (1990)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)On the Galois Lattice of Bipartite Distance Hereditary Graphs., , and . IWOCA, volume 8986 of Lecture Notes in Computer Science, page 37-48. Springer, (2014)How Vulnerable is an Undirected Planar Graph with Respect to Max Flow., and . CIAC, volume 13898 of Lecture Notes in Computer Science, page 82-96. Springer, (2023)Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time., and . CIAC, volume 13898 of Lecture Notes in Computer Science, page 67-81. Springer, (2023)Partially dynamic maintenance of minimum weight hyperpaths., , and . J. Discrete Algorithms, 3 (1): 27-46 (2005)Small Stretch Spanners on Dynamic Graphs., , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 532-543. Springer, (2005)Max Flow Vulnerability of Undirected Planar Networks., and . SEBD, volume 3741 of CEUR Workshop Proceedings, page 152-162. CEUR-WS.org, (2024)Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time., and . CSR, volume 13296 of Lecture Notes in Computer Science, page 77-95. Springer, (2022)A convex hull algorithm for points with approximately known positions., , , and . Int. J. Comput. Geom. Appl., 4 (2): 153-163 (1994)