Giorgio Ausiello

Bull. EATCS, 2022

A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs.

[BibT_eX]

[DOI]

Lorenzo Balzotti

CoRR, 2022

2021

Theoretical Computer Science in Italy: The Early Years.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Giorgio Gambosi

IEEE Ann. Hist. Comput., 2021

Panel on "Past and Future of Computer Science Theory" (Discussion Paper).

[BibT_eX]

[DOI]

Ronald Fagin

Georg Gottlob

Proceedings of the 29th Italian Symposium on Advanced Database Systems, 2021

2020

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Max-flow vitality in undirected unweighted planar graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete.

[BibT_eX]

[DOI]

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

2019

Max flow vitality in general and st-planar graphs.

[BibT_eX]

[DOI]

Networks, 2019

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

[BibT_eX]

[DOI]

Bull. EATCS, 2019

2018

Differential Ratio Approximation.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Reductions That Preserve Approximability.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Prize Collecting Traveling Salesman and Related Problems.

[BibT_eX]

[DOI]

Stefano Leonardi

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

The Making of a New Science - A Personal Journey Through the Early Years of Theoretical Computer Science

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-319-62679-6, 2018

2017

Directed hypergraphs: Introduction and fundamental algorithms - A survey.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Max flow vitality in general and planar graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life.

[BibT_eX]

[DOI]

Rossella Petreschi

Bull. EATCS, 2016

On Resilient Graph Spanners.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

TCS in the 21st century.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2013

On Robust Graph Spanners

[BibT_eX]

[DOI]

CoRR, 2013

The (betweenness) centrality of critical nodes and network cores.

[BibT_eX]

[DOI]

Proceedings of the 2013 9th International Wireless Communications and Mobile Computing Conference, 2013

Algorithms, An Historical Perspective.

[BibT_eX]

[DOI]

Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012

Preface.

[BibT_eX]

[DOI]

Hendrik Jan Hoogeboom

Juhani Karhumäki

Ion Petre

Arto Salomaa

Theor. Comput. Sci., 2012

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

[BibT_eX]

[DOI]

Networks, 2012

Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete.

[BibT_eX]

[DOI]

Francesco Cristiano

Electron. Colloquium Comput. Complex., 2012

Online maximum k-coverage.

[BibT_eX]

[DOI]

Nicolas Boria

Aristotelis Giannakos

Giorgio Lucarelli

Discret. Appl. Math., 2012

k-Calling context profiling.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2012

Real-time analysis of critical nodes in network cores.

[BibT_eX]

[DOI]

Proceedings of the 8th International Wireless Communications and Mobile Computing Conference, 2012

Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 7th International Wireless Communications and Mobile Computing Conference, 2011

2010

Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

2009

Small stretch (alpha, beta)-spanners in the streaming model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Reoptimization of minimum and maximum traveling salesman's tours.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Greedy Algorithms For On-Line Set-Covering.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2009

Graph Spanners in the Streaming Model: An Experimental Study.

[BibT_eX]

[DOI]

Camil Demetrescu

Algorithmica, 2009

Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008

On the power of lookahead in on-line server routing problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

The on-line asymmetric traveling salesman problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

The online Prize-Collecting Traveling Salesman Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

2007

Prize-Collecting Traveling Salesman and Related Problems.

[BibT_eX]

[DOI]

Stefano Leonardi

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

Differential Ratio Approximation.

[BibT_eX]

[DOI]

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

Reductions That Preserve Approximability.

[BibT_eX]

[DOI]

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

Clairvoyance and Laziness for on Line Travelling Agents.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments.

[BibT_eX]

[DOI]

Camil Demetrescu

Proceedings of the Algorithms, 2007

2006

Small Stretch Spanners on Dynamic Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2006

Reductions, completeness and the hardness of approximability.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2006

Greedy algorithms for on-line set-covering and related problems.

[BibT_eX]

[DOI]

Aristotelis Giannakos

Proceedings of the Theory of Computing 2006, 2006

2005

Partially dynamic maintenance of minimum weight hyperpaths.

[BibT_eX]

[DOI]

Daniele Frigioni

J. Discrete Algorithms, 2005

Completeness in differential approximation classes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

On the Power of Lookahead in On-Line Vehicle Routing Problems.

[BibT_eX]

[DOI]

Luca Allulli

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Algorithms for the On-Line Quota Traveling Salesman Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

2002

Selected Papers in honour of Maurice Nivat - Editorial.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2001

25 Years.

[BibT_eX]

Donald Sannella

Michael W. Mislove

Theor. Comput. Sci., 2001

Algorithms for the On-Line Travelling Salesman.

[BibT_eX]

[DOI]

Algorithmica, 2001

Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach.

[BibT_eX]

[DOI]

Daniele Frigioni

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000

Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto Plinius.

[BibT_eX]

Proceedings of the Ottavo Convegno Nazionale su Sistemi Evoluti per Basi di Dati, 2000

Algorithm Design Challenges.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

On Salesmen, Repairmen, Spiders, and Other Traveling Agents.

[BibT_eX]

[DOI]

Stefano Leonardi

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

Exploiting Pompei Cultural Heritage: The Plinius Project.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Conference of the European Association for Computer Graphics, 1999

Complexity and approximation: combinatorial optimization problems and their approximability properties.

[BibT_eX]

[DOI]

Springer, ISBN: 3540654313, 1999

1998

Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

On-Line Algorithms for Satisfiability Problems with Uncertainty.

[BibT_eX]

[DOI]

Roberto Giaccio

Theor. Comput. Sci., 1997

Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae.

[BibT_eX]

[DOI]

Daniele Frigioni

Roberto Giaccio

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1995

Approximate Solution of NP Optimization Problems.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Theor. Comput. Sci., 1995

Local Search, Reducibility and Approximability of NP-Optimization Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Competitive Algorithms for the On-line Traveling Salesman.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994

Serving Requests with On-line Routing.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

1992

On-Line Computation of Minimal and Maximal Length Paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

1991

On-Line Algorithms for Polynomially Solvable Satisfiability Problems.

[BibT_eX]

[DOI]

J. Log. Program., 1991

Incremental Algorithms for Minimal Length Paths.

[BibT_eX]

[DOI]

J. Algorithms, 1991

1990

Dynamic Maintenance of Directed Hypergraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Limiting Polynomial Approximation of Complexity Classes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1990

1988

Special Issue: First International Conference on Database Theory, Rome, September 1986, Forword.

[BibT_eX]

Theor. Comput. Sci., 1988

Dynamic Maintenance of Paths and Path Expressions on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 1988

Directed Hypergraphs: Data Structures and Applications.

[BibT_eX]

[DOI]

Proceedings of the CAAP '88, 1988

1986

Minimal Representation of Directed Hypergraphs.

[BibT_eX]

[DOI]

Domenico Saccà

SIAM J. Comput., 1986

Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1986

1985

On the Existence of Acyclic Views in a Database Scheme.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

1983

Graph Algorithms for Functional Dependency Manipulation

[BibT_eX]

[DOI]

Domenico Saccà

J. ACM, October, 1983

Probabilistic Models for Database Schemes and Random Hypergraphs.

[BibT_eX]

Maurizio Talamo

Proceedings of the WG '83, 1983

1982

Inclusion and Equivalence between Relational Database Schemata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Minimal Coverings of Acyclic Database Schemata.

[BibT_eX]

Proceedings of the Advances in Data Base Theory, 1982

1981

Lattice theoretic ordering properties for NP-complete optimization problems.

[BibT_eX]

Fundam. Informaticae, 1981

Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

Full Approximatibility of a Class of Problems over Power Sets.

[BibT_eX]

[DOI]

Proceedings of the CAAP '81, 1981

1980

Toward a Unified Approach for the Classification of NP-Complete Optimization Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

Structure Preserving Reductions among Convex Optimization Problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes.

[BibT_eX]

[DOI]

Domenico Saccà

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

Conceptual Relations between Databases Transformed under Join and Projection.

[BibT_eX]

[DOI]

Carlo Batini

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

On the Equivalence among Data Base Schemata.

[BibT_eX]

Carlo Batini

Proceedings of the Proceedings International Conference on Data Bases, 1980

Polynomials - The Specification, Analysis and Development of an Abstract Data Type.

[BibT_eX]

[DOI]

Proceedings of the GI - 10. Jahrestagung, Saarbrücken, 30. September, 1980

1979

Design of algebraic data structures with the approach of abstract data types.

[BibT_eX]

[DOI]

Giovanni Mascari

Proceedings of the Symbolic and Algebraic Computation, 1979

1977

Classes of Structurally Isomorphic {NP}-Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

On the Structure of Combinatorial Problems and Structure Preserving Reductions.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1977

1976

On the Complexity of Decision Problems for Classes of Simple Programs on Strings.

[BibT_eX]

[DOI]

Proceedings of the GI - 6. Jahrestagung, Stuttgart, 29. September, 1976

1975

On the Comparison of Notions of Approximation.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

On the description of time varying systems in lambda - calculus.

[BibT_eX]

[DOI]

Proceedings of the Lambda-Calculus and Computer Science Theory, 1975

1974

Relations between Semantics and Complexity of Recursive Programs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1971

Abstract Computational Complexity and Cycling Computations.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1971

1970

On Bounds on the Number of Steps to Compute Functions

[BibT_eX]

[DOI]