Giorgio Ausiello

From MaRDI portal
(Redirected from Person:289923)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Algorithms, monks, and merchants. Computing in everyday life in the Middle Ages2025-04-17Paper
scientific article; zbMATH DE number 7701413 (Why is no real title available?)2023-06-26Paper
Competitive algorithms for the on-line traveling salesman
Lecture Notes in Computer Science
2022-12-16Paper
Serving requests with on-line routing
Algorithm Theory — SWAT '94
2022-12-09Paper
Max flow vitality in general and st-planar graphs
Networks
2019-08-01Paper
The making of a new science. A personal journey through the early years of theoretical computer science2018-10-19Paper
Directed hypergraphs: introduction and fundamental algorithms -- a survey
Theoretical Computer Science
2017-02-06Paper
On resilient graph spanners
Algorithmica
2016-05-31Paper
Greedy algorithms for on-line set-covering
Algorithmic Operations Research
2013-12-11Paper
On resilient graph spanners
Lecture Notes in Computer Science
2013-09-17Paper
Structure theorems for optimum hyperpaths in directed hypergraphs
Lecture Notes in Computer Science
2012-11-02Paper
Complexity and approximation in reoptimization2012-09-05Paper
Online maximum \(k\)-coverage
Discrete Applied Mathematics
2012-08-10Paper
Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
Networks
2012-06-29Paper
Preface
Theoretical Computer Science
2012-05-30Paper
Online maximum \(k\)-coverage
Fundamentals of Computation Theory
2011-08-19Paper
Computing graph spanners in small memory: fault-tolerance and streaming
Discrete Mathematics, Algorithms and Applications
2011-03-25Paper
scientific article; zbMATH DE number 5823943 (Why is no real title available?)2010-12-08Paper
Approximation preserving reductions2010-12-08Paper
Computing graph spanners in small memory: fault-tolerance and streaming
Lecture Notes in Computer Science
2010-07-20Paper
The online prize-collecting traveling salesman problem
Information Processing Letters
2010-04-19Paper
Reoptimization of minimum and maximum traveling salesman's tours
Journal of Discrete Algorithms
2009-12-10Paper
Graph spanners in the streaming model: An experimental study
Algorithmica
2009-08-27Paper
Algorithms for the on-line quota traveling salesman problem
Information Processing Letters
2009-08-27Paper
Small stretch ( , )-spanners in the streaming model
Theoretical Computer Science
2009-08-21Paper
Small Stretch Spanners on Dynamic Graphs
Journal of Graph Algorithms and Applications
2009-01-19Paper
Small Stretch Spanners on Dynamic Graphs
Journal of Graph Algorithms and Applications
2009-01-19Paper
On the power of lookahead in on-line server routing problems
Theoretical Computer Science
2008-12-12Paper
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
Algorithms – ESA 2007
2008-09-25Paper
The on-line asymmetric traveling salesman problem
Journal of Discrete Algorithms
2008-08-08Paper
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science
2007-12-07Paper
Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
Algorithm Theory – SWAT 2006
2007-09-07Paper
Theory and Applications of Models of Computation
Lecture Notes in Computer Science
2007-04-30Paper
Algorithms and Data Structures
Lecture Notes in Computer Science
2006-10-25Paper
Algorithms – ESA 2005
Lecture Notes in Computer Science
2006-06-27Paper
Reductions, completeness and the hardness of approximability
European Journal of Operational Research
2006-05-16Paper
Computing and Combinatorics
Lecture Notes in Computer Science
2006-01-11Paper
COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
International Journal of Foundations of Computer Science
2005-12-15Paper
Computing and Combinatorics
Lecture Notes in Computer Science
2005-06-15Paper
Partially dynamic maintenance of minimum weight hyperpaths
Journal of Discrete Algorithms
2005-05-04Paper
scientific article; zbMATH DE number 2044509 (Why is no real title available?)2004-02-18Paper
scientific article; zbMATH DE number 1759498 (Why is no real title available?)2002-11-25Paper
Algorithms for the on-line travelling salesman
Algorithmica
2002-02-19Paper
scientific article; zbMATH DE number 1507215 (Why is no real title available?)2001-11-28Paper
scientific article; zbMATH DE number 1330033 (Why is no real title available?)1999-09-01Paper
scientific article; zbMATH DE number 1222555 (Why is no real title available?)1999-07-14Paper
scientific article; zbMATH DE number 1104331 (Why is no real title available?)1998-02-05Paper
Approximate solution of NP optimization problems
Theoretical Computer Science
1997-02-28Paper
On-line algorithms for satisfiability problems with uncertainty
Theoretical Computer Science
1997-02-28Paper
Local search, reducibility and approximability of NP-optimization problems
Information Processing Letters
1997-02-28Paper
scientific article; zbMATH DE number 861333 (Why is no real title available?)1996-09-05Paper
scientific article; zbMATH DE number 432746 (Why is no real title available?)1994-01-02Paper
Incremental algorithms for minimal length paths
Journal of Algorithms
1992-06-28Paper
On-line computation of minimal and maximal length paths
Theoretical Computer Science
1992-06-28Paper
On-line algorithms for polynomially solvable satisfiability problems
The Journal of Logic Programming
1992-06-25Paper
Dynamic maintenance of directed hypergraphs
Theoretical Computer Science
1990-01-01Paper
LIMITING POLYNOMIAL APPROXIMATION OF COMPLEXITY CLASSES
International Journal of Foundations of Computer Science
1990-01-01Paper
scientific article; zbMATH DE number 4057024 (Why is no real title available?)1988-01-01Paper
Minimal Representation of Directed Hypergraphs
SIAM Journal on Computing
1986-01-01Paper
Chordality properties on graphs and minimal conceptual connections in semantic data models
Journal of Computer and System Sciences
1986-01-01Paper
scientific article; zbMATH DE number 3895108 (Why is no real title available?)1985-01-01Paper
On the existence of acyclic views in a database scheme
Theoretical Computer Science
1985-01-01Paper
scientific article; zbMATH DE number 3902037 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3911762 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3915629 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3876623 (Why is no real title available?)1983-01-01Paper
Graph Algorithms for Functional Dependency Manipulation
Journal of the ACM
1983-01-01Paper
Inclusion and equivalence between relational database schemata
Theoretical Computer Science
1982-01-01Paper
scientific article; zbMATH DE number 3733262 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3737032 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3737033 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3711459 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3698433 (Why is no real title available?)1980-01-01Paper
Structure preserving reductions among convex optimization problems
Journal of Computer and System Sciences
1980-01-01Paper
Toward a unified approach for the classification of NP-complete optimization problems
Theoretical Computer Science
1980-01-01Paper
scientific article; zbMATH DE number 3952002 (Why is no real title available?)1979-01-01Paper
scientific article; zbMATH DE number 3624766 (Why is no real title available?)1979-01-01Paper
Combinatorial problems over power sets
Calcolo
1979-01-01Paper
scientific article; zbMATH DE number 3566162 (Why is no real title available?)1977-01-01Paper
scientific article; zbMATH DE number 3557234 (Why is no real title available?)1977-01-01Paper
scientific article; zbMATH DE number 3639145 (Why is no real title available?)1977-01-01Paper
scientific article; zbMATH DE number 3548404 (Why is no real title available?)1976-01-01Paper
scientific article; zbMATH DE number 3568662 (Why is no real title available?)1976-01-01Paper
scientific article; zbMATH DE number 3504955 (Why is no real title available?)1975-01-01Paper
scientific article; zbMATH DE number 3520385 (Why is no real title available?)1975-01-01Paper
scientific article; zbMATH DE number 3664924 (Why is no real title available?)1974-01-01Paper
scientific article; zbMATH DE number 3453093 (Why is no real title available?)1974-01-01Paper
Una introduzione alla manipolazione algebrica
Calcolo
1972-01-01Paper
scientific article; zbMATH DE number 3473280 (Why is no real title available?)1971-01-01Paper
Abstract computational complexity and cycling computations
Journal of Computer and System Sciences
1971-01-01Paper
Teorie della complessità di calcolo
Calcolo
1971-01-01Paper


Research outcomes over time


This page was built for person: Giorgio Ausiello