Giorgio Ausiello

According to our database1, Giorgio Ausiello authored at least 90 papers between 1970 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Preface.
Theor. Comput. Sci., 2019

Max flow vitality in general and st-planar graphs.
Networks, 2019

The Making of a New Science A Personal Journey Through the Early Years of Theoretical Computer Science.
Bulletin of the EATCS, 2019

2018
The Making of a New Science - A Personal Journey Through the Early Years of Theoretical Computer Science
Springer, ISBN: 978-3-319-62679-6, 2018

2017
Directed hypergraphs: Introduction and fundamental algorithms - A survey.
Theor. Comput. Sci., 2017

2016
Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life.
Bulletin of the EATCS, 2016

2015
TCS in the 21st century.
Theor. Comput. Sci., 2015

2013
The (betweenness) centrality of critical nodes and network cores.
Proceedings of the 2013 9th International Wireless Communications and Mobile Computing Conference, 2013

On Resilient Graph Spanners.
Proceedings of the Algorithms - ESA 2013, 2013

Algorithms, An Historical Perspective.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012
Preface.
Theor. Comput. Sci., 2012

Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components.
Networks, 2012

Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete.
Electronic Colloquium on Computational Complexity (ECCC), 2012

k-Calling context profiling.
Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2012

Real-time analysis of critical nodes in network cores.
Proceedings of the 8th International Wireless Communications and Mobile Computing Conference, 2012

Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Real-time anomalies detection and analysis of network structure, with application to the Autonomous System network.
Proceedings of the 7th International Wireless Communications and Mobile Computing Conference, 2011

Online Maximum k-Coverage.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming.
Discrete Math., Alg. and Appl., 2010

Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
Small stretch (alpha, beta)-spanners in the streaming model.
Theor. Comput. Sci., 2009

Greedy Algorithms For On-Line Set-Covering.
Algorithmic Operations Research, 2009

Graph Spanners in the Streaming Model: An Experimental Study.
Algorithmica, 2009

Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008
On the power of lookahead in on-line server routing problems.
Theor. Comput. Sci., 2008

The online Prize-Collecting Traveling Salesman Problem.
Inf. Process. Lett., 2008

2007
Prize-Collecting Traveling Salesman and Related Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Differential Ratio Approximation.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Reductions That Preserve Approximability.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Clairvoyance and Laziness for on Line Travelling Agents.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments.
Proceedings of the Algorithms, 2007

2006
Reductions, completeness and the hardness of approximability.
European Journal of Operational Research, 2006

On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance.
Proceedings of the Theory and Applications of Models of Computation, 2006

Reoptimization of Minimum and Maximum Traveling Salesman's Tours.
Proceedings of the Algorithm Theory, 2006

Greedy algorithms for on-line set-covering and related problems.
Proceedings of the Theory of Computing 2006, 2006

2005
Partially dynamic maintenance of minimum weight hyperpaths.
J. Discrete Algorithms, 2005

The On-line Asymmetric Traveling Salesman Problem.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Small Stretch Spanners on Dynamic Graphs.
Proceedings of the Algorithms, 2005

On the Power of Lookahead in On-Line Vehicle Routing Problems.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Algorithms for the On-Line Quota Traveling Salesman Problem.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Completeness in Differential Approximation Classes.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
Selected Papers in honour of Maurice Nivat - Editorial.
Theor. Comput. Sci., 2002

2001
25 Years.
Theor. Comput. Sci., 2001

Algorithms for the On-Line Travelling Salesman.
Algorithmica, 2001

Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000
Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto Plinius.
Proceedings of the Ottavo Convegno Nazionale su Sistemi Evoluti per Basi di Dati, 2000

Algorithm Design Challenges.
Proceedings of the Theoretical Computer Science, 2000

On Salesmen, Repairmen, Spiders, and Other Traveling Agents.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
Complexity and approximation: combinatorial optimization problems and their approximability properties.
Springer, ISBN: 3540654313, 1999

1998
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
On-Line Algorithms for Satisfiability Problems with Uncertainty.
Theor. Comput. Sci., 1997

Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1995
Approximate Solution of NP Optimization Problems.
Theor. Comput. Sci., 1995

Local Search, Reducibility and Approximability of NP-Optimization Problems.
Inf. Process. Lett., 1995

Competitive Algorithms for the On-line Traveling Salesman.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994
Serving Requests with On-line Routing.
Proceedings of the Algorithm Theory, 1994

1992
On-Line Computation of Minimal and Maximal Length Paths.
Theor. Comput. Sci., 1992

1991
On-Line Algorithms for Polynomially Solvable Satisfiability Problems.
J. Log. Program., 1991

1990
Dynamic Maintenance of Directed Hypergraphs.
Theor. Comput. Sci., 1990

Limiting Polynomial Approximation of Complexity Classes.
Int. J. Found. Comput. Sci., 1990

Incremental Algorithms for Minimal Length Paths.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1988
Special Issue: First International Conference on Database Theory, Rome, September 1986, Forword.
Theor. Comput. Sci., 1988

Dynamic Maintenance of Paths and Path Expressions on Graphs.
Proceedings of the Symbolic and Algebraic Computation, 1988

Directed Hypergraphs: Data Structures and Applications.
Proceedings of the CAAP '88, 1988

1986
Minimal Representation of Directed Hypergraphs.
SIAM J. Comput., 1986

1985
On the Existence of Acyclic Views in a Database Scheme.
Theor. Comput. Sci., 1985

Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models.
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985

1983
Graph Algorithms for Functional Dependency Manipulation
J. ACM, October, 1983

Probabilistic Models for Database Schemes and Random Hypergraphs.
Proceedings of the WG '83, 1983

1982
Inclusion and Equivalence between Relational Database Schemata.
Theor. Comput. Sci., 1982

Minimal Coverings of Acyclic Database Schemata.
Proceedings of the Advances in Data Base Theory, 1982

1981
Lattice theoretic ordering properties for NP-complete optimization problems.
Fundam. Inform., 1981

Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems.
Proceedings of the Fundamentals of Computation Theory, 1981

Full Approximatibility of a Class of Problems over Power Sets.
Proceedings of the CAAP '81, 1981

1980
Toward a Unified Approach for the Classification of NP-Complete Optimization Problems.
Theor. Comput. Sci., 1980

Structure Preserving Reductions among Convex Optimization Problems.
J. Comput. Syst. Sci., 1980

Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

Conceptual Relations between Databases Transformed under Join and Projection.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

On the Equivalence among Data Base Schemata.
Proceedings of the Proceedings International Conference on Data Bases, 1980

Polynomials - The Specification, Analysis and Development of an Abstract Data Type.
Proceedings of the GI - 10. Jahrestagung, Saarbrücken, 30. September, 1980

1979
Design of algebraic data structures with the approach of abstract data types.
Proceedings of the Symbolic and Algebraic Computation, 1979

1977
Classes of Structurally Isomorphic {NP}-Optimization Problems.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

On the Structure of Combinatorial Problems and Structure Preserving Reductions.
Proceedings of the Automata, 1977

1976
On the Complexity of Decision Problems for Classes of Simple Programs on Strings.
Proceedings of the GI - 6. Jahrestagung, Stuttgart, 29. September, 1976

1975
On the Comparison of Notions of Approximation.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

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

1974
Relations between Semantics and Complexity of Recursive Programs.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1971
Abstract Computational Complexity and Cycling Computations.
J. Comput. Syst. Sci., 1971

1970
On Bounds on the Number of Steps to Compute Functions
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970


  Loading...