The following pages link to Giuseppe F. Italiano (Q270020):
Displaying 47 items.
- (Q4707794) (← links)
- (Q4737195) (← links)
- (Q4858443) (← links)
- (Q4875185) (← links)
- (Q4945539) (← links)
- 2-Edge Connectivity in Directed Graphs (Q4962644) (← links)
- Decremental single-source reachability in planar digraphs (Q4978051) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- A Family of Tree-Based Generators for Bubbles in Directed Graphs (Q5041176) (← links)
- Dynamic 2- and 3-connectivity on planar graphs (Q5056143) (← links)
- Dynamic Dominators and Low-High Orders in DAGs (Q5075793) (← links)
- A family of tree-based generators for bubbles in directed graphs (Q5084695) (← links)
- (Q5090485) (← links)
- (Q5091155) (← links)
- (Q5111373) (← links)
- All-Pairs 2-Reachability in O(n^w log n) Time (Q5111405) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
- Strong Connectivity in Directed Graphs under Failures, with Applications (Q5123984) (← links)
- Data structures resilient to memory faults (Q5178739) (← links)
- 2-Connectivity in Directed Graphs: An Experimental Study (Q5232536) (← links)
- Computing Critical Nodes in Directed Graphs (Q5232563) (← links)
- Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study (Q5232736) (← links)
- Separator based sparsification for dynamic planar graph algorithms (Q5248488) (← links)
- Small Stretch Spanners on Dynamic Graphs (Q5301398) (← links)
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q5362993) (← links)
- 2-Edge Connectivity in Directed Graphs (Q5363073) (← links)
- Is Timetabling Routing Always Reliable for Public Transportl (Q5397838) (← links)
- Improved algorithms for min cut and max flow in undirected planar graphs (Q5419101) (← links)
- A new approach to dynamic all pairs shortest paths (Q5435671) (← links)
- Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? (Q5449576) (← links)
- The Price of Resiliency: A Case Study on Sorting with Memory Faults (Q5449579) (← links)
- Improved Approximation for Single-Sink Buy-at-Bulk (Q5459107) (← links)
- Algorithmic aspects in speech recognition (Q5463371) (← links)
- Algorithms – ESA 2005 (Q5475813) (← links)
- Algorithms – ESA 2005 (Q5475863) (← links)
- (Q5501281) (← links)
- (Q5501809) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710795) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710801) (← links)
- Predicting deadlock in store‐and‐forward networks (Q5750381) (← links)
- On bubble generators in directed graphs (Q5915788) (← links)
- Tropical paths in vertex-colored graphs (Q5915895) (← links)
- Tropical paths in vertex-colored graphs (Q5918388) (← links)
- (Q6075938) (← links)
- Compressed Weighted de Bruijn Graphs (Q6098787) (← links)
- Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice (Q6159911) (← links)
- Black hole search in dynamic cactus graph (Q6575403) (← links)
