AUSIELLO, Giorgio
AUSIELLO, Giorgio
DIPARTIMENTO DI INGEGNERIA INFORMATICA, AUTOMATICA E GESTIONALE -ANTONIO RUBERTI-
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs
2022 Ausiello, Giorgio; Balzotti, Lorenzo; Franciosa, Paolo G.; Lari, Isabella; Ribichini, Andrea
Algorithmes 'on-line'
2005 Ausiello, Giorgio; Becchetti, Luca
Algorithms for the On Line Quota Traveling Salesman Problem
2004 Ausiello, Giorgio; M., Demange; Laura, Luigi; V., Paschos
Algorithms for the on-line travelling salesman
2001 Ausiello, Giorgio; E., Feuerstein; Leonardi, Stefano; L., Stougie; M., Talamo
Approximate solution of NP optimization problems
1995 Ausiello, Giorgio; P. L., Crescenzi; M., Protasi
Chordality properties on graphs and minimal conceptual connections in semantic data models
1986 Ausiello, Giorgio; D'Atri, Alessandro; Moscarini, Marina
Completeness in Differential Approximation Classes
2003 Ausiello, Giorgio; C., Bazgan; M., Demange; V., Paschos
Completeness in differential approximation classes
2005 Ausiello, Giorgio; Cristina, Bazgan; Marc, Demange; Vangelis T. H., Paschos
Complexity and approximation, Combinatorial optimization problems and their approximability properties
1999 Ausiello, Giorgio; Crescenzi, P. A.; Gambosi, G.; Kann, V.; MARCHETTI SPACCAMELA, Alberto; Protasi, M.
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming
2010 Ausiello, Giorgio; Franciosa, Paolo Giulio; Italiano, GIUSEPPE FRANCESCO; Ribichini, Andrea
Computing graph spanners in small memory: fault-tolerance and streaming
2010 Ausiello, Giorgio; Ribichini, Andrea; Franciosa, Paolo Giulio; Italiano, GIUSEPPE FRANCESCO
Differential ratio approximation
2007 Ausiello, Giorgio; V. T., Paschos
Directed hypergraphs: problems, algorithmic results, and a novel decremental approach
2001 Ausiello, Giorgio; Franciosa, Paolo Giulio; Daniele, Frigioni
Dynamic maintenance of paths and path expressions on graphs
1989 Ausiello, G.; Spaccamela, A. Marchetti; Nanni, U.
Expressiveness and complexity of formal systems
1999 Ausiello, Giorgio; L., Cabibbo; In, ; A. CARSETTI E., D.; Kluwer,
Graph Spanners in the Streaming Model: An Experimental Study
2009 Ausiello, Giorgio; Demetrescu, Camil; Franciosa, Paolo Giulio; Italiano, GIUSEPPE FRANCESCO; Ribichini, Andrea
Greedy Algorithms for On-Line Set-Covering
2009 Ausiello, Giorgio; N., Bourgeois; A., Giannakos; Paschos, V. T. H.
Greedy algorithms for the on line set covering and other problems
2006 Ausiello, Giorgio; T., Giannakos; Paschos, V. T. H.
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms
1998 Ausiello, Giorgio; G. F., Italiano; Nanni, Umberto
Incremental algorithms for minimal length paths
1990 Ausiello, Giorgio; Italiano, Giuseppe F.; Spaccamela, Alberto Marchetti; Nanni, Umberto
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs | 2022 | Ausiello, Giorgio; Balzotti, Lorenzo; Franciosa, Paolo G.; Lari, Isabella; Ribichini, Andrea | |
| Algorithmes 'on-line' | 2005 | Ausiello, Giorgio; Becchetti, Luca | |
| Algorithms for the On Line Quota Traveling Salesman Problem | 2004 | Ausiello, Giorgio; M., Demange; Laura, Luigi; V., Paschos | |
| Algorithms for the on-line travelling salesman | 2001 | Ausiello, Giorgio; E., Feuerstein; Leonardi, Stefano; L., Stougie; M., Talamo | |
| Approximate solution of NP optimization problems | 1995 | Ausiello, Giorgio; P. L., Crescenzi; M., Protasi | |
| Chordality properties on graphs and minimal conceptual connections in semantic data models | 1986 | Ausiello, Giorgio; D'Atri, Alessandro; Moscarini, Marina | |
| Completeness in Differential Approximation Classes | 2003 | Ausiello, Giorgio; C., Bazgan; M., Demange; V., Paschos | |
| Completeness in differential approximation classes | 2005 | Ausiello, Giorgio; Cristina, Bazgan; Marc, Demange; Vangelis T. H., Paschos | |
| Complexity and approximation, Combinatorial optimization problems and their approximability properties | 1999 | Ausiello, Giorgio; Crescenzi, P. A.; Gambosi, G.; Kann, V.; MARCHETTI SPACCAMELA, Alberto; Protasi, M. | |
| Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming | 2010 | Ausiello, Giorgio; Franciosa, Paolo Giulio; Italiano, GIUSEPPE FRANCESCO; Ribichini, Andrea | |
| Computing graph spanners in small memory: fault-tolerance and streaming | 2010 | Ausiello, Giorgio; Ribichini, Andrea; Franciosa, Paolo Giulio; Italiano, GIUSEPPE FRANCESCO | |
| Differential ratio approximation | 2007 | Ausiello, Giorgio; V. T., Paschos | |
| Directed hypergraphs: problems, algorithmic results, and a novel decremental approach | 2001 | Ausiello, Giorgio; Franciosa, Paolo Giulio; Daniele, Frigioni | |
| Dynamic maintenance of paths and path expressions on graphs | 1989 | Ausiello, G.; Spaccamela, A. Marchetti; Nanni, U. | |
| Expressiveness and complexity of formal systems | 1999 | Ausiello, Giorgio; L., Cabibbo; In, ; A. CARSETTI E., D.; Kluwer, | |
| Graph Spanners in the Streaming Model: An Experimental Study | 2009 | Ausiello, Giorgio; Demetrescu, Camil; Franciosa, Paolo Giulio; Italiano, GIUSEPPE FRANCESCO; Ribichini, Andrea | |
| Greedy Algorithms for On-Line Set-Covering | 2009 | Ausiello, Giorgio; N., Bourgeois; A., Giannakos; Paschos, V. T. H. | |
| Greedy algorithms for the on line set covering and other problems | 2006 | Ausiello, Giorgio; T., Giannakos; Paschos, V. T. H. | |
| Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms | 1998 | Ausiello, Giorgio; G. F., Italiano; Nanni, Umberto | |
| Incremental algorithms for minimal length paths | 1990 | Ausiello, Giorgio; Italiano, Giuseppe F.; Spaccamela, Alberto Marchetti; Nanni, Umberto |