Sfoglia per Autore
Separator based sparsification I: planarity testing and minimum spanning trees
1996 Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Spencer, T.
An empirical study of dynamic graph algorithms
1997 Alberts, D; Cattaneo, G; Italiano, Giuseppe Francesco
Sparsification: A technique for speeding up dynamic graph algorithms
1997 Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Nissenzweig, A.
Maintaining spanning trees of small diameter
1998 Italiano, Giuseppe Francesco; Ramaswami, R.
Fully dynamic planarity testing with applications
1999 Galil, Z.; Italiano, Giuseppe Francesco; Sarnak, N.
Separator based sparsification II: edge and vertex connectivity
1999 Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Spencer, T.
Efficient splitting and merging algorithms for order decomposable problems
1999 Grossi, R.; Italiano, Giuseppe Francesco
Algorithm Engineering
1999 Cattaneo, G.; Italiano, Giuseppe Francesco
Dynamically switching vertices in planar graphs
2000 Frigioni, D.; Italiano, Giuseppe Francesco
An algorithm for finding a k-median in a directed tree
2000 A., Vigneron; L., Gao; M., Golin; Italiano, Giuseppe Francesco; B., Li
Visualization in algorithm engineering: Tools and techniques
2002 Demetrescu, C.; Finocchi, Irene; Italiano, Giuseppe Francesco; Naher, S.
CATAI: Cooperative Algorithm and Data Types Animation over the Internet
2002 G., Cattaneo; U., FERRARO PETRILLO; Italiano, Giuseppe Francesco
Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem
2002 A., Caprara; Italiano, Giuseppe Francesco; G., Mohan; A., Panconesi; A., Srinivasan
Improved Algorithms for Max Restricted Path Consistency
2003 Grandoni, F; Italiano, Giuseppe Francesco
A new approach to dynamic all pairs shortest paths
2004 C., Demetrescu; Italiano, Giuseppe Francesco
Engineering and visualizing algorithms
2004 Demetrescu, C; Finocchi, Irene; Italiano, Giuseppe Francesco
Sorting and searching in the presence of memory faults (without redundancy)
2004 Finocchi, Irene; Italiano, Giuseppe Francesco
Dynamic Trees
2004 Demetrescu, C.; Finocchi, Irene; Italiano, Giuseppe Francesco
Algorithm Engineering
2004 Demetrescu, C.; Finocchi, Irene; Italiano, Giuseppe Francesco
Dynamic Graphs
2004 Demetrescu, C.; Finocchi, Irene; Italiano, Giuseppe Francesco
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Separator based sparsification I: planarity testing and minimum spanning trees | 1996 | Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Spencer, T. | |
| An empirical study of dynamic graph algorithms | 1997 | Alberts, D; Cattaneo, G; Italiano, Giuseppe Francesco | |
| Sparsification: A technique for speeding up dynamic graph algorithms | 1997 | Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Nissenzweig, A. | |
| Maintaining spanning trees of small diameter | 1998 | Italiano, Giuseppe Francesco; Ramaswami, R. | |
| Fully dynamic planarity testing with applications | 1999 | Galil, Z.; Italiano, Giuseppe Francesco; Sarnak, N. | |
| Separator based sparsification II: edge and vertex connectivity | 1999 | Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Spencer, T. | |
| Efficient splitting and merging algorithms for order decomposable problems | 1999 | Grossi, R.; Italiano, Giuseppe Francesco | |
| Algorithm Engineering | 1999 | Cattaneo, G.; Italiano, Giuseppe Francesco | |
| Dynamically switching vertices in planar graphs | 2000 | Frigioni, D.; Italiano, Giuseppe Francesco | |
| An algorithm for finding a k-median in a directed tree | 2000 | A., Vigneron; L., Gao; M., Golin; Italiano, Giuseppe Francesco; B., Li | |
| Visualization in algorithm engineering: Tools and techniques | 2002 | Demetrescu, C.; Finocchi, Irene; Italiano, Giuseppe Francesco; Naher, S. | |
| CATAI: Cooperative Algorithm and Data Types Animation over the Internet | 2002 | G., Cattaneo; U., FERRARO PETRILLO; Italiano, Giuseppe Francesco | |
| Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem | 2002 | A., Caprara; Italiano, Giuseppe Francesco; G., Mohan; A., Panconesi; A., Srinivasan | |
| Improved Algorithms for Max Restricted Path Consistency | 2003 | Grandoni, F; Italiano, Giuseppe Francesco | |
| A new approach to dynamic all pairs shortest paths | 2004 | C., Demetrescu; Italiano, Giuseppe Francesco | |
| Engineering and visualizing algorithms | 2004 | Demetrescu, C; Finocchi, Irene; Italiano, Giuseppe Francesco | |
| Sorting and searching in the presence of memory faults (without redundancy) | 2004 | Finocchi, Irene; Italiano, Giuseppe Francesco | |
| Dynamic Trees | 2004 | Demetrescu, C.; Finocchi, Irene; Italiano, Giuseppe Francesco | |
| Algorithm Engineering | 2004 | Demetrescu, C.; Finocchi, Irene; Italiano, Giuseppe Francesco | |
| Dynamic Graphs | 2004 | Demetrescu, C.; Finocchi, Irene; Italiano, Giuseppe Francesco |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile