×

Italiano, Giuseppe Francesco

Compute Distance To:
Author ID: italiano.giuseppe-francesco Recent zbMATH articles by "Italiano, Giuseppe Francesco"
Published as: Italiano, Giuseppe F.; Italiano, G. F.; Italiano, Guiseppe F.; Italiano, Giuseppe; Italiano, Giuseppe Francesco
Homepage: http://people.uniroma2.it/giuseppe.italiano/
External Links: MGP · ORCID · Wikidata · Google Scholar · dblp · GND
all top 5

Co-Authors

4 single-authored
22 Georgiadis, Loukas
18 Demetrescu, Camil
16 Ausiello, Giorgio
16 Finocchi, Irene
16 Parotsidis, Nikos
14 Galil, Zvi
13 Laura, Luigi
12 Eppstein, David Arthur
11 Grandoni, Fabrizio
9 Franciosa, Paolo Giulio
7 Nanni, Umberto
6 Grossi, Roberto
6 Ribichini, Andrea
5 Karanasiou, Aikaterini
5 Santaroni, Federico
4 Bhattacharya, Sayan
4 Caramia, Massimiliano
4 Ferraro-Petrillo, Umberto
4 Gambosi, Giorgio
4 Giancarlo, Raffaele
4 Manoussakis, Yannis G.
4 Marchetti-Spaccamela, Alberto
4 Panconesi, Alessandro
4 Pham, Hong Phong
4 Rauch Henzinger, Monika
4 Talamo, Maurizio
4 Yung, Moti
3 Cattaneo, Giuseppe
3 Faruolo, Pompeo
3 Karczmarz, Adam
3 Łącki, Jakub
3 Paudel, Nilakantha
3 Sankowski, Piotr
3 Spencer, Thomas H.
3 Thang, Nguyen Kim
2 Acuña, Vicente
2 Alberts, David
2 Apollonio, Nicola
2 Arbib, Claudio
2 Arge, Lars
2 Breslauer, Dany
2 Caprara, Alberto
2 Cohen, Johanne
2 Dell’Olmo, Paolo
2 Firmani, Donatella
2 Frigioni, Daniele
2 Hansen, Thomas Dueholm
2 Holm, Jacob
2 Nissenzweig, Amnon
2 Palamidessi, Catuscia
2 Papadopoulos, Charis
2 Ramaswami, Rajiv
2 Rizzi, Romeo
2 Rotenberg, Eva
2 Sack, Harald
2 Sacomoto, Gustavo
2 Sagot, Marie-France
2 Sarnak, Neil
2 Sinaimeri, Blerina
2 Srinivasan, Aravind
2 Tamassia, Roberto
2 Tarjan, Robert Endre
2 Westbrook, Jeffery R.
1 Adaricheva, Kira Vladislavovna
1 Amato, Giuseppe
1 Apostolico, Alberto
1 Bilardi, Gianfranco
1 Bodlaender, Hans L.
1 Caires, Luís
1 Calamoneri, Tiziana
1 Cattaneo, Guiseppe
1 Chechik, Shiri
1 Chrobak, Marek
1 Crescenzi, Pilu
1 Di Luigi, William
1 Emiliozzi, Stefano
1 Fagerberg, Rolf
1 Fici, Gabriele
1 Gao, Lixin
1 Giammarresi, Dora
1 Giannis, Konstantinos
1 Goldberg, Andrew V.
1 Golin, Mordecai J.
1 Graf, Daniel
1 Groen, Frans C. A.
1 Jørgensen, Allan Grønlund
1 Kleine Büning, Hans
1 Krinninger, Sebastian
1 Leonardi, Stefano
1 Li, Bo
1 Lima, Leandro R. F.
1 Lima, Lucélia
1 Loitzenbauer, Veronika
1 Margaria-Steffen, Tiziana
1 Meinel, Christoph
1 Moggi, Eugenio
1 Mølhave, Thomas
1 Monteiro, Luís
1 Moruz, Gabriel
1 Mutzel, Petra
...and 27 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

111 Publications have been cited 640 times in 381 Documents Cited by Year
Sparsification – a technique for speeding up dynamic graph algorithms. Zbl 0891.68072
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon
44
1997
A new approach to dynamic all pairs shortest paths. Zbl 1125.68393
Demetrescu, Camil; Italiano, Giuseppe F.
36
2004
Maintenance of a minimum spanning forest in a dynamic plane graph. Zbl 0751.05081
Eppstein, David; Italiano, Giuseppe F.; Tamassia, Roberto; Tarjan, Robert E.; Westbrook, Jeffery; Yung, Moti
21
1992
Finding paths and deleting edges in directed acyclic graphs. Zbl 0663.68052
Italiano, Guiseppe F.
21
1988
Improved algorithms for Min-cut and Max-flow in undirected planar graphs. Zbl 1288.05276
Italiano, Giuseppe F.; Nussbaum, Yahav; Sankowski, Piotr; Wulff-Nilsen, Christian
21
2011
Amortized efficiency of a path retrieval data structure. Zbl 0638.68065
Italiano, G. F.
20
1986
Incremental algorithms for minimal length paths. Zbl 0751.68042
Ausiello, Giorgio; Italiano, Giuseppe F.; Spaccamela, Alberto Marchetti; Nanni, Umberto
19
1991
Finding strong bridges and strong articulation points in linear time. Zbl 1245.05128
Italiano, Giuseppe F.; Laura, Luigi; Santaroni, Federico
18
2012
Novel local-search-based approaches to university examination timetabling. Zbl 1243.90222
Caramia, Massimiliano; Dell’Olmo, Paolo; Italiano, Giuseppe F.
16
2008
Deterministic fully dynamic data structures for vertex cover and matching. Zbl 1372.68071
Bhattacharya, Sayan; Henzinger, Monika; Italiano, Giuseppe F.
15
2015
Sparsification – a technique for speeding up dynamic graph algorithms. (Extended abstract). Zbl 0977.68560
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon
15
1992
Sparse dynamic programming I: Linear cost functions. Zbl 0807.90120
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F.
15
1992
Improved approximation for single-sink buy-at-bulk. Zbl 1135.90422
Grandoni, Fabrizio; Italiano, Giuseppe F.
12
2006
Dynamic maintenance of directed hypergraphs. Zbl 0699.68027
Ausiello, Giorgio; Nanni, Umberto; Italiano, Giuseppe F.
11
1990
Separator based sparsification. I: Planarity testing and minimum spanning trees. Zbl 0846.68079
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H.
11
1996
Maintenance of a minimum spanning forest in a dynamic planar graph. Zbl 0800.68627
Eppstein, David; Italiano, Giuseppe F.; Tamassia, Roberto; Tarjan, Robert E.; Westbrook, Jeffery; Yung, Moti
10
1990
Experimental analysis of dynamic all pairs shortest path algorithms. Zbl 1321.05257
Demetrescu, Camil; Italiano, Giuseppe F.
10
2006
On-line algorithms for polynomially solvable satisfiability problems. Zbl 0774.68053
Ausiello, Giorgio; Italiano, Giuseppe F.
9
1991
Incremental algorithms for minimal length paths. Zbl 0800.68625
Ausiello, Giorgio; Italiano, Giuseppe F.; Marchetti Spaccamela, Alberto; Nanni, Umberto
9
1990
Sparse dynamic programming. II: Convex and concave cost functions. Zbl 0816.90130
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F.
9
1992
Fully dynamic all pairs shortest paths with real edge weights. Zbl 1103.68132
Demetrescu, Camil; Italiano, Giuseppe F.
8
2006
2-vertex connectivity in directed graphs. Zbl 1395.68208
Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Parotsidis, Nikos
8
2015
Separator based sparsification for dynamic planar graph algorithms. Zbl 1310.05197
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H.
8
1993
An algorithm for finding a \(k\)-median in a directed tree. Zbl 1003.68196
Vigneron, Antoine; Gao, Lixin; Golin, Mordecai J.; Italiano, Giuseppe F.; Li, Bo
7
2000
Dynamically switching vertices in planar graphs. Zbl 0959.68099
Frigioni, D.; Italiano, G. F.
7
2000
Optimal resilient sorting and searching in the presence of memory faults. Zbl 1223.68033
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
7
2006
Resilient search trees. Zbl 1302.68099
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
7
2007
Near real-time suffix tree construction via the fringe marked ancestor problem. Zbl 1267.68323
Breslauer, Dany; Italiano, Giuseppe F.
7
2013
Hypergraph traversal revisited: Cost measures and dynamic algorithms. Zbl 0916.05054
Ausiello, Giorgio; Italiano, Giuseppe F.; Nanni, Umberto
7
1998
Fully dynamic planarity testing with applications. Zbl 1064.05502
Galil, Zvi; Italiano, Giuseppe F.; Sarnak, Neil
7
1999
Design of trees in the hose model: the balanced case. Zbl 1112.90009
Italiano, Giuseppe; Leonardi, Stefano; Oriolo, Gianpaolo
7
2006
Sorting and searching in the presence of memory faults (without redundancy). Zbl 1192.68958
Finocchi, Irene; Italiano, Giuseppe F.
6
2004
Separator-based sparsification. II: Edge and vertex connectivity. Zbl 0914.68042
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H.
6
1998
Sparse dynamic programming. Zbl 0785.90094
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F.
6
1990
Sorting and searching in faulty memories. Zbl 1163.68319
Finocchi, Irene; Italiano, Giuseppe F.
6
2008
Maintaining spanning trees of small diameter. Zbl 0915.68084
Italiano, G. F.; Ramaswami, R.
6
1998
Optimal resilient sorting and searching in the presence of memory faults. Zbl 1183.68230
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
6
2009
Optimal resilient dynamic dictionaries. Zbl 1151.68384
Brodal, Gerth Stølting; Fagerberg, Rolf; Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.; Jørgensen, Allan Grønlund; Moruz, Gabriel; Mølhave, Thomas
6
2007
Small stretch spanners on dynamic graphs. Zbl 1161.68641
Ausiello, Giorgio; Franciosa, Paolo G.; Italiano, Giuseppe F.
6
2006
Design of dynamic algorithms via primal-dual method. Zbl 1395.90210
Bhattacharya, Sayan; Henzinger, Monika; Italiano, Giuseppe F.
6
2015
Fully dynamic algorithms for 2-edge connectivity. Zbl 0760.68022
Galil, Zvi; Italiano, Giuseppe F.
5
1992
Decremental single-source reachability in planar digraphs. Zbl 1370.05200
Italiano, Giuseppe F.; Karczmarz, Adam; Łącki, Jakub; Sankowski, Piotr
5
2017
The price of resiliency: A case study on sorting with memory faults. Zbl 1131.68434
Ferraro-Petrillo, Umberto; Finocchi, Irene; Italiano, Giuseppe F.
5
2006
CHECKCOL: improved local search for graph coloring. Zbl 1137.90022
Caramia, Massimiliano; Dell’Olmo, Paolo; Italiano, Giuseppe F.
5
2006
Designing reliable algorithms in unreliable memories. Zbl 1302.68106
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
5
2007
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs. Zbl 1410.05196
Chechik, Shiri; Hansen, Thomas Dueholm; Italiano, Giuseppe F.; Loitzenbauer, Veronika; Parotsidis, Nikos
4
2017
Maintaining biconnected components of dynamic planar graphs. Zbl 0764.68117
Galil, Zvi; Italiano, Giuseppe F.
4
1991
Maintaining the 3-edge-connected components of a graph on-line. Zbl 0767.68080
Galil, Zvi; Italiano, Giuseppe F.
4
1993
Computing graph spanners in small memory: fault-tolerance and streaming. Zbl 1211.68277
Ausiello, Giorgio; Ribichini, Andrea; Franciosa, Paolo G.; Italiano, Giuseppe F.
4
2010
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the \(O(n^{2})\) barrier. Zbl 1316.68058
Demetrescu, Camil; Italiano, Giuseppe F.
4
2005
2-edge connectivity in directed graphs. Zbl 1451.05092
Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Parotsidis, Nikos
4
2016
Computing 2-connected components and maximal 2-connected subgraphs in directed graphs: an experimental study. Zbl 1430.68210
Georgiadis, Loukas; Italiano, Giuseppe F.; Karanasiou, Aikaterini; Parotsidis, Nikos; Paudel, Nilakantha
4
2018
A new approach to dynamic all pairs shortest paths. Zbl 1192.90223
Demetrescu, Camil; Italiano, Giuseppe F.
3
2003
Strong connectivity in directed graphs under failures, with applications. Zbl 1410.68296
Georgiadis, Loukas; Italiano, Giuseppe F.; Parotsidis, Nikos
3
2017
2-edge connectivity in directed graphs. Zbl 1371.05155
Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Parotsidis, Nikos
3
2015
Dynamic data structures for series parallel digraphs. Zbl 0767.68020
Italiano, Giuseppe F.; Marchetti Spaccamela, Alberto; Nanni, Umberto
3
1989
Worst-case analysis of the set-union problem with extended backtracking. Zbl 0678.68035
Gambosi, Giorgio; Italiano, Giuseppe F.; Talamo, Maurizio
3
1989
A note on set union with arbitrary deunions. Zbl 0714.68039
Galil, Zvi; Italiano, Giuseppe F.
3
1991
2-vertex connectivity in directed graphs. Zbl 1395.68209
Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Parotsidis, Nikos
3
2018
Resilient dictionaries. Zbl 1300.68020
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
3
2009
On suffix extensions in suffix trees. Zbl 1251.68081
Breslauer, Dany; Italiano, Giuseppe F.
3
2012
Wavelength rerouting in optical networks, or the Venetian routing problem. Zbl 1030.68102
Caprara, Alberto; Italiano, Giuseppe F.; Mohan, G.; Panconesi, Alessandro; Srinivasan, Aravind
3
2002
Small stretch spanners in the streaming model: New algorithms and experiments. Zbl 1151.68733
Ausiello, Giorgio; Demetrescu, Camil; Franciosa, Paolo G.; Italiano, Giuseppe F.; Ribichini, Andrea
3
2007
Graph spanners in the streaming model: An experimental study. Zbl 1189.68174
Ausiello, Giorgio; Demetrescu, Camil; Franciosa, Paolo G.; Italiano, Giuseppe F.; Ribichini, Andrea
3
2009
2-connectivity in directed graphs: an experimental study. Zbl 1430.05125
Di Luigi, William; Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Parotsidis, Nikos
3
2015
Is timetabling routing always reliable for public transport? Zbl 1281.90008
Firmani, Donatella; Italiano, Giuseppe F.; Laura, Luigi; Santaroni, Federico
3
2013
Efficient cross-trees for external memory. Zbl 0947.68039
Grossi, Roberto; Italiano, Giuseppe F.
2
1999
Efficient splitting and merging algorithms for order decomposable problems. Zbl 1045.68556
Grossi, Roberto; Italiano, Giuseppe F.
2
1999
Incremental 2-edge-connectivity in directed graphs. Zbl 1388.05178
Georgiadis, Loukas; Italiano, Giuseppe F.; Parotsidis, Nikos
2
2016
On bubble generators in directed graphs. Zbl 1435.68225
Acuña, Vicente; Grossi, Roberto; Italiano, Giuseppe F.; Lima, Leandro; Rizzi, Romeo; Sacomoto, Gustavo; Sagot, Marie-France; Sinaimeri, Blerina
2
2017
On-line computation of minimal and maximal length paths. Zbl 0745.68084
Ausiello, Giorgio; Italiano, Giuseppe F.; Spaccamela, Alberto Marchetti; Nanni, Umberto
2
1992
Getting back to the past in the union-find problem. Zbl 0644.68059
Gambosi, Giorgio; Italiano, Guiseppe F.; Talamo, Maurizio
2
1988
An empirical study of dynamic graph algorithms. Zbl 1073.68699
Alberts, David; Cattaneo, Giuseppe; Italiano, Giuseppe F.
2
1997
Decremental 2- and 3-connectivity on planar graphs. Zbl 0858.68064
Giammarresi, D.; Italiano, G. F.
2
1996
Mantaining dynamic matrices for fully dynamic transitive closure. Zbl 1147.68090
Demetrescu, Camil; Italiano, Giuseppe F.
2
2008
Structure theorems for optimum hyperpaths in directed hypergraphs. Zbl 1312.05097
Ausiello, Giorgio; Italiano, Giuseppe F.; Laura, Luigi; Nanni, Umberto; Sarracco, Fabiano
2
2012
Finding strong bridges and strong articulation points in linear time. Zbl 1311.05190
Italiano, Giuseppe F.; Laura, Luigi; Santaroni, Federico
2
2010
Improved bounds and new trade-offs for dynamic all pairs shortest paths. Zbl 1057.68648
Demetrescu, Camil; Italiano, Giuseppe F.
2
2002
Small stretch spanners on dynamic graphs. Zbl 1162.68489
Ausiello, Giorgio; Franciosa, Paolo G.; Italiano, Giuseppe F.
2
2005
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures. Zbl 1102.68512
Demetrescu, Camil; Italiano, Giuseppe F.
2
2006
On resilient graph spanners. Zbl 1335.68181
Ausiello, Giorgio; Franciosa, Paolo Giulio; Italiano, Giuseppe Francesco; Ribichini, Andrea
2
2013
The price of resiliency: a case study on sorting with memory faults. Zbl 1183.68229
Ferraro-Petrillo, Umberto; Finocchi, Irene; Italiano, Giuseppe F.
2
2009
Decremental data structures for connectivity and dominators in directed graphs. Zbl 1441.68184
Georgiadis, Loukas; Hansen, Thomas Dueholm; Italiano, Giuseppe F.; Krinninger, Sebastian; Parotsidis, Nikos
2
2017
Contracting a planar graph efficiently. Zbl 1442.68176
Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam; Łącki, Jakub; Rotenberg, Eva; Sankowski, Piotr
2
2017
Computing critical nodes in directed graphs. Zbl 1430.68234
Paudel, Nilakantha; Georgiadis, Loukas; Italiano, Giuseppe F.
2
2018
On resilient graph spanners. Zbl 1339.68198
Ausiello, Giorgio; Franciosa, Paolo G.; Italiano, Giuseppe F.; Ribichini, Andrea
2
2016
Experimental analysis of dynamic all pairs shortest path algorithms. Zbl 1317.68259
Demetrescu, Camil; Emiliozzi, Stefano; Italiano, Giuseppe F.
2
2004
Experimental analysis of dynamic minimum spanning tree algorithms. Zbl 1321.05250
Amato, Giuseppe; Cattaneo, Giuseppe; Italiano, Giuseppe F.
2
1997
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs. Zbl 1466.68058
Georgiadis, Loukas; Italiano, Giuseppe F.; Papadopoulos, Charis; Parotsidis, Nikos
2
2015
Data structures resilient to memory faults: an experimental study of dictionaries. Zbl 1322.68061
Ferraro-Petrillo, Umberto; Grandoni, Fabrizio; Italiano, Giuseppe F.
2
2013
What do we learn from experimental algorithmics? Zbl 0996.68869
Demetrescu, Camil; Italiano, Giuseppe F.
1
2000
Deterministic fully dynamic data structures for vertex cover and matching. Zbl 1390.05221
Bhattacharya, Sayan; Henzinger, Monika; Italiano, Giuseppe F.
1
2018
Efficient splitting and merging algorithms for order decomposable problems. Zbl 1401.68055
Grossi, Roberto; Italiano, Giuseppe F.
1
1997
Sparse certificates for 2-connectivity in directed graphs. Zbl 1380.05185
Georgiadis, Loukas; Italiano, Giuseppe F.; Karanasiou, Aikaterini; Papadopoulos, Charis; Parotsidis, Nikos
1
2017
Dynamic graphs. 2nd edition. Zbl 1387.68083
Demetrescu, Camil; Finocchi, Irene; Italiano, Giuseppe F.
1
2018
Predicting deadlock in store-and-forward networks. Zbl 0718.68009
Arbib, Claudio; Italiano, Giuseppe F.; Panconesi, Alessandro
1
1990
The set union problem with dynamic weighted backtracking. Zbl 0727.68040
Gambosi, Giorgio; Italiano, Guiseppe F.; Talamo, Maurizio
1
1991
Efficient sequential and parallel algorithms for computing recovery points in trees and paths. Zbl 0800.68622
Chrobak, Marek; Eppstein, David; Italiano, Giuseppe F.; Yung, Moti
1
1991
Dynamic algorithms via the primal-dual method. Zbl 1395.90209
Bhattacharya, Sayan; Henzinger, Monika; Italiano, Giuseppe
1
2018
Incremental strong connectivity and 2-connectivity in directed graphs. Zbl 07166222
Georgiadis, Loukas; Italiano, Giuseppe F.; Parotsidis, Nikos
1
2018
Computing 2-connected components and maximal 2-connected subgraphs in directed graphs: an experimental study. Zbl 1430.68210
Georgiadis, Loukas; Italiano, Giuseppe F.; Karanasiou, Aikaterini; Parotsidis, Nikos; Paudel, Nilakantha
4
2018
2-vertex connectivity in directed graphs. Zbl 1395.68209
Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Parotsidis, Nikos
3
2018
Computing critical nodes in directed graphs. Zbl 1430.68234
Paudel, Nilakantha; Georgiadis, Loukas; Italiano, Giuseppe F.
2
2018
Deterministic fully dynamic data structures for vertex cover and matching. Zbl 1390.05221
Bhattacharya, Sayan; Henzinger, Monika; Italiano, Giuseppe F.
1
2018
Dynamic graphs. 2nd edition. Zbl 1387.68083
Demetrescu, Camil; Finocchi, Irene; Italiano, Giuseppe F.
1
2018
Dynamic algorithms via the primal-dual method. Zbl 1395.90209
Bhattacharya, Sayan; Henzinger, Monika; Italiano, Giuseppe
1
2018
Incremental strong connectivity and 2-connectivity in directed graphs. Zbl 07166222
Georgiadis, Loukas; Italiano, Giuseppe F.; Parotsidis, Nikos
1
2018
Decremental SPQR-trees for planar graphs. Zbl 07378716
Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam; Łącki, Jakub; Rotenberg, Eva
1
2018
Decremental single-source reachability in planar digraphs. Zbl 1370.05200
Italiano, Giuseppe F.; Karczmarz, Adam; Łącki, Jakub; Sankowski, Piotr
5
2017
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs. Zbl 1410.05196
Chechik, Shiri; Hansen, Thomas Dueholm; Italiano, Giuseppe F.; Loitzenbauer, Veronika; Parotsidis, Nikos
4
2017
Strong connectivity in directed graphs under failures, with applications. Zbl 1410.68296
Georgiadis, Loukas; Italiano, Giuseppe F.; Parotsidis, Nikos
3
2017
On bubble generators in directed graphs. Zbl 1435.68225
Acuña, Vicente; Grossi, Roberto; Italiano, Giuseppe F.; Lima, Leandro; Rizzi, Romeo; Sacomoto, Gustavo; Sagot, Marie-France; Sinaimeri, Blerina
2
2017
Decremental data structures for connectivity and dominators in directed graphs. Zbl 1441.68184
Georgiadis, Loukas; Hansen, Thomas Dueholm; Italiano, Giuseppe F.; Krinninger, Sebastian; Parotsidis, Nikos
2
2017
Contracting a planar graph efficiently. Zbl 1442.68176
Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam; Łącki, Jakub; Rotenberg, Eva; Sankowski, Piotr
2
2017
Sparse certificates for 2-connectivity in directed graphs. Zbl 1380.05185
Georgiadis, Loukas; Italiano, Giuseppe F.; Karanasiou, Aikaterini; Papadopoulos, Charis; Parotsidis, Nikos
1
2017
All-pairs 2-reachability in \(\mathcal{O}(n^\omega\log n)\) time. Zbl 1441.68183
Georgiadis, Loukas; Graf, Daniel; Italiano, Giuseppe F.; Parotsidis, Nikos; Uznański, Przemysław
1
2017
2-edge connectivity in directed graphs. Zbl 1451.05092
Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Parotsidis, Nikos
4
2016
Incremental 2-edge-connectivity in directed graphs. Zbl 1388.05178
Georgiadis, Loukas; Italiano, Giuseppe F.; Parotsidis, Nikos
2
2016
On resilient graph spanners. Zbl 1339.68198
Ausiello, Giorgio; Franciosa, Paolo G.; Italiano, Giuseppe F.; Ribichini, Andrea
2
2016
Strong articulation points and strong bridges in large scale graphs. Zbl 1333.05289
Firmani, Donatella; Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Santaroni, Federico
1
2016
Deterministic fully dynamic data structures for vertex cover and matching. Zbl 1372.68071
Bhattacharya, Sayan; Henzinger, Monika; Italiano, Giuseppe F.
15
2015
2-vertex connectivity in directed graphs. Zbl 1395.68208
Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Parotsidis, Nikos
8
2015
Design of dynamic algorithms via primal-dual method. Zbl 1395.90210
Bhattacharya, Sayan; Henzinger, Monika; Italiano, Giuseppe F.
6
2015
2-edge connectivity in directed graphs. Zbl 1371.05155
Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Parotsidis, Nikos
3
2015
2-connectivity in directed graphs: an experimental study. Zbl 1430.05125
Di Luigi, William; Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Parotsidis, Nikos
3
2015
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs. Zbl 1466.68058
Georgiadis, Loukas; Italiano, Giuseppe F.; Papadopoulos, Charis; Parotsidis, Nikos
2
2015
Near real-time suffix tree construction via the fringe marked ancestor problem. Zbl 1267.68323
Breslauer, Dany; Italiano, Giuseppe F.
7
2013
Is timetabling routing always reliable for public transport? Zbl 1281.90008
Firmani, Donatella; Italiano, Giuseppe F.; Laura, Luigi; Santaroni, Federico
3
2013
On resilient graph spanners. Zbl 1335.68181
Ausiello, Giorgio; Franciosa, Paolo Giulio; Italiano, Giuseppe Francesco; Ribichini, Andrea
2
2013
Data structures resilient to memory faults: an experimental study of dictionaries. Zbl 1322.68061
Ferraro-Petrillo, Umberto; Grandoni, Fabrizio; Italiano, Giuseppe F.
2
2013
Finding strong bridges and strong articulation points in linear time. Zbl 1245.05128
Italiano, Giuseppe F.; Laura, Luigi; Santaroni, Federico
18
2012
On suffix extensions in suffix trees. Zbl 1251.68081
Breslauer, Dany; Italiano, Giuseppe F.
3
2012
Structure theorems for optimum hyperpaths in directed hypergraphs. Zbl 1312.05097
Ausiello, Giorgio; Italiano, Giuseppe F.; Laura, Luigi; Nanni, Umberto; Sarracco, Fabiano
2
2012
An experimental study of dynamic dominators. Zbl 1365.05278
Georgiadis, Loukas; Italiano, Giuseppe F.; Laura, Luigi; Santaroni, Federico
1
2012
Improved algorithms for Min-cut and Max-flow in undirected planar graphs. Zbl 1288.05276
Italiano, Giuseppe F.; Nussbaum, Yahav; Sankowski, Piotr; Wulff-Nilsen, Christian
21
2011
Computing graph spanners in small memory: fault-tolerance and streaming. Zbl 1211.68277
Ausiello, Giorgio; Ribichini, Andrea; Franciosa, Paolo G.; Italiano, Giuseppe F.
4
2010
Finding strong bridges and strong articulation points in linear time. Zbl 1311.05190
Italiano, Giuseppe F.; Laura, Luigi; Santaroni, Federico
2
2010
Resilient algorithms and data structures. Zbl 1284.68629
Italiano, Giuseppe F.
1
2010
Optimal resilient sorting and searching in the presence of memory faults. Zbl 1183.68230
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
6
2009
Resilient dictionaries. Zbl 1300.68020
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
3
2009
Graph spanners in the streaming model: An experimental study. Zbl 1189.68174
Ausiello, Giorgio; Demetrescu, Camil; Franciosa, Paolo G.; Italiano, Giuseppe F.; Ribichini, Andrea
3
2009
The price of resiliency: a case study on sorting with memory faults. Zbl 1183.68229
Ferraro-Petrillo, Umberto; Finocchi, Irene; Italiano, Giuseppe F.
2
2009
Small stretch \((\alpha ,\beta )\)-spanners in the streaming model. Zbl 1191.68819
Ausiello, Giorgio; Franciosa, Paolo G.; Italiano, Giuseppe F.
1
2009
Novel local-search-based approaches to university examination timetabling. Zbl 1243.90222
Caramia, Massimiliano; Dell’Olmo, Paolo; Italiano, Giuseppe F.
16
2008
Sorting and searching in faulty memories. Zbl 1163.68319
Finocchi, Irene; Italiano, Giuseppe F.
6
2008
Mantaining dynamic matrices for fully dynamic transitive closure. Zbl 1147.68090
Demetrescu, Camil; Italiano, Giuseppe F.
2
2008
Resilient search trees. Zbl 1302.68099
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
7
2007
Optimal resilient dynamic dictionaries. Zbl 1151.68384
Brodal, Gerth Stølting; Fagerberg, Rolf; Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.; Jørgensen, Allan Grønlund; Moruz, Gabriel; Mølhave, Thomas
6
2007
Designing reliable algorithms in unreliable memories. Zbl 1302.68106
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
5
2007
Small stretch spanners in the streaming model: New algorithms and experiments. Zbl 1151.68733
Ausiello, Giorgio; Demetrescu, Camil; Franciosa, Paolo G.; Italiano, Giuseppe F.; Ribichini, Andrea
3
2007
SOFSEM 2007: Theory and practice of computer science. 33rd conference on current trends in theory and practice of computer science, Harrachov, Czech Republic, January 20–26, 2007. Proceedings. Zbl 1129.68007
1
2007
Algorithmic techniques for maintaining shortest routes in dynamic networks. Zbl 1277.68024
Demetrescu, Camil; Italiano, Giuseppe F.
1
2007
Improved approximation for single-sink buy-at-bulk. Zbl 1135.90422
Grandoni, Fabrizio; Italiano, Giuseppe F.
12
2006
Experimental analysis of dynamic all pairs shortest path algorithms. Zbl 1321.05257
Demetrescu, Camil; Italiano, Giuseppe F.
10
2006
Fully dynamic all pairs shortest paths with real edge weights. Zbl 1103.68132
Demetrescu, Camil; Italiano, Giuseppe F.
8
2006
Optimal resilient sorting and searching in the presence of memory faults. Zbl 1223.68033
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
7
2006
Design of trees in the hose model: the balanced case. Zbl 1112.90009
Italiano, Giuseppe; Leonardi, Stefano; Oriolo, Gianpaolo
7
2006
Small stretch spanners on dynamic graphs. Zbl 1161.68641
Ausiello, Giorgio; Franciosa, Paolo G.; Italiano, Giuseppe F.
6
2006
The price of resiliency: A case study on sorting with memory faults. Zbl 1131.68434
Ferraro-Petrillo, Umberto; Finocchi, Irene; Italiano, Giuseppe F.
5
2006
CHECKCOL: improved local search for graph coloring. Zbl 1137.90022
Caramia, Massimiliano; Dell’Olmo, Paolo; Italiano, Giuseppe F.
5
2006
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures. Zbl 1102.68512
Demetrescu, Camil; Italiano, Giuseppe F.
2
2006
Does path cleaning help in dynamic all-pairs shortest paths? Zbl 1131.90454
Demetrescu, C.; Faruolo, P.; Italiano, G. F.; Thorup, M.
1
2006
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the \(O(n^{2})\) barrier. Zbl 1316.68058
Demetrescu, Camil; Italiano, Giuseppe F.
4
2005
Small stretch spanners on dynamic graphs. Zbl 1162.68489
Ausiello, Giorgio; Franciosa, Paolo G.; Italiano, Giuseppe F.
2
2005
Designing reliable algorithms in unreliable memories. Zbl 1162.68307
Finocchi, Irene; Grandoni, Fabrizio; Italiano, Giuseppe F.
1
2005
A new approach to dynamic all pairs shortest paths. Zbl 1125.68393
Demetrescu, Camil; Italiano, Giuseppe F.
36
2004
Sorting and searching in the presence of memory faults (without redundancy). Zbl 1192.68958
Finocchi, Irene; Italiano, Giuseppe F.
6
2004
Experimental analysis of dynamic all pairs shortest path algorithms. Zbl 1317.68259
Demetrescu, Camil; Emiliozzi, Stefano; Italiano, Giuseppe F.
2
2004
A new approach to dynamic all pairs shortest paths. Zbl 1192.90223
Demetrescu, Camil; Italiano, Giuseppe F.
3
2003
Wavelength rerouting in optical networks, or the Venetian routing problem. Zbl 1030.68102
Caprara, Alberto; Italiano, Giuseppe F.; Mohan, G.; Panconesi, Alessandro; Srinivasan, Aravind
3
2002
Improved bounds and new trade-offs for dynamic all pairs shortest paths. Zbl 1057.68648
Demetrescu, Camil; Italiano, Giuseppe F.
2
2002
Maintaining dynamic minimum spanning trees: An experimental study. Zbl 1014.68738
Cattaneo, Giuseppe; Faruolo, Pompeo; Petrillo, Umberto Ferraro; Italiano, Giuseppe F.
1
2002
An algorithm for finding a \(k\)-median in a directed tree. Zbl 1003.68196
Vigneron, Antoine; Gao, Lixin; Golin, Mordecai J.; Italiano, Giuseppe F.; Li, Bo
7
2000
Dynamically switching vertices in planar graphs. Zbl 0959.68099
Frigioni, D.; Italiano, G. F.
7
2000
What do we learn from experimental algorithmics? Zbl 0996.68869
Demetrescu, Camil; Italiano, Giuseppe F.
1
2000
Fully dynamic planarity testing with applications. Zbl 1064.05502
Galil, Zvi; Italiano, Giuseppe F.; Sarnak, Neil
7
1999
Efficient cross-trees for external memory. Zbl 0947.68039
Grossi, Roberto; Italiano, Giuseppe F.
2
1999
Efficient splitting and merging algorithms for order decomposable problems. Zbl 1045.68556
Grossi, Roberto; Italiano, Giuseppe F.
2
1999
Hypergraph traversal revisited: Cost measures and dynamic algorithms. Zbl 0916.05054
Ausiello, Giorgio; Italiano, Giuseppe F.; Nanni, Umberto
7
1998
Separator-based sparsification. II: Edge and vertex connectivity. Zbl 0914.68042
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H.
6
1998
Maintaining spanning trees of small diameter. Zbl 0915.68084
Italiano, G. F.; Ramaswami, R.
6
1998
Sparsification – a technique for speeding up dynamic graph algorithms. Zbl 0891.68072
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon
44
1997
An empirical study of dynamic graph algorithms. Zbl 1073.68699
Alberts, David; Cattaneo, Giuseppe; Italiano, Giuseppe F.
2
1997
Experimental analysis of dynamic minimum spanning tree algorithms. Zbl 1321.05250
Amato, Giuseppe; Cattaneo, Giuseppe; Italiano, Giuseppe F.
2
1997
Efficient splitting and merging algorithms for order decomposable problems. Zbl 1401.68055
Grossi, Roberto; Italiano, Giuseppe F.
1
1997
Separator based sparsification. I: Planarity testing and minimum spanning trees. Zbl 0846.68079
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H.
11
1996
Decremental 2- and 3-connectivity on planar graphs. Zbl 0858.68064
Giammarresi, D.; Italiano, G. F.
2
1996
Separator based sparsification for dynamic planar graph algorithms. Zbl 1310.05197
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H.
8
1993
Maintaining the 3-edge-connected components of a graph on-line. Zbl 0767.68080
Galil, Zvi; Italiano, Giuseppe F.
4
1993
Maintenance of a minimum spanning forest in a dynamic plane graph. Zbl 0751.05081
Eppstein, David; Italiano, Giuseppe F.; Tamassia, Roberto; Tarjan, Robert E.; Westbrook, Jeffery; Yung, Moti
21
1992
Sparsification – a technique for speeding up dynamic graph algorithms. (Extended abstract). Zbl 0977.68560
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon
15
1992
Sparse dynamic programming I: Linear cost functions. Zbl 0807.90120
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F.
15
1992
Sparse dynamic programming. II: Convex and concave cost functions. Zbl 0816.90130
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F.
9
1992
Fully dynamic algorithms for 2-edge connectivity. Zbl 0760.68022
Galil, Zvi; Italiano, Giuseppe F.
5
1992
On-line computation of minimal and maximal length paths. Zbl 0745.68084
Ausiello, Giorgio; Italiano, Giuseppe F.; Spaccamela, Alberto Marchetti; Nanni, Umberto
2
1992
Incremental algorithms for minimal length paths. Zbl 0751.68042
Ausiello, Giorgio; Italiano, Giuseppe F.; Spaccamela, Alberto Marchetti; Nanni, Umberto
19
1991
On-line algorithms for polynomially solvable satisfiability problems. Zbl 0774.68053
Ausiello, Giorgio; Italiano, Giuseppe F.
9
1991
Maintaining biconnected components of dynamic planar graphs. Zbl 0764.68117
Galil, Zvi; Italiano, Giuseppe F.
4
1991
A note on set union with arbitrary deunions. Zbl 0714.68039
Galil, Zvi; Italiano, Giuseppe F.
3
1991
The set union problem with dynamic weighted backtracking. Zbl 0727.68040
Gambosi, Giorgio; Italiano, Guiseppe F.; Talamo, Maurizio
1
1991
...and 11 more Documents
all top 5

Cited by 659 Authors

38 Italiano, Giuseppe Francesco
17 Rauch Henzinger, Monika
11 Ausiello, Giorgio
9 Baswana, Surender
9 Georgiadis, Loukas
8 Leucci, Stefano
8 Mozes, Shay
7 Bilò, Davide
7 Burke, Edmund Kieran
7 Frigioni, Daniele
7 Gualà, Luciano
7 Laura, Luigi
7 Proietti, Guido
7 Subramani, Krishnan
6 Eppstein, David Arthur
6 Franciosa, Paolo Giulio
6 Grandoni, Fabrizio
6 Nanni, Umberto
6 Rizzi, Romeo
6 Roditty, Liam
6 Tamassia, Roberto
5 Bhattacharya, Sayan
5 Demetrescu, Camil
5 Finocchi, Irene
5 Parotsidis, Nikos
5 Weimann, Oren
4 Baïou, Mourad
4 Barahona, Francisco
4 Gawrychowski, Paweł
4 Grossi, Roberto
4 Holm, Jacob
4 Jaberi, Raed
4 Karczmarz, Adam
4 Khan, Shahbaz
4 Krinninger, Sebastian
4 Łącki, Jakub
4 Marchetti-Spaccamela, Alberto
4 McCollum, Barry
4 Sadakane, Kunihiko
3 Abdul-Rahman, Syariza
3 Afshani, Peyman
3 Bernstein, Aaron
3 Caramia, Massimiliano
3 Chao, Kunmao
3 Charalampopoulos, Panagiotis
3 Choudhary, Keerti
3 Cicerone, Serafino
3 Colella, Feliciano
3 Damaschke, Peter
3 D’Angelo, Gianlorenzo
3 Dell’Olmo, Paolo
3 Gallo, Giorgio
3 Gambosi, Giorgio
3 Karanasiou, Aikaterini
3 Korman, Amos
3 Nanongkai, Danupon
3 Nussbaum, Yahav
3 Oriolo, Gianpaolo
3 Ozcan, Ender
3 Paschos, Vangelis Th.
3 Peleg, David
3 Peng, Pan
3 Qu, Rong
3 Ribichini, Andrea
3 Rotenberg, Eva
3 Sankowski, Piotr
3 Talamo, Maurizio
3 Wulff-Nilsen, Christian
3 Ziv-Ukelson, Michal
3 Zwick, Uri
2 Abdullah, Salwani
2 Alimonti, Paola
2 Alzaqebah, Malek
2 Bar-Natan, Aviv
2 Bargiela, Andrzej
2 Boria, Nicolas
2 Borradaile, Glencora
2 Breslauer, Dany
2 Brodnik, Andrej
2 Cairo, Massimo
2 Chang, Maw-Shang
2 Chechik, Shiri
2 Chimani, Markus
2 Chrobak, Marek
2 Cionini, Alessio
2 Crespelle, Christophe
2 Crochemore, Maxime
2 Czumaj, Artur
2 D’Emidio, Mattia
2 Di Battista, Giuseppe
2 Di Stefano, Gabriele
2 Ding, Wei
2 Feuerstein, Esteban
2 Firmani, Donatella
2 Fox, Kyle
2 Friedrich, Tobias
2 Galil, Zvi
2 Giaccio, Roberto
2 Giannakopoulou, Kalliopi
2 Goodrich, Michael Truman
...and 559 more Authors
all top 5

