The following pages link to Giuseppe F. Italiano (Q270020):
Displaying 50 items.
- Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
- On resilient graph spanners (Q289925) (← links)
- (Q360497) (redirect page) (← links)
- On a facility location problem with applications to tele-diagnostic (Q360498) (← links)
- Finding strong bridges and strong articulation points in linear time (Q443716) (← links)
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- A note on set union with arbitrary deunions (Q751279) (← links)
- (Q804286) (redirect page) (← links)
- The set union problem with dynamic weighted backtracking (Q804287) (← links)
- Dynamically switching vertices in planar graphs (extended abstract) (Q826087) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Design of trees in the hose model: the balanced case (Q867917) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- Mantaining dynamic matrices for fully dynamic transitive closure (Q930605) (← links)
- Sorting and searching in faulty memories (Q1006385) (← links)
- The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
- Optimal resilient sorting and searching in the presence of memory faults (Q1035681) (← links)
- Amortized efficiency of a path retrieval data structure (Q1099629) (← links)
- Finding paths and deleting edges in directed acyclic graphs (Q1115184) (← links)
- Worst-case analysis of the set-union problem with extended backtracking (Q1124334) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- Maintaining spanning trees of small diameter (Q1273933) (← links)
- Dynamically switching vertices in planar graphs (Q1578392) (← links)
- An algorithm for finding a \(k\)-median in a directed tree (Q1607050) (← links)
- Maximum colorful cycles in vertex-colored graphs (Q1625149) (← links)
- Dynamic algorithms via the primal-dual method (Q1640995) (← links)
- 2-vertex connectivity in directed graphs (Q1640998) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- Maximum colorful cliques in vertex-colored graphs (Q1791008) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- Separator based sparsification. I: Planarity testing and minimum spanning trees (Q1915501) (← links)
- Decremental 2- and 3-connectivity on planar graphs (Q1924402) (← links)
- Dispersion of mobile robots on directed anonymous graphs (Q2097347) (← links)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
- Incremental strong connectivity and 2-connectivity in directed graphs (Q2294712) (← links)
- Near real-time suffix tree construction via the fringe marked ancestor problem (Q2376800) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
- Wavelength rerouting in optical networks, or the Venetian routing problem (Q2753728) (← links)
- Algorithmic techniques for maintaining shortest routes in dynamic networks (Q2864176) (← links)
- Novel local-search-based approaches to university examination timetabling (Q2900997) (← links)
- An Experimental Study of Dynamic Dominators (Q2912868) (← links)
- Resilient dictionaries (Q2930274) (← links)
- (Q2934637) (← links)
- Experimental analysis of dynamic all pairs shortest path algorithms (Q2944531) (← links)
- Finding Strong Bridges and Strong Articulation Points in Linear Time (Q3066153) (← links)
- COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692) (← links)
