Sfoglia per Autore
Toward a unified approach for the classification of NP-complete optimization problems
1980 Ausiello, Giorgio; MARCHETTI SPACCAMELA, Alberto; M., Protasi
Chordality properties on graphs and minimal conceptual connections in semantic data models
1986 Ausiello, Giorgio; D'Atri, Alessandro; Moscarini, Marina
Dynamic maintenance of paths and path expressions on graphs
1989 Ausiello, G.; Spaccamela, A. Marchetti; Nanni, U.
Limiting polynomial approximation of complexity classes
1990 Ausiello, Giorgio; M., Protasi
Incremental algorithms for minimal length paths
1990 Ausiello, Giorgio; Italiano, Giuseppe F.; Spaccamela, Alberto Marchetti; Nanni, Umberto
On line algorithms for polynomially solvable satisfiability problems
1991 Ausiello, Giorgio; G. F., Italiano
Incremental algorithms for minimal length paths
1991 Ausiello, Giorgio; Italiano, GIUSEPPE FRANCESCO; MARCHETTI SPACCAMELA, Alberto; Nanni, Umberto
On line computation of minimal and maximal length paths
1992 Ausiello, Giorgio; Italiano, G. F.; MARCHETTI SPACCAMELA, A.; Nanni, Umberto
Local search, reducibility and approximability of NP optimization problems
1995 Ausiello, Giorgio; M., Protasi
Approximate solution of NP optimization problems
1995 Ausiello, Giorgio; P. L., Crescenzi; M., Protasi
On-line algorithms for satisfiability problems with uncertainty
1997 Ausiello, Giorgio; R., Giaccio
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms
1998 Ausiello, Giorgio; G. F., Italiano; Nanni, Umberto
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.
Expressiveness and complexity of formal systems
1999 Ausiello, Giorgio; L., Cabibbo; In, ; A. CARSETTI E., D.; Kluwer,
On salesmen, repairmen, spiders and other traveling agents
2000 Ausiello, Giorgio; Leonardi, Stefano; MARCHETTI SPACCAMELA, A.
Algorithms for the on-line travelling salesman
2001 Ausiello, Giorgio; E., Feuerstein; Leonardi, Stefano; L., Stougie; M., Talamo
Directed hypergraphs: problems, algorithmic results, and a novel decremental approach
2001 Ausiello, Giorgio; Franciosa, Paolo Giulio; Daniele, Frigioni
Linguaggi, Modelli, Complessità
2003 Ausiello, Giorgio; D'Amore, Fabrizio; Gambosi, G.
Completeness in Differential Approximation Classes
2003 Ausiello, Giorgio; C., Bazgan; M., Demange; V., Paschos
On explorers, chasers, and cameramen
2004 Ausiello, Giorgio; Bonifaci, Vincenzo; Laura, Luigi
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Toward a unified approach for the classification of NP-complete optimization problems | 1980 | Ausiello, Giorgio; MARCHETTI SPACCAMELA, Alberto; M., Protasi | |
| Chordality properties on graphs and minimal conceptual connections in semantic data models | 1986 | Ausiello, Giorgio; D'Atri, Alessandro; Moscarini, Marina | |
| Dynamic maintenance of paths and path expressions on graphs | 1989 | Ausiello, G.; Spaccamela, A. Marchetti; Nanni, U. | |
| Limiting polynomial approximation of complexity classes | 1990 | Ausiello, Giorgio; M., Protasi | |
| Incremental algorithms for minimal length paths | 1990 | Ausiello, Giorgio; Italiano, Giuseppe F.; Spaccamela, Alberto Marchetti; Nanni, Umberto | |
| On line algorithms for polynomially solvable satisfiability problems | 1991 | Ausiello, Giorgio; G. F., Italiano | |
| Incremental algorithms for minimal length paths | 1991 | Ausiello, Giorgio; Italiano, GIUSEPPE FRANCESCO; MARCHETTI SPACCAMELA, Alberto; Nanni, Umberto | |
| On line computation of minimal and maximal length paths | 1992 | Ausiello, Giorgio; Italiano, G. F.; MARCHETTI SPACCAMELA, A.; Nanni, Umberto | |
| Local search, reducibility and approximability of NP optimization problems | 1995 | Ausiello, Giorgio; M., Protasi | |
| Approximate solution of NP optimization problems | 1995 | Ausiello, Giorgio; P. L., Crescenzi; M., Protasi | |
| On-line algorithms for satisfiability problems with uncertainty | 1997 | Ausiello, Giorgio; R., Giaccio | |
| Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms | 1998 | Ausiello, Giorgio; G. F., Italiano; Nanni, Umberto | |
| 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. | |
| Expressiveness and complexity of formal systems | 1999 | Ausiello, Giorgio; L., Cabibbo; In, ; A. CARSETTI E., D.; Kluwer, | |
| On salesmen, repairmen, spiders and other traveling agents | 2000 | Ausiello, Giorgio; Leonardi, Stefano; MARCHETTI SPACCAMELA, A. | |
| Algorithms for the on-line travelling salesman | 2001 | Ausiello, Giorgio; E., Feuerstein; Leonardi, Stefano; L., Stougie; M., Talamo | |
| Directed hypergraphs: problems, algorithmic results, and a novel decremental approach | 2001 | Ausiello, Giorgio; Franciosa, Paolo Giulio; Daniele, Frigioni | |
| Linguaggi, Modelli, Complessità | 2003 | Ausiello, Giorgio; D'Amore, Fabrizio; Gambosi, G. | |
| Completeness in Differential Approximation Classes | 2003 | Ausiello, Giorgio; C., Bazgan; M., Demange; V., Paschos | |
| On explorers, chasers, and cameramen | 2004 | Ausiello, Giorgio; Bonifaci, Vincenzo; Laura, Luigi |
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