The following pages link to Paolo Giulio Franciosa (Q1209351):
Displaying 26 items.
- (Q286982) (redirect page) (← links)
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984) (← links)
- On resilient graph spanners (Q289925) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- (Q967289) (redirect page) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- On the optimal binary plane partition for sets of isothetic rectangles (Q1209352) (← links)
- On the Boolean dimension of spherical orders (Q1354634) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- Partially dynamic maintenance of minimum weight hyperpaths (Q1775013) (← links)
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216) (← links)
- On the Galois lattice of bipartite distance hereditary graphs (Q2352777) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- A characterization of partial directed line graphs (Q2455584) (← links)
- On the Galois Lattice of Bipartite Distance Hereditary Graphs (Q2946040) (← links)
- COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692) (← links)
- SEPARATING SETS OF HYPERRECTANGLES (Q3136722) (← links)
- (Q3359760) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- Semi-dynamic shortest paths and breadth-first search in digraphs (Q5047157) (← links)
- Max flow vitality in general and <i>st</i>‐planar graphs (Q5226589) (← links)
- Small Stretch Spanners on Dynamic Graphs (Q5301398) (← links)
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← links)
- Non-crossing shortest paths lengths in planar graphs in linear time (Q6153472) (← links)
- How vulnerable is an undirected planar graph with respect to max flow (Q6196897) (← links)
