Giorgio Ausiello | Academic Influence

Giorgio Ausiello's AcademicInfluence.com Rankings

Giorgio Ausiello

Computer Science

#2102

World Rank

#2184

Historical Rank

Database

#7685

World Rank

#7985

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Giorgio Ausiello's Degrees

PhD Computer Science Consorzio ICoN

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Giorgio Ausiello Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Giorgio Ausiello is an Italian computer scientist. Born in 1941, in 1966 he graduated in physics under the supervision of Corrado Böhm. From 1966 to 1980, he served as a researcher at the Italian National Research Council . In 1980, he became a professor of compilers and operating systems at Sapienza University of Rome and since 1990 he has been a professor of theoretical computer science in the department of computer, control and management engineering, where he has been until recently the leader of the research group on algorithm engineering. At academic level Giorgio Ausiello has been chairman of the degree in computer engineering, director of the graduate school, then member of the academic senate and finally chairman of the research committee of Sapienza University. In 2012 he has been nominated professor emeritus of Sapienza University of Rome.

(See a Problem?)

Giorgio Ausiello's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Complexity and approximation: combinatorial optimization problems and their approximability properties (1999) (1438)
Complexity and Approximation (1999) (890)
Structure Preserving Reductions among Convex Optimization Problems (1980) (241)
Incremental algorithms for minimal length paths (1991) (190)
Approximate Solution of NP Optimization Problems (1995) (114)
Minimal Representation of Directed Hypergraphs (1986) (106)
Graph Algorithms for Functional Dependency Manipulation (1983) (105)
Algorithms for the on-line travelling salesman (1999) (90)
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach (2001) (90)
Reoptimization of minimum and maximum traveling salesman's tours (2006) (88)
Algorithms for the On-Line Travelling Salesman1 (2001) (87)
Algorithm Design for Computer System Design (1984) (79)
Competitive Algorithms for the On-line Traveling Salesman (1995) (75)
Inclusion and Equivalence between Relational Database Schemata (1982) (60)
On Salesmen, Repairmen, Spiders, and Other Traveling Agents (2000) (58)
Complexity and Approximation in Reoptimization (2008) (57)
Algorithms for the On-Line Quota Traveling Salesman Problem (2004) (53)
Optimal Traversal of Directed Hypergraphs (1992) (53)
The online Prize-Collecting Traveling Salesman Problem (2008) (46)
Analysis and design of algorithms for combinatorial problems (1985) (46)
Dynamic Maintenance of Directed Hypergraphs (1990) (46)
Toward a Unified Approach for the Classification of NP-Complete Optimization Problems (1979) (45)
On-Line Algorithms for Polynomially Solvable Satisfiability Problems (1990) (45)
Directed hypergraphs: Introduction and fundamental algorithms - A survey (2017) (43)
Chordality properties on graphs and minimal conceptual connections in semantic data models (1985) (42)
Local Search, Reducibility and Approximability of NP-Optimization Problems (1995) (40)
Online maximum k-coverage (2011) (34)
The on-line asymmetric traveling salesman problem (2005) (33)
Analysis and design of algorithms in combinatorial optimization (1981) (32)
On the Structure of Combinatorial Problems and Structure Preserving Reductions (1977) (31)
Serving Requests with On-line Routing (1994) (28)
Small Stretch Spanners on Dynamic Graphs (2005) (26)
Completeness in differential approximation classes (2003) (26)
The Making of a New Science (2018) (25)
On the Power of Lookahead in On-Line Vehicle Routing Problems (2005) (22)
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms (1998) (21)
Lattice theoretic ordering properties for NP-complete optimization problems (1981) (21)
The Complexity of Optimization Problems (1999) (21)
Prize-Collecting Traveling Salesman and Related Problems (2007) (20)
Minimal Coverings of Acyclic Database Schemata (1982) (19)
On the power of lookahead in on-line server routing problems (2008) (18)
On-Line Algorithms for Satisfiability Problems with Uncertainty (1994) (18)
Abstract Computational Complexity and Cycling Computations (1971) (16)
Optimization and Approximation (2018) (15)
On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance (2006) (13)
Reductions, completeness and the hardness of approximability (2006) (13)
k-Calling context profiling (2012) (12)
The (betweenness) centrality of critical nodes and network cores (2013) (12)
Real‐time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components (2012) (12)
Strongly Equivalent Directed Hypergraphs (1985) (11)
On-Line Computation of Minimal and Maximal Length Paths (1992) (10)
On the Equivalence among Data Base Schemata (1980) (10)
Directed Hypergraphs: Data Structures and Applications (1988) (10)
On Resilient Graph Spanners (2013) (9)
Proceedings of the International Conference on Database Theory (1986) (9)
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming (2010) (8)
Graph Spanners in the Streaming Model: An Experimental Study (2009) (7)
Reductions That Preserve Approximability (2007) (7)
Proceedings of the 16th International Colloquium on Automata, Languages and Programming (1989) (7)
Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae (1997) (7)
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs (2012) (7)
Conceptual Relations between Databases Transformed under Join and Projection (1980) (7)
Max flow vitality in general and st‐planar graphs (2019) (7)
Partially dynamic maintenance of minimum weight hyperpaths (2005) (6)
On the Existence of Acyclic Views in a Database Scheme (1985) (6)
Design of algebraic data structures with the approach of abstract data types (1979) (6)
Dynamic Maintenance of Paths and Path Expressions on Graphs (1988) (5)
Greedy algorithms for on-line set-covering and related problems (2006) (5)
Real-time analysis of critical nodes in network cores (2012) (5)
Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life (2016) (5)
Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy (2008) (5)
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments (2007) (5)
Real-time anomalies detection and analysis of network structure, with application to the Autonomous System network (2011) (4)
Exploiting Pompei Cultural Heritage: The Plinius Project (1999) (4)
On bounds on the number of steps to compute functions (1970) (4)
Large-Scale Graph Biconnectivity in MapReduce (2012) (4)
Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes (1980) (4)
Greedy Algorithms For On-Line Set-Covering (2009) (4)
Classes of Structurally Isomorphic {NP}-Optimization Problems (1977) (4)
Max-flow vitality in undirected unweighted planar graphs (2020) (4)
Polynomials - The Specification, Analysis and Development of an Abstract Data Type (1980) (4)
Differential Ratio Approximation (2007) (4)
On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems (1977) (4)
Full Approximatibility of a Class of Problems over Power Sets (1981) (3)
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems (1981) (3)
The Power of Algorithms (2013) (3)
Classification and Traversal Algorithmic Techniques for Optimization Problems on Directed Hyperpaths (2010) (3)
Probabilistic analysis of the solution of the knapsack problem (1982) (3)
Completeness in differential approximation classes: (Extended abstract) (2003) (3)
On the Complexity of Decision Problems for Classes of Simple Programs on Strings (1976) (3)
Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete (2020) (3)
Approximation Preserving Reductions (1999) (2)
Automata, Languages, and Programming: 16th International Colloquium Stresa, Italy, July 11-15, 1989 Proceedings (1989) (2)
Selected Papers in honour of Maurice Nivat - Editorial (2002) (2)
Combinatorial problems over power sets (1979) (2)
Max flow vitality in general and planar graphs (2017) (2)
Fundamental Study Approximate solution of NP optimization problems (1995) (2)
ON EXPLORERS , CHASERS AND CAMERAMEN (2004) (2)
Simple Programs on Strings and Their Decision Problems (1975) (2)
Selected papers of the 16th international colloquium on Automata, languages, and programming (1991) (1)
Proceedings of the 8th Colloquium on Trees in Algebra and Programming (1983) (1)
Proceedings of the Fifth Colloquium on Automata, Languages and Programming (1978) (1)
Approximability preserving reductions (2005) (1)
Europe Strikes Back (2018) (1)
Relations between Semantics and Complexity of Recursive Programs (1974) (1)
Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components (2009) (1)
Small stretch (alpha, beta)-spanners in the streaming model (2009) (1)
Limiting Polynomial Approximation of Complexity Classes (1990) (1)
Incremental algorithms forminimal length paths (1991) (1)
Parallel computer models: an introduction (1984) (1)
Automatic reduction of cuch expression by means of the value method (1968) (1)
Minimal representations of directed hypergraphs and their application to database design (1984) (1)
Expressiveness and Complexity of Formal Systems (1999) (1)
Chapter 4 Complexity and Approximation in Reoptimization (2014) (1)
The Making of a New Science A Personal Journey Through the Early Years of Theoretical Computer Science (2018) (1)
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17-21, 1978 (1978) (1)
Incremental DFS Trees on Arbitrary Directed Graphs (2015) (1)
Design Techniques for Approximation Algorithms (1999) (1)
Difficult logical theories and their computer approximations (2019) (0)
On-line models for set-covering: the power of greediness (2006) (0)
Differential approximation(septembre 2005) (2017) (0)
Probabilistic Models for Database Schemes and Random Hypergraphs (1983) (0)
Algorithmic research for the 21st century (2005) (0)
Algorithms, An Historical Perspective (2013) (0)
CAHIER DU LAMSADE 204 Mars 2003 Completeness in differential approximation classes (2003) (0)
TCS in the 21st century (2015) (0)
Panel on "Past and Future of Computer Science Theory" (Discussion Paper) (2021) (0)
Counting Steps in Cory Hall (2018) (0)
Algorithm Design Challenges (2000) (0)
CAHIER DU LAMSADE 228 Septembre 2005 Differential approximation (2005) (0)
Geographic Information Management — The ESPRIT ”Basic Goods” Action (1992) (0)
Online models for set-covering: the flaw of greediness (2010) (0)
NP, PCP and Non-approximability Results (1999) (0)
Algorithms and complexity : proceedings of the first Italian conference, Rome, Italy, 1-2 October 1990 (1990) (0)
The PCP theorem (1999) (0)
Algorithmic research for the 21 st century (2006) (0)
On‐Line Algorithms (2013) (0)
11 – Data structures and algorithms (1991) (0)
Input-Dependent and Asymptotic Approximation (1999) (0)
Probabilistic analysis of approximation algorithms (1999) (0)
G.AUSIELLO, A.D'ATRI, M.PROTASI (1977)On the structure of combinatoriat probtems and struoture preserving reductior:z.s,. 4th Int. ColI. on Automata,Languages andProgr'amming, Turku, (1977). (1978) (0)
Lots of Insipid Stupid Parentheses (2018) (0)
12. Approximation Preserving Reductions (2013) (0)
Preface (2012) (0)
CAHIER DU LAMSADE 227 Septembre 2005 Approximability preserving reductions (2005) (0)
On the Comparison of Notions of Approximation (1975) (0)
Greedy algorithms for on-line set-covering ( Preliminary version ) (2008) (0)
INTERNATIONAL SCHOOL OF MATHEMATICS «GUIDO STAMPACCHIA» 56th Workshop: GRAPH THEORY, ALGORITHMS AND APPLICATIONS (2008) (0)
On Robust Graph Spanners (2013) (0)
On Resilient Graph Spanners (2015) (0)
CAAP '83 : Trees in algebra and programming, 8th colloquium, L'Aquila, March 9-11, 1983, proceedings (1983) (0)
ALGORITHMS AND COMPLEXITY: Rome, Italy 1 – 2 October 1990 (1990) (0)
Data Structures, Program Structures (2018) (0)
ICDT '86 : International Conference on Database Theory, Rome, Italy, September 8-10, 1986, proceedings (1986) (0)
Computational Complexity and Cycling (2007) (0)
On the description of time varying systems in lambda - calculus (1975) (0)
25 Years (2001) (0)
Clairvoyance and Laziness for on Line Travelling Agents (2007) (0)
Information technology opportunities (Italian) (1999) (0)
Approximability preserving reductions (septembre 2005) (2018) (0)
Theoretical Computer Science in Italy: The Early Years (2021) (0)
Complexity of exact and approximate solution of problems: an introduction (1984) (0)
A Characterization of Reductions among Combinatorial Problems (1981) (0)
Approximation through Randomization (1999) (0)
Special Issue: First International Conference on Database Theory, Rome, September 1986, Forword (1988) (0)
EATCS Golden Jubilee: How EATCS was born 50 years ago and why it is still alive and well (2022) (0)
I hate numerical analysis (2018) (0)
Preface (2020) (0)
Difficult logical theories and their computer approximations (2019) (0)

This paper list is powered by the following services:

Other Resources About Giorgio Ausiello

en.wikipedia.org

What Schools Are Affiliated With Giorgio Ausiello?

Giorgio Ausiello is affiliated with the following schools: