On Bubble Generators in Directed Graphs von Acuña, V., Grossi, R., Italiano, G. F., Lima, L., Rizzi, R., Sacomoto, G., Sagot, M.-F., Sinaimeri, B.

Volltext

Dynamically Switching Vertices in Planar Graphs von Frigioni, D., Italiano, G. F.

Volltext

Fully dynamic all pairs shortest paths with real edge weights von Demetrescu, C., Italiano, G.F.

Volltext

Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? von Demetrescu, C., Faruolo, P., Italiano, G. F., Thorup, M.

Volltext

Finding paths and deleting edges in directed acyclic graphs von Italiano, Giuseppe F.

Volltext

Amortized efficiency of a path retrieval data structure von Italiano, G.F.

Volltext

A new approach to dynamic all pairs shortest paths von Demetrescu, Camil, Italiano, Giuseppe F

Volltext

Optimal resilient sorting and searching in the presence of memory faults von Finocchi, Irene, Grandoni, Fabrizio, Italiano, Giuseppe F.

Volltext

Data structures and algorithms for disjoint set union problems von GALIL, Z, ITALIANO, G. F

Volltext

On a facility location problem with applications to tele-diagnostic von Apollonio, N., Caramia, M., Italiano, G. F.

Volltext

Maintaining dynamic minimum spanning trees: An experimental study von Cattaneo, G., Faruolo, P., Petrillo, U. Ferraro, Italiano, G.F.

Volltext

High Capacity Colored Two Dimensional codes von Grillo, A, Lentini, A, Querini, M, Italiano, G F

Volltext

Efficient Splitting and Merging Algorithms for Order Decomposable Problems von Grossi, Roberto, Italiano, Giuseppe F.

Volltext

A note on set union with arbitrary deunions von Galil, Zvi, Italiano, Giuseppe F.

Volltext

Hypergraph traversal revisited: Cost measures and dynamic algorithms von Ausiello, Giorgio, Italiano, Giuseppe F., Nanni, Umberto

Volltext

Small stretch (α,β)-spanners in the streaming model von Ausiello, Giorgio, Franciosa, Paolo G., Italiano, Giuseppe F.

Volltext

An algorithm for finding a k-median in a directed tree von VIGNERON, A, LIXIN GAO, GOLIN, M. J, ITALIANO, G. F, BO LI

Volltext

Efficient splitting and merging algorithms for order decomposable problems von GROSSI, R, ITALIANO, G. F

Volltext

Maintaining Spanning Trees of Small Diameter von Italiano, G. F., Ramaswami, R.

Volltext

Sparsification—a technique for speeding up dynamic graph algorithms von Eppstein, David, Galil, Zvi, Italiano, Giuseppe F, Nissenzweig, Amnon

Volltext