Giorgio Ausiello
Giorgio Ausiello
Dipartimento di Ingegneria Informatica Automatica e Gestionale, Sapienza University of Rome
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Complexity and approximation: Combinatorial optimization problems and their approximability properties
G Ausiello, P Crescenzi, G Gambosi, V Kann, A Marchetti-Spaccamela, ...
Springer Science & Business Media, 2012
Structure preserving reductions among convex optimization problems
G Ausiello, A D'Atri, M Protasi
Journal of Computer and System Sciences 21 (1), 136-153, 1980
Algorithms for the On-Line Travelling Salesman 1
G Ausiello, E Feuerstein, S Leonardi, L Stougie, M Talamo
Algorithmica 29, 560-581, 2001
Incremental algorithms for minimal length paths
G Ausiello, GF Italiano, AM Spaccamela, U Nanni
Journal of Algorithms 12 (4), 615-638, 1991
Approximate solution of NP optimization problems
G Ausiello, P Crescenzi, M Protasi
Theoretical Computer Science 150 (1), 1-55, 1995
Minimal representation of directed hypergraphs
G Ausiello, A D’Atri, D Sacca
SIAM Journal on Computing 15 (2), 418-431, 1986
Graph algorithms for functional dependency manipulation
G Ausiello, A D'Atri, D Sacca
Journal of the ACM (JACM) 30 (4), 752-766, 1983
Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach
A Restivo, SR Della Rocca, L Roversi, G Ausiello, PG Franciosa, ...
Theoretical Computer Science: 7th Italian Conference, ICTCS 2001 Torino …, 2001
Directed hypergraphs: Introduction and fundamental algorithms—a survey
G Ausiello, L Laura
Theoretical Computer Science 658, 293-306, 2017
Optimal traversal of directed hypergraphs
G Ausielloyz, R Giaccioy, GF Italianox, U Nanniyz
ICSI, Berkeley, CA, 1992
Inclusion and equivalence between relational database schemata
P Atzeni, G Ausiello, C Batini, M Moscarini
Theor. Comput. Sci. 19 (3), 267-285, 1982
On salesmen, repairmen, spiders, and other traveling agents
G Ausiello, S Leonardi, A Marchetti-Spaccamela
Italian Conference on Algorithms and Complexity, 1-16, 2000
Complexity and approximation in reoptimization
G Ausiello, V Bonifaci, B Escoffier
Computability in Context: Computation and Logic in the Real World, 101-129, 2011
Algorithms for the on-line quota traveling salesman problem
G Ausiello, M Demange, L Laura, V Paschos
International Computing and Combinatorics Conference, 290-299, 2004
Reoptimization of minimum and maximum traveling salesman’s tours
G Ausiello, B Escoffier, J Monnot, VT Paschos
Scandinavian Workshop on Algorithm Theory, 196-207, 2006
Local search, reducibility and approximability of NP-optimization problems
G Ausiello, M Protasi
Information Processing Letters 54 (2), 73-79, 1995
Chordality properties on graphs and minimal conceptual connections in semantic data models
G Ausiello, A D'Atri, M Moscarini
Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of …, 1985
Toward a unified approach for the classification of NP-complete optimization problems
G Ausiello, A Marchetti-Spaccamela, M Protasi
Theoretical Computer Science 12 (1), 83-96, 1980
The online prize-collecting traveling salesman problem
G Ausiello, V Bonifaci, L Laura
Information Processing Letters 107 (6), 199-204, 2008
On-line algorithms for polynomially solvable satisfiability problems
G Ausiello, GF Italiano
The Journal of logic programming 10 (1), 69-90, 1991
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20