Giorgio Ausiello

ORCID

Publication Activity (10 Years)

Years Active: 1970-2022
Publications (10 Years): 15

Top Venues

Publications

Giorgio Ausiello
EATCS Golden Jubilee: How EATCS was born 50 years ago and why it is still alive and well. Bull. EATCS 137 (2022)
Giorgio Ausiello, Lorenzo Balzotti, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs. CoRR (2022)
Ronald Fagin, Georg Gottlob, Christos H. Papadimitriou, Moshe Y. Vardi, Giorgio Ausiello, Maurizio Lenzerini, Domenico Saccà, Luigi Palopoli, Francesco Scarcello
Panel on "Past and Future of Computer Science Theory" (Discussion Paper). SEBD (2021)
Giorgio Ausiello, Giorgio Gambosi
Theoretical Computer Science in Italy: The Early Years. IEEE Ann. Hist. Comput. 43 (3) (2021)
Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini
Max-flow vitality in undirected unweighted planar graphs. CoRR (2020)
Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien
Preface. Theor. Comput. Sci. 807 (2020)
Giorgio Ausiello, Francesco Cristiano, Paolo Fantozzi, Luigi Laura
Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. ICTCS (2020)
Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini
Max flow vitality in general and st-planar graphs. Networks 74 (1) (2019)
Giorgio Ausiello
The Making of a New Science A Personal Journey Through the Early Years of Theoretical Computer Science. Bull. EATCS 127 (2019)
Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien
Preface. Theor. Comput. Sci. 777 (2019)
Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini
Max flow vitality in general and planar graphs. CoRR (2017)
Giorgio Ausiello, Luigi Laura
Directed hypergraphs: Introduction and fundamental algorithms - A survey. Theor. Comput. Sci. 658 (2017)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
On Resilient Graph Spanners. Algorithmica 74 (4) (2016)
Giorgio Ausiello, Rossella Petreschi
Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life. Bull. EATCS 118 (2016)
Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella
TCS in the 21st century. Theor. Comput. Sci. 591 (2015)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
On Robust Graph Spanners CoRR (2013)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini
On Resilient Graph Spanners. ESA (2013)
Giorgio Ausiello, Donatella Firmani, Luigi Laura
The (betweenness) centrality of critical nodes and network cores. IWCMC (2013)
Giorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani
k-Calling context profiling. OOPSLA (2012)
Giorgio Ausiello, Donatella Firmani, Luigi Laura
Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components. Networks 59 (3) (2012)
Giorgio Ausiello, Donatella Firmani, Luigi Laura
Real-Time Monitoring of Undirected Networks: Articulation Points, Bridges, and Connected and Biconnected Components CoRR (2012)
Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO (2012)
Giorgio Ausiello, Francesco Cristiano, Luigi Laura
Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. Electron. Colloquium Comput. Complex. 19 (2012)
Giorgio Ausiello, Donatella Firmani, Luigi Laura
Real-time analysis of critical nodes in network cores. IWCMC (2012)
Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa
Preface. Theor. Comput. Sci. 429 (2012)
Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos
Online maximum k-coverage. Discret. Appl. Math. 160 (13-14) (2012)
Giorgio Ausiello, Donatella Firmani, Luigi Laura
Real-time anomalies detection and analysis of network structure, with application to the Autonomous System network. IWCMC (2011)
Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos
Online Maximum k-Coverage. FCT (2011)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. COCOON (2010)
Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. Discret. Math. Algorithms Appl. 2 (4) (2010)
Giorgio Ausiello, Donatella Firmani, Luigi Laura
Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components. ICTCS (2009)
Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos
Greedy Algorithms For On-Line Set-Covering. Algorithmic Oper. Res. 4 (1) (2009)
Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55 (2) (2009)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
Small stretch (alpha, beta)-spanners in the streaming model. Theor. Comput. Sci. 410 (36) (2009)
Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms 7 (4) (2009)
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
The online Prize-Collecting Traveling Salesman Problem. Inf. Process. Lett. 107 (6) (2008)
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
The on-line asymmetric traveling salesman problem. J. Discrete Algorithms 6 (2) (2008)
Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
On the power of lookahead in on-line server routing problems. Theor. Comput. Sci. 408 (2-3) (2008)
Giorgio Ausiello
Clairvoyance and Laziness for on Line Travelling Agents. ICTCS (2007)
Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. ESA (2007)
Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci, Luigi Laura
On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance. TAMC (2006)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
Small Stretch Spanners on Dynamic Graphs. J. Graph Algorithms Appl. 10 (2) (2006)
Giorgio Ausiello, Aristotelis Giannakos, Vangelis Th. Paschos
Greedy algorithms for on-line set-covering and related problems. CATS (2006)
Giorgio Ausiello, Vangelis Th. Paschos
Reductions, completeness and the hardness of approximability. Eur. J. Oper. Res. 172 (3) (2006)
Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT (2006)
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni
Partially dynamic maintenance of minimum weight hyperpaths. J. Discrete Algorithms 3 (1) (2005)
Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
Completeness in differential approximation classes. Int. J. Found. Comput. Sci. 16 (6) (2005)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
Small Stretch Spanners on Dynamic Graphs. ESA (2005)
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
The On-line Asymmetric Traveling Salesman Problem. WADS (2005)
Luca Allulli, Giorgio Ausiello, Luigi Laura
On the Power of Lookahead in On-Line Vehicle Routing Problems. COCOON (2005)
Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
Algorithms for the On-Line Quota Traveling Salesman Problem. Inf. Process. Lett. 92 (2) (2004)
Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
Algorithms for the On-Line Quota Traveling Salesman Problem. COCOON (2004)
Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
Completeness in Differential Approximation Classes. MFCS (2003)
Giorgio Ausiello
Selected Papers in honour of Maurice Nivat - Editorial. Theor. Comput. Sci. 281 (1-2) (2002)
Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
Algorithms for the On-Line Travelling Salesman. Algorithmica 29 (4) (2001)
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ICTCS (2001)
Giorgio Ausiello, Donald Sannella, Michael W. Mislove
25 Years. Theor. Comput. Sci. 250 (1-2) (2001)
Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela
On Salesmen, Repairmen, Spiders, and Other Traveling Agents. CIAC (2000)
Angela Antonicelli, Giovanni Sciscio, Renato Rosicarelli, Giorgio Ausiello, Tiziana Catarci, Massimo Ferrarini
Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto Plinius. SEBD (2000)
Giorgio Ausiello
Algorithm Design Challenges. IFIP TCS (2000)
Angela Antonicelli, Giovanni Sciscio, Renato Rosicarelli, Giorgio Ausiello, Tiziana Catarci, Massimo Ferrarini
Exploiting Pompei Cultural Heritage: The Plinius Project. Eurographics (Short Presentations) (1999)
Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. MFCS (1998)
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. ISAAC (1997)
Giorgio Ausiello, Roberto Giaccio
On-Line Algorithms for Satisfiability Problems with Uncertainty. Theor. Comput. Sci. 171 (1-2) (1997)
Giorgio Ausiello, Marco Protasi
Local Search, Reducibility and Approximability of NP-Optimization Problems. Inf. Process. Lett. 54 (2) (1995)
Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi
Approximate Solution of NP Optimization Problems. Theor. Comput. Sci. 150 (1) (1995)
Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
Competitive Algorithms for the On-line Traveling Salesman. WADS (1995)
Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
Serving Requests with On-line Routing. SWAT (1994)
Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
On-Line Computation of Minimal and Maximal Length Paths. Theor. Comput. Sci. 95 (2) (1992)
Giorgio Ausiello, Giuseppe F. Italiano
On-Line Algorithms for Polynomially Solvable Satisfiability Problems. J. Log. Program. 10 (1) (1991)
Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
Incremental Algorithms for Minimal Length Paths. J. Algorithms 12 (4) (1991)
Giorgio Ausiello, Umberto Nanni
Dynamic Maintenance of Directed Hypergraphs. Theor. Comput. Sci. 72 (2&3) (1990)
Giorgio Ausiello, Marco Protasi
Limiting Polynomial Approximation of Complexity Classes. Int. J. Found. Comput. Sci. 1 (2) (1990)
Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
Incremental Algorithms for Minimal Length Paths. SODA (1990)
Giorgio Ausiello
Special Issue: First International Conference on Database Theory, Rome, September 1986, Forword. Theor. Comput. Sci. 62 (1-2) (1988)
Giorgio Ausiello
Directed Hypergraphs: Data Structures and Applications. CAAP (1988)
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni
Dynamic Maintenance of Paths and Path Expressions on Graphs. ISSAC (1988)
Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà
Minimal Representation of Directed Hypergraphs. SIAM J. Comput. 15 (2) (1986)
Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. J. Comput. Syst. Sci. 33 (2) (1986)
Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. PODS (1985)
Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
On the Existence of Acyclic Views in a Database Scheme. Theor. Comput. Sci. 35 (1985)
Giorgio Ausiello, Marco Protasi, Maurizio Talamo
Probabilistic Models for Database Schemes and Random Hypergraphs. WG (1983)
Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà
Graph Algorithms for Functional Dependency Manipulation J. ACM 30 (4) (1983)
Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
Minimal Coverings of Acyclic Database Schemata. Advances in Data Base Theory (1982)
Paolo Atzeni, Giorgio Ausiello, Carlo Batini, Marina Moscarini
Inclusion and Equivalence between Relational Database Schemata. Theor. Comput. Sci. 19 (1982)
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. FCT (1981)
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
Lattice theoretic ordering properties for NP-complete optimization problems. Fundam. Informaticae 4 (1) (1981)
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
Full Approximatibility of a Class of Problems over Power Sets. CAAP (1981)
Giorgio Ausiello, Carlo Batini, Marina Moscarini
Conceptual Relations between Databases Transformed under Join and Projection. MFCS (1980)
Giorgio Ausiello, Alessandro D'Atri
Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes. WG (1980)
Walter Dosch, Martin Wirsing, Giorgio Ausiello, Gianfranco Mascari
Polynomials - The Specification, Analysis and Development of an Abstract Data Type. GI Jahrestagung (1980)
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
Toward a Unified Approach for the Classification of NP-Complete Optimization Problems. Theor. Comput. Sci. 12 (1980)
Giorgio Ausiello, Carlo Batini, Marina Moscarini
On the Equivalence among Data Base Schemata. ICOD (1980)
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
Structure Preserving Reductions among Convex Optimization Problems. J. Comput. Syst. Sci. 21 (1) (1980)
Giorgio Ausiello, Giovanni Mascari
Design of algebraic data structures with the approach of abstract data types. EUROSAM (1979)
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
On the Structure of Combinatorial Problems and Structure Preserving Reductions. ICALP (1977)
Giorgio Ausiello
On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems. MFCS (1977)
Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi
Classes of Structurally Isomorphic {NP}-Optimization Problems. MFCS (1977)
Giorgio Ausiello, Marina Moscarini
On the Complexity of Decision Problems for Classes of Simple Programs on Strings. GI Jahrestagung (1976)
Giorgio Ausiello
On the description of time varying systems in lambda - calculus. Lambda-Calculus and Computer Science Theory (1975)

Giorgio Ausiello.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Giorgio Ausiello