The following pages link to Giuseppe F. Italiano (Q270020):
Displaying 50 items.
- (Q3138871) (← links)
- (Q3138872) (← links)
- (Q3138931) (← links)
- (Q3138950) (← links)
- Fully dynamic planarity testing with applications (Q3158532) (← links)
- Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs (Q3167606) (← links)
- Design of Dynamic Algorithms via Primal-Dual Method (Q3448786) (← links)
- 2-Vertex Connectivity in Directed Graphs (Q3448819) (← links)
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
- Algorithms and Constraint Programming (Q3524235) (← links)
- Optimal Resilient Dynamic Dictionaries (Q3527225) (← links)
- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments (Q3527251) (← links)
- Trade-offs for fully dynamic transitive closure on DAGs: breaking through the <i>O</i> ( <i>n</i> <sup>2</sup> barrier (Q3546293) (← links)
- Resilient Algorithms and Data Structures (Q3562988) (← links)
- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming (Q3578313) (← links)
- Sorting and searching in the presence of memory faults (without redundancy) (Q3580962) (← links)
- A new approach to dynamic all pairs shortest paths (Q3581293) (← links)
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults (Q3613767) (← links)
- (Q3787478) (← links)
- (Q3817607) (← links)
- On-line algorithms for polynomially solvable satisfiability problems (Q3970696) (← links)
- Incremental algorithms for minimal length paths (Q3988824) (← links)
- Maintenance of a minimum spanning forest in a dynamic plane graph (Q3990614) (← links)
- Fully Dynamic Algorithms for 2-Edge Connectivity (Q4027863) (← links)
- (Q4028899) (← links)
- (Q4036576) (← links)
- (Q4037440) (← links)
- Maintaining the 3-Edge-Connected Components of a Graph On-Line (Q4037680) (← links)
- Separator-Based Sparsification II: Edge and Vertex Connectivity (Q4210152) (← links)
- (Q4218092) (← links)
- (Q4230327) (← links)
- The Set Union Problem with Unlimited Backtracking (Q4286228) (← links)
- Sparse dynamic programming I (Q4302802) (← links)
- Sparse dynamic programming II (Q4302803) (← links)
- Sparsification—a technique for speeding up dynamic graph algorithms (Q4377592) (← links)
- (Q4417670) (← links)
- (Q4426347) (← links)
- (Q4536342) (← links)
- Computing Critical Nodes in Directed Graphs (Q4555541) (← links)
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q4571920) (← links)
- Efficient splitting and merging algorithms for order decomposable problems (Q4571990) (← links)
- Strong Connectivity in Directed Graphs under Failures, with Applications (Q4575869) (← links)
- Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs (Q4575870) (← links)
- (Q4580153) (← links)
- Incremental 2-Edge-Connectivity in Directed Graphs (Q4598188) (← links)
- 2-Connectivity in Directed Graphs (Invited Talk) (Q4606266) (← links)
- Maintaining spanning trees of small diameter (Q4632429) (← links)
- (Q4643862) (← links)
- (Q4643863) (← links)
- (Q4668725) (← links)