Cited in 78 Serials

52 Algorithmica
44 Theoretical Computer Science
21 Discrete Applied Mathematics
19 Information Processing Letters
16 SIAM Journal on Computing
13 Journal of Discrete Algorithms
11 Computers & Operations Research
9 Journal of Computer and System Sciences
7 European Journal of Operational Research
7 Annals of Mathematics and Artificial Intelligence
6 Information and Computation
5 Annals of Operations Research
5 Computational Geometry
5 Theory of Computing Systems
5 Discrete Optimization
4 Networks
4 Discrete & Computational Geometry
4 Journal of Combinatorial Optimization
3 Artificial Intelligence
3 Operations Research Letters
3 Mathematical Programming. Series A. Series B
3 Journal of Scheduling
3 Computer Science Review
2 BIT
2 Computing
2 Information Sciences
2 Journal of Complexity
2 Journal of Parallel and Distributed Computing
2 International Journal of Computational Geometry & Applications
2 Distributed Computing
2 RAIRO. Informatique Théorique et Applications
2 Journal of Heuristics
2 Journal of Graph Algorithms and Applications
2 RAIRO. Theoretical Informatics and Applications
2 RAIRO. Operations Research
2 JMMA. Journal of Mathematical Modelling and Algorithms
2 Algorithms
1 ACM Computing Surveys
1 Acta Informatica
1 Discrete Mathematics
1 Bulletin of Mathematical Biology
1 The Annals of Statistics
1 Journal of Combinatorial Theory. Series B
1 Naval Research Logistics
1 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods
1 European Journal of Combinatorics
1 Cybernetics and Systems
1 Science of Computer Programming
1 Journal of Automated Reasoning
1 Applied Mathematics Letters
1 SIAM Journal on Discrete Mathematics
1 Random Structures & Algorithms
1 JETAI. Journal of Experimental & Theoretical Artificial Intelligence
1 MSCS. Mathematical Structures in Computer Science
1 Automation and Remote Control
1 International Journal of Computer Mathematics
1 Pattern Recognition
1 SIAM Review
1 Journal of Functional Programming
1 Bulletin des Sciences Mathématiques
1 Journal of Difference Equations and Applications
1 INFORMS Journal on Computing
1 Mathematical Problems in Engineering
1 Data Mining and Knowledge Discovery
1 Theory and Practice of Logic Programming
1 OR Spectrum
1 ACM Journal of Experimental Algorithmics
1 Computational Biology and Chemistry
1 The European Physical Journal B. Condensed Matter and Complex Systems
1 Statistical Analysis and Data Mining
1 Electronic Journal of Statistics
1 Ars Mathematica Contemporanea
1 Discrete Mathematics, Algorithms and Applications
1 Advances in Operations Research
1 RAIRO. Theoretical Informatics and Applications
1 Mathematics
1 Journal of Optimization
1 DML. Discrete Mathematics Letters

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.