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 | 2464 | 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 | 297 | 1980 |

Algorithms for the On-Line Travelling Salesman^{ 1 }G Ausiello, E Feuerstein, S Leonardi, L Stougie, M Talamo Algorithmica 29, 560-581, 2001 | 244 | 2001 |

Incremental algorithms for minimal length paths G Ausiello, GF Italiano, AM Spaccamela, U Nanni Journal of Algorithms 12 (4), 615-638, 1991 | 231 | 1991 |

Approximate solution of NP optimization problems G Ausiello, P Crescenzi, M Protasi Theoretical Computer Science 150 (1), 1-55, 1995 | 161 | 1995 |

Minimal representation of directed hypergraphs G Ausiello, A D’Atri, D Sacca SIAM Journal on Computing 15 (2), 418-431, 1986 | 151 | 1986 |

Graph algorithms for functional dependency manipulation G Ausiello, A D'Atri, D Sacca Journal of the ACM (JACM) 30 (4), 752-766, 1983 | 145 | 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 | 123 | 2001 |

Optimal traversal of directed hypergraphs G Ausielloyz, R Giaccioy, GF Italianox, U Nanniyz ICSI, Berkeley, CA, 1992 | 79 | 1992 |

Inclusion and equivalence between relational database schemata P Atzeni, G Ausiello, C Batini, M Moscarini Theor. Comput. Sci. 19 (3), 267-285, 1982 | 79 | 1982 |

Complexity and approximation in reoptimization G Ausiello, V Bonifaci, B Escoffier Computability in Context: Computation and Logic in the Real World, 101-129, 2011 | 73 | 2011 |

Algorithms for the on-line quota traveling salesman problem G Ausiello, M Demange, L Laura, V Paschos Computing and Combinatorics: 10th Annual International Conference, COCOON …, 2004 | 73 | 2004 |

On salesmen, repairmen, spiders, and other traveling agents G Ausiello, S Leonardi, A Marchetti-Spaccamela CIAC, 1-16, 2000 | 73 | 2000 |

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 | 70 | 1985 |

Reoptimization of minimum and maximum traveling salesman’s tours G Ausiello, B Escoffier, J Monnot, VT Paschos Algorithm Theory–SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory …, 2006 | 69 | 2006 |

Local search, reducibility and approximability of NP-optimization problems G Ausiello, M Protasi Information Processing Letters 54 (2), 73-79, 1995 | 68 | 1995 |

On-line algorithms for polynomially solvable satisfiability problems G Ausiello, GF Italiano The Journal of logic programming 10 (1), 69-90, 1991 | 68 | 1991 |

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 | 64 | 1980 |

The online prize-collecting traveling salesman problem G Ausiello, V Bonifaci, L Laura Information Processing Letters 107 (6), 199-204, 2008 | 60 | 2008 |

Dynamic maintenance of directed hypergraphs G Ausiello, U Nanni, GF Italiano Theoretical Computer Science 72 (2-3), 97-117, 1990 | 59 | 1990 |