On Bounds on the Number of Steps to Compute Functions - Giorgio Ausiello (STOC, 1970)

Abstract Computational Complexity and Cycling Computations. - Giorgio Ausiello (J. Comput. Syst. Sci., 1971)

Relations between Semantics and Complexity of Recursive Programs. - Giorgio Ausiello (ICALP, 1974)

On the description of time varying systems in lambda - calculus. - Giorgio Ausiello (Lambda-Calculus and Computer Science Theory, 1975)

On the Comparison of Notions of Approximation. - Giorgio Ausiello; Marco Protasi (MFCS, 1975)

On the Complexity of Decision Problems for Classes of Simple Programs on Strings. - Giorgio Ausiello; Marina Moscarini (GI Jahrestagung, 1976)

On the Structure of Combinatorial Problems and Structure Preserving Reductions. - Giorgio Ausiello; Alessandro D'Atri; Marco Protasi (ICALP, 1977)

On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems. - Giorgio Ausiello (MFCS, 1977)

Classes of Structurally Isomorphic {NP}-Optimization Problems. - Giorgio Ausiello; Alessandro D'Atri; Marco Gaudiano; Marco Protasi (MFCS, 1977)

Design of algebraic data structures with the approach of abstract data types. - Giorgio Ausiello; Giovanni Mascari (EUROSAM, 1979)

Polynomials - The Specification, Analysis and Development of an Abstract Data Type. - Walter Dosch; Martin Wirsing; Giorgio Ausiello; Gianfranco Mascari (GI Jahrestagung, 1980)

On the Equivalence among Data Base Schemata. - Giorgio Ausiello; Carlo Batini; Marina Moscarini (ICOD, 1980)

Conceptual Relations between Databases Transformed under Join and Projection. - Giorgio Ausiello; Carlo Batini; Marina Moscarini (MFCS, 1980)

Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes. - Giorgio Ausiello; Alessandro D'Atri; Domenico Saccà (WG, 1980)

Structure Preserving Reductions among Convex Optimization Problems. - Giorgio Ausiello; Alessandro D'Atri; Marco Protasi (J. Comput. Syst. Sci., 1980)

Toward a Unified Approach for the Classification of NP-Complete Optimization Problems. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Marco Protasi (Theor. Comput. Sci., 1980)

Full Approximatibility of a Class of Problems over Power Sets. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Marco Protasi (CAAP, 1981)

Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Marco Protasi (FCT, 1981)

Lattice theoretic ordering properties for NP-complete optimization problems. - Giorgio Ausiello; Alessandro D'Atri; Marco Protasi (Fundam. Informaticae, 1981)

Minimal Coverings of Acyclic Database Schemata. - Giorgio Ausiello; Alessandro D'Atri; Marina Moscarini (Advances in Data Base Theory, 1982)

Inclusion and Equivalence between Relational Database Schemata. - Paolo Atzeni; Giorgio Ausiello; Carlo Batini; Marina Moscarini (Theor. Comput. Sci., 1982)

Probabilistic Models for Database Schemes and Random Hypergraphs. - Giorgio Ausiello; Marco Protasi; Maurizio Talamo (WG, 1983)

Graph Algorithms for Functional Dependency Manipulation - Giorgio Ausiello; Alessandro D'Atri; Domenico Saccà (J. ACM, 1983)

On the Existence of Acyclic Views in a Database Scheme. - Giorgio Ausiello; Alessandro D'Atri; Marina Moscarini (Theor. Comput. Sci., 1985)

Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. - Giorgio Ausiello; Alessandro D'Atri; Marina Moscarini (J. Comput. Syst. Sci., 1986)

Minimal Representation of Directed Hypergraphs. - Giorgio Ausiello; Alessandro D'Atri; Domenico Saccà (SIAM J. Comput., 1986)

Directed Hypergraphs: Data Structures and Applications. - Giorgio Ausiello (CAAP, 1988)

Dynamic Maintenance of Paths and Path Expressions on Graphs. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Umberto Nanni (ISSAC, 1988)

Special Issue: First International Conference on Database Theory, Rome, September 1986, Forword. - Giorgio Ausiello (Theor. Comput. Sci., 1988)

Limiting Polynomial Approximation of Complexity Classes. - Giorgio Ausiello; Marco Protasi (Int. J. Found. Comput. Sci., 1990)

Dynamic Maintenance of Directed Hypergraphs. - Giorgio Ausiello; Umberto Nanni (Theor. Comput. Sci., 1990)

Incremental Algorithms for Minimal Length Paths. - Giorgio Ausiello; Giuseppe F. Italiano; Alberto Marchetti-Spaccamela; Umberto Nanni (J. Algorithms, 1991)

On-Line Algorithms for Polynomially Solvable Satisfiability Problems. - Giorgio Ausiello; Giuseppe F. Italiano (J. Log. Program., 1991)

On-Line Computation of Minimal and Maximal Length Paths. - Giorgio Ausiello; Giuseppe F. Italiano; Alberto Marchetti-Spaccamela; Umberto Nanni (Theor. Comput. Sci., 1992)

Serving Requests with On-line Routing. - Giorgio Ausiello; Esteban Feuerstein; Stefano Leonardi 001; Leen Stougie; Maurizio Talamo (SWAT, 1994)

Competitive Algorithms for the On-line Traveling Salesman. - Giorgio Ausiello; Esteban Feuerstein; Stefano Leonardi 001; Leen Stougie; Maurizio Talamo (WADS, 1995)

Local Search, Reducibility and Approximability of NP-Optimization Problems. - Giorgio Ausiello; Marco Protasi (Inf. Process. Lett., 1995)

Approximate Solution of NP Optimization Problems. - Giorgio Ausiello; Pierluigi Crescenzi; Marco Protasi (Theor. Comput. Sci., 1995)

Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. - Giorgio Ausiello; Paolo Giulio Franciosa; Daniele Frigioni; Roberto Giaccio (ISAAC, 1997)

On-Line Algorithms for Satisfiability Problems with Uncertainty. - Giorgio Ausiello; Roberto Giaccio (Theor. Comput. Sci., 1997)

Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. - Giorgio Ausiello; Giuseppe F. Italiano; Umberto Nanni (MFCS, 1998)

Complexity and approximation: combinatorial optimization problems and their approximability properties. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Pierluigi Crescenzi; Giorgio Gambosi; Marco Protasi; Viggo Kann (Springer, 1999)

Exploiting Pompei Cultural Heritage: The Plinius Project. - Angela Antonicelli; Giovanni Sciscio; Renato Rosicarelli; Giorgio Ausiello; Tiziana Catarci; Massimo Ferrarini (Eurographics (Short Presentations), 1999)

On Salesmen, Repairmen, Spiders, and Other Traveling Agents. - Giorgio Ausiello; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (CIAC, 2000)

Algorithm Design Challenges. - Giorgio Ausiello (IFIP TCS, 2000)

Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto Plinius. - Angela Antonicelli; Giovanni Sciscio; Renato Rosicarelli; Giorgio Ausiello; Tiziana Catarci; Massimo Ferrarini (SEBD, 2000)

Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. - Giorgio Ausiello; Paolo Giulio Franciosa; Daniele Frigioni (ICTCS, 2001)

Algorithms for the On-Line Travelling Salesman. - Giorgio Ausiello; Esteban Feuerstein; Stefano Leonardi 001; Leen Stougie; Maurizio Talamo (Algorithmica, 2001)

25 Years. - Giorgio Ausiello; Donald Sannella; Michael W. Mislove (Theor. Comput. Sci., 2001)

Selected Papers in honour of Maurice Nivat - Editorial. - Giorgio Ausiello (Theor. Comput. Sci., 2002)

Algorithms for the On-Line Quota Traveling Salesman Problem. - Giorgio Ausiello; Marc Demange; Luigi Laura; Vangelis Th. Paschos (Inf. Process. Lett., 2004)

On the Power of Lookahead in On-Line Vehicle Routing Problems. - Luca Allulli; Giorgio Ausiello; Luigi Laura (COCOON, 2005)

Completeness in differential approximation classes. - Giorgio Ausiello; Cristina Bazgan; Marc Demange; Vangelis Th. Paschos (Int. J. Found. Comput. Sci., 2005)

Partially dynamic maintenance of minimum weight hyperpaths. - Giorgio Ausiello; Paolo Giulio Franciosa; Daniele Frigioni (J. Discrete Algorithms, 2005)

Greedy algorithms for on-line set-covering and related problems. - Giorgio Ausiello; Aristotelis Giannakos; Vangelis Th. Paschos (CATS, 2006)

On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance. - Giorgio Ausiello; Luca Allulli; Vincenzo Bonifaci; Luigi Laura (TAMC, 2006)

Reductions, completeness and the hardness of approximability. - Giorgio Ausiello; Vangelis Th. Paschos (Eur. J. Oper. Res., 2006)

Small Stretch Spanners on Dynamic Graphs. - Giorgio Ausiello; Paolo Giulio Franciosa; Giuseppe F. Italiano (J. Graph Algorithms Appl., 2006)

Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. - Giorgio Ausiello; Camil Demetrescu; Paolo Giulio Franciosa; Giuseppe F. Italiano; Andrea Ribichini (ESA, 2007)

Clairvoyance and Laziness for on Line Travelling Agents. - Giorgio Ausiello (ICTCS, 2007)

Reductions That Preserve Approximability. - Giorgio Ausiello; Vangelis Th. Paschos (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Differential Ratio Approximation. - Giorgio Ausiello; Vangelis Th. Paschos (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Prize-Collecting Traveling Salesman and Related Problems. - Alberto Marchetti-Spaccamela; Vincenzo Bonifaci; Stefano Leonardi 001; Giorgio Ausiello (Handbook of Approximation Algorithms and Metaheuristics, 2007)

The online Prize-Collecting Traveling Salesman Problem. - Giorgio Ausiello; Vincenzo Bonifaci; Luigi Laura (Inf. Process. Lett., 2008)

The on-line asymmetric traveling salesman problem. - Giorgio Ausiello; Vincenzo Bonifaci; Luigi Laura (J. Discrete Algorithms, 2008)

On the power of lookahead in on-line server routing problems. - Luca Allulli; Giorgio Ausiello; Vincenzo Bonifaci; Luigi Laura (Theor. Comput. Sci., 2008)

Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components. - Giorgio Ausiello; Donatella Firmani; Luigi Laura (ICTCS, 2009)

Graph Spanners in the Streaming Model: An Experimental Study. - Giorgio Ausiello; Camil Demetrescu; Paolo Giulio Franciosa; Giuseppe F. Italiano; Andrea Ribichini (Algorithmica, 2009)

Greedy Algorithms For On-Line Set-Covering. - Giorgio Ausiello; Nicolas Bourgeois; Telis Giannakos; Vangelis Th. Paschos (Algorithmic Oper. Res., 2009)

Reoptimization of minimum and maximum traveling salesman's tours. - Giorgio Ausiello; Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos (J. Discrete Algorithms, 2009)

Small stretch (alpha, beta)-spanners in the streaming model. - Giorgio Ausiello; Paolo Giulio Franciosa; Giuseppe F. Italiano (Theor. Comput. Sci., 2009)

Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. - Giorgio Ausiello; Andrea Ribichini; Paolo Giulio Franciosa; Giuseppe F. Italiano (Discret. Math. Algorithms Appl., 2010)

Real-time anomalies detection and analysis of network structure, with application to the Autonomous System network. - Giorgio Ausiello; Donatella Firmani; Luigi Laura (IWCMC, 2011)

Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. - Giorgio Ausiello; Giuseppe F. Italiano; Luigi Laura; Umberto Nanni; Fabiano Sarracco (ISCO, 2012)

Real-time analysis of critical nodes in network cores. - Giorgio Ausiello; Donatella Firmani; Luigi Laura (IWCMC, 2012)

k-Calling context profiling. - Giorgio Ausiello; Camil Demetrescu; Irene Finocchi; Donatella Firmani (OOPSLA, 2012)

Online maximum k-coverage. - Giorgio Ausiello; Nicolas Boria; Aristotelis Giannakos; Giorgio Lucarelli; Vangelis Th. Paschos (Discret. Appl. Math., 2012)

Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. - Giorgio Ausiello; Francesco Cristiano; Luigi Laura (Electron. Colloquium Comput. Complex., 2012)

Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components. - Giorgio Ausiello; Donatella Firmani; Luigi Laura (Networks, 2012)

Preface. - Giorgio Ausiello; Hendrik Jan Hoogeboom; Juhani Karhumäki; Ion Petre; Arto Salomaa (Theor. Comput. Sci., 2012)

Algorithms, An Historical Perspective. - Giorgio Ausiello (The Power of Algorithms, 2013)

The (betweenness) centrality of critical nodes and network cores. - Giorgio Ausiello; Donatella Firmani; Luigi Laura (IWCMC, 2013)

On Robust Graph Spanners - Giorgio Ausiello; Paolo Giulio Franciosa; Giuseppe F. Italiano; Andrea Ribichini (CoRR, 2013)

TCS in the 21st century. - Giorgio Ausiello; Lila Kari; Grzegorz Rozenberg; Donald Sannella (Theor. Comput. Sci., 2015)

On Resilient Graph Spanners. - Giorgio Ausiello; Paolo Giulio Franciosa; Giuseppe F. Italiano; Andrea Ribichini (Algorithmica, 2016)

Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life. - Giorgio Ausiello; Rossella Petreschi (Bull. EATCS, 2016)

Max flow vitality in general and planar graphs. - Giorgio Ausiello; Paolo Giulio Franciosa; Isabella Lari; Andrea Ribichini (CoRR, 2017)

Directed hypergraphs: Introduction and fundamental algorithms - A survey. - Giorgio Ausiello; Luigi Laura (Theor. Comput. Sci., 2017)

The Making of a New Science - A Personal Journey Through the Early Years of Theoretical Computer Science - Giorgio Ausiello (Springer, 2018)

Prize Collecting Traveling Salesman and Related Problems. - Giorgio Ausiello; Vincenzo Bonifaci; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Reductions That Preserve Approximability. - Giorgio Ausiello; Vangelis Th. Paschos (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Differential Ratio Approximation. - Giorgio Ausiello; Vangelis Th. Paschos (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

The Making of a New Science A Personal Journey Through the Early Years of Theoretical Computer Science. - Giorgio Ausiello (Bull. EATCS, 2019)

Max flow vitality in general and st-planar graphs. - Giorgio Ausiello; Paolo Giulio Franciosa; Isabella Lari; Andrea Ribichini (Networks, 2019)

Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. - Giorgio Ausiello; Francesco Cristiano; Paolo Fantozzi; Luigi Laura (ICTCS, 2020)

Max-flow vitality in undirected unweighted planar graphs. - Giorgio Ausiello; Paolo Giulio Franciosa; Isabella Lari; Andrea Ribichini (CoRR, 2020)

Preface. - Giorgio Ausiello; Lila Kari; Grzegorz Rozenberg; Donald Sannella; Paul G. Spirakis; Pierre-Louis Curien (Theor. Comput. Sci., 2020)

Panel on "Past and Future of Computer Science Theory" (Discussion Paper). - Ronald Fagin; Georg Gottlob; Christos H. Papadimitriou; Moshe Y. Vardi; Giorgio Ausiello; Maurizio Lenzerini; Domenico Saccà; Luigi Palopoli 001; Francesco Scarcello (SEBD, 2021)

Theoretical Computer Science in Italy: The Early Years. - Giorgio Ausiello; Giorgio Gambosi (IEEE Ann. Hist. Comput., 2021)

A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs. - Giorgio Ausiello; Lorenzo Balzotti; Paolo Giulio Franciosa; Isabella Lari; Andrea Ribichini (CoRR, 2022)

EATCS Golden Jubilee: How EATCS was born 50 years ago and why it is still alive and well. - Giorgio Ausiello (Bull. EATCS, 2022)