Giorgio Ausiello

From MaRDI portal
Person:289923

Available identifiers

zbMath Open ausiello.giorgioDBLPa/GiorgioAusielloWikidataQ20797698 ScholiaQ20797698MaRDI QIDQ289923

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61610442023-06-26Paper
Competitive algorithms for the on-line traveling salesman2022-12-16Paper
Serving requests with on-line routing2022-12-09Paper
Max flow vitality in general and st‐planar graphs2019-08-01Paper
The Making of a New Science2018-10-19Paper
Directed hypergraphs: introduction and fundamental algorithms -- a survey2017-02-06Paper
On resilient graph spanners2016-05-31Paper
Greedy algorithms for on-line set-covering2013-12-11Paper
On resilient graph spanners2013-09-17Paper
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs2012-11-02Paper
Complexity and approximation in reoptimization2012-09-05Paper
Online maximum \(k\)-coverage2012-08-10Paper
Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components2012-06-29Paper
Preface2012-05-30Paper
Online Maximum k-Coverage2011-08-19Paper
COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING2011-03-25Paper
https://portal.mardi4nfdi.de/entity/Q30593232010-12-08Paper
https://portal.mardi4nfdi.de/entity/Q30593192010-12-08Paper
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming2010-07-20Paper
The online prize-collecting traveling salesman problem2010-04-19Paper
Reoptimization of minimum and maximum traveling salesman's tours2009-12-10Paper
Graph spanners in the streaming model: An experimental study2009-08-27Paper
Algorithms for the on-line quota traveling salesman problem2009-08-27Paper
Small stretch \((\alpha ,\beta )\)-spanners in the streaming model2009-08-21Paper
Small Stretch Spanners on Dynamic Graphs2009-01-19Paper
On the power of lookahead in on-line server routing problems2008-12-12Paper
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments2008-09-25Paper
The on-line asymmetric traveling salesman problem2008-08-08Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Reoptimization of Minimum and Maximum Traveling Salesman’s Tours2007-09-07Paper
Theory and Applications of Models of Computation2007-04-30Paper
Algorithms and Data Structures2006-10-25Paper
Algorithms – ESA 20052006-06-27Paper
Reductions, completeness and the hardness of approximability2006-05-16Paper
Computing and Combinatorics2006-01-11Paper
COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES2005-12-15Paper
Computing and Combinatorics2005-06-15Paper
Partially dynamic maintenance of minimum weight hyperpaths2005-05-04Paper
https://portal.mardi4nfdi.de/entity/Q44483732004-02-18Paper
https://portal.mardi4nfdi.de/entity/Q45364522002-11-25Paper
Algorithms for the on-line travelling salesman2002-02-19Paper
https://portal.mardi4nfdi.de/entity/Q45039352001-11-28Paper
https://portal.mardi4nfdi.de/entity/Q42582161999-09-01Paper
https://portal.mardi4nfdi.de/entity/Q42180921999-07-14Paper
https://portal.mardi4nfdi.de/entity/Q43702041998-02-05Paper
Approximate solution of NP optimization problems1997-02-28Paper
On-line algorithms for satisfiability problems with uncertainty1997-02-28Paper
Local search, reducibility and approximability of NP-optimization problems1997-02-28Paper
https://portal.mardi4nfdi.de/entity/Q48710571996-09-05Paper
https://portal.mardi4nfdi.de/entity/Q31388721994-01-02Paper
Incremental algorithms for minimal length paths1992-06-28Paper
On-line computation of minimal and maximal length paths1992-06-28Paper
On-line algorithms for polynomially solvable satisfiability problems1992-06-25Paper
Dynamic maintenance of directed hypergraphs1990-01-01Paper
LIMITING POLYNOMIAL APPROXIMATION OF COMPLEXITY CLASSES1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37922531988-01-01Paper
Minimal Representation of Directed Hypergraphs1986-01-01Paper
Chordality properties on graphs and minimal conceptual connections in semantic data models1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51873201985-01-01Paper
On the existence of acyclic views in a database scheme1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36802771984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36877541984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36910641984-01-01Paper
Graph Algorithms for Functional Dependency Manipulation1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33419291983-01-01Paper
Inclusion and equivalence between relational database schemata1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39206451981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39236001981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39236011981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39025521981-01-01Paper
Structure preserving reductions among convex optimization problems1980-01-01Paper
Toward a unified approach for the classification of NP-complete optimization problems1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38918041980-01-01Paper
Combinatorial problems over power sets1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37218101979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41872911979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41381291977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41331331977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41980571977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41227731976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41412211976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40857131975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41000671975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38638661974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47768161974-01-01Paper
Una introduzione alla manipolazione algebrica1972-01-01Paper
Abstract computational complexity and cycling computations1971-01-01Paper
Teorie della complessità di calcolo1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40575631971-01-01Paper

Research outcomes over time

This page was built for person: Giorgio Ausiello