Sfoglia per Autore Italiano, Giuseppe Francesco
Amortized efficiency of a path retrieval data structure
1986 Italiano, Giuseppe Francesco
Finding paths and deleting edges in directed acyclic graphs
1988 Italiano, Giuseppe Francesco
Getting back to the past in the union-find problem
1988 G., Gambosi; Italiano, Giuseppe Francesco; M., Talamo
Worst-case analysis of the set union problem with extended backtracking
1989 Gambosi, G; Italiano, Giuseppe Francesco; Talamo, M
Dynamic maintenance of directed hypergraphs
1990 Ausiello, G; Italiano, Giuseppe Francesco; Nanni, U
Predicting deadlock in store-and-forward networks
1990 Arbib, C; Italiano, Giuseppe Francesco; Panconesi, A
Reducing edge connectivity to vertex connectivity
1991 Galil, Z; Italiano, Giuseppe Francesco
Incremental algorithms for minimal length paths
1991 Ausiello, G; Italiano, Giuseppe Francesco; Marchetti Spaccamela, A; Nanni, U
A note on set union with arbitrary deunions
1991 Galil, Z; Italiano, Giuseppe Francesco
Data structures and algorithms for disjoint set union problems
1991 Galil, Z; Italiano, Giuseppe Francesco
The set union problem with dynamic weighted backtracking
1991 Gambosi, G; Italiano, Giuseppe Francesco; Talamo, M
On-line algorithms for polynomially solvable satisfiability problems
1991 Ausiello, G; Italiano, Giuseppe Francesco
Maintenance of a minimum spanning forest in a dynamic plane graph
1992 Eppstein, D; Italiano, Giuseppe Francesco; Tamassia, R; Tarjan, R; Westbrook, J; Yung, M
Sparse dynamic programming II : convex and concave cost functions
1992 Eppstein, D; Galil, Z; Giancarlo, R; Italiano, Giuseppe Francesco
On-line computation of minimal and maximal length paths
1992 Ausiello, G; Italiano, Giuseppe Francesco; Marchetti Spaccamela, A; Nanni, U
Fully dynamic algorithms for 2-edge connectivity
1992 Galil, Z; Italiano, Giuseppe Francesco
Sparse dynamic programming I: linear cost functions
1992 Eppstein, D; Galil, Z; Giancarlo, R; Italiano, Giuseppe Francesco
Maintaining the 3-edge-connected components of a graph on-line
1993 Galil, Z.; Italiano, Giuseppe Francesco
The set union problem with unlimited backtracking
1994 A., Apostolico; Italiano, Giuseppe Francesco; G., Gambosi; M., Talamo
Decremental 2- and 3-connectivity on planar graphs
1996 Giammarresi, D.; Italiano, Giuseppe Francesco
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Amortized efficiency of a path retrieval data structure | 1986 | Italiano, Giuseppe Francesco | |
| Finding paths and deleting edges in directed acyclic graphs | 1988 | Italiano, Giuseppe Francesco | |
| Getting back to the past in the union-find problem | 1988 | G., Gambosi; Italiano, Giuseppe Francesco; M., Talamo | |
| Worst-case analysis of the set union problem with extended backtracking | 1989 | Gambosi, G; Italiano, Giuseppe Francesco; Talamo, M | |
| Dynamic maintenance of directed hypergraphs | 1990 | Ausiello, G; Italiano, Giuseppe Francesco; Nanni, U | |
| Predicting deadlock in store-and-forward networks | 1990 | Arbib, C; Italiano, Giuseppe Francesco; Panconesi, A | |
| Reducing edge connectivity to vertex connectivity | 1991 | Galil, Z; Italiano, Giuseppe Francesco | |
| Incremental algorithms for minimal length paths | 1991 | Ausiello, G; Italiano, Giuseppe Francesco; Marchetti Spaccamela, A; Nanni, U | |
| A note on set union with arbitrary deunions | 1991 | Galil, Z; Italiano, Giuseppe Francesco | |
| Data structures and algorithms for disjoint set union problems | 1991 | Galil, Z; Italiano, Giuseppe Francesco | |
| The set union problem with dynamic weighted backtracking | 1991 | Gambosi, G; Italiano, Giuseppe Francesco; Talamo, M | |
| On-line algorithms for polynomially solvable satisfiability problems | 1991 | Ausiello, G; Italiano, Giuseppe Francesco | |
| Maintenance of a minimum spanning forest in a dynamic plane graph | 1992 | Eppstein, D; Italiano, Giuseppe Francesco; Tamassia, R; Tarjan, R; Westbrook, J; Yung, M | |
| Sparse dynamic programming II : convex and concave cost functions | 1992 | Eppstein, D; Galil, Z; Giancarlo, R; Italiano, Giuseppe Francesco | |
| On-line computation of minimal and maximal length paths | 1992 | Ausiello, G; Italiano, Giuseppe Francesco; Marchetti Spaccamela, A; Nanni, U | |
| Fully dynamic algorithms for 2-edge connectivity | 1992 | Galil, Z; Italiano, Giuseppe Francesco | |
| Sparse dynamic programming I: linear cost functions | 1992 | Eppstein, D; Galil, Z; Giancarlo, R; Italiano, Giuseppe Francesco | |
| Maintaining the 3-edge-connected components of a graph on-line | 1993 | Galil, Z.; Italiano, Giuseppe Francesco | |
| The set union problem with unlimited backtracking | 1994 | A., Apostolico; Italiano, Giuseppe Francesco; G., Gambosi; M., Talamo | |
| Decremental 2- and 3-connectivity on planar graphs | 1996 | Giammarresi, D.; 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