| 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 | 2301 | 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 | 271 | 1980 |
| Incremental algorithms for minimal length paths G Ausiello, GF Italiano, AM Spaccamela, U Nanni Journal of Algorithms 12 (4), 615-638, 1991 | 223 | 1991 |
| Algorithms for the on-line travelling salesman 1 G Ausiello, E Feuerstein, S Leonardi, L Stougie, M Talamo Algorithmica 29 (4), 560-581, 2001 | 219 | 2001 |
| Approximate solution of NP optimization problems G Ausiello, P Crescenzi, M Protasi Theoretical Computer Science 150 (1), 1-55, 1995 | 153 | 1995 |
| Minimal representation of directed hypergraphs G Ausiello, A D’Atri, D Sacca SIAM Journal on Computing 15 (2), 418-431, 1986 | 144 | 1986 |
| Graph algorithms for functional dependency manipulation G Ausiello, A D'Atri, D Sacca Journal of the ACM (JACM) 30 (4), 752-766, 1983 | 133 | 1983 |
| Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach G Ausiello, PG Franciosa, D Frigioni Italian conference on theoretical computer science, 312-328, 2001 | 115 | 2001 |
| Dynamic modeling of a disturbance in a multi-agent system for traffic regulation F Balbo, S Pinson Decision Support Systems 41 (1), 131-146, 2005 | 85 | 2005 |
| Inclusion and equivalence between relational database schemata P Atzeni, G Ausiello, C Batini, M Moscarini Theoretical Computer Science 19 (3), 267-285, 1982 | 71 | 1982 |
| Optimal traversal of directed hypergraphs G Ausielloyz, R Giaccioy, GF Italianox, U Nanniyz ICSI, Berkeley, CA, 1992 | 68 | 1992 |
| Complexity and approximation in reoptimization G Ausiello, V Bonifaci, B Escoffier Computability in Context: Computation and Logic in the Real World, 101-129, 2011 | 67 | 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 | 67 | 2004 |
| Chordality properties on graphs and minimal conceptual connections in semantic data models G Ausiello, A D'Atri, M Moscarini Journal of Computer and System Sciences 33 (2), 179-202, 1986 | 67 | 1986 |
| 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 | 66 | 2006 |
| Local search, reducibility and approximability of NP-optimization problems G Ausiello, M Protasi Information Processing Letters 54 (2), 73-79, 1995 | 65 | 1995 |
| On salesmen, repairmen, spiders, and other traveling agents G Ausiello, S Leonardi, A Marchetti-Spaccamela Italian Conference on Algorithms and Complexity, 1-16, 2000 | 63 | 2000 |
| 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 | 62 | 1980 |
| On-line algorithms for polynomially solvable satisfiability problems G Ausiello, GF Italiano The Journal of logic programming 10 (1), 69-90, 1991 | 57 | 1991 |
| Dynamic maintenance of directed hypergraphs G Ausiello, U Nanni, GF Italiano Theoretical Computer Science 72 (2-3), 97-117, 1990 | 56 | 1990 |
