Giorgio Ausiello - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 105

2022

EATCS Golden Jubilee: How EATCS was born 50 years ago and why it is still alive and wellGiorgio Ausiello. eatcs, 137, 2022. [doi]

2021

Theoretical Computer Science in Italy: The Early YearsGiorgio Ausiello, Giorgio Gambosi. annals, 43(3):44-56, 2021. [doi]

Panel on "Past and Future of Computer Science Theory" (Discussion Paper)Ronald Fagin, Georg Gottlob, Christos H. Papadimitriou, Moshe Y. Vardi, Giorgio Ausiello, Maurizio Lenzerini, Domenico Saccà, Luigi Palopoli, Francesco Scarcello. sebd 2021: 531-542 [doi]

2020

PrefaceGiorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien. TCS, 807:1-2, 2020. [doi]

Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism CompleteGiorgio Ausiello, Francesco Cristiano, Paolo Fantozzi, Luigi Laura. ictcs 2020: 190-201 [doi]

2019

2018

The Making of a New Science - A Personal Journey Through the Early Years of Theoretical Computer ScienceGiorgio Ausiello. Springer, 2018. [doi]

Prize Collecting Traveling Salesman and Related ProblemsGiorgio Ausiello, Vincenzo Bonifaci, Stefano Leonardi, Alberto Marchetti-Spaccamela. In Teofilo F. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications. pages 611-628, Chapman and Hall/CRC, 2018. [doi]

Reductions That Preserve ApproximabilityGiorgio Ausiello, Vangelis Th. Paschos. In Teofilo F. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications. pages 243-258, Chapman and Hall/CRC, 2018. [doi]

Differential Ratio ApproximationGiorgio Ausiello, Vangelis Th. Paschos. In Teofilo F. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications. pages 259-274, Chapman and Hall/CRC, 2018. [doi]

2017

Directed hypergraphs: Introduction and fundamental algorithms - A surveyGiorgio Ausiello, Luigi Laura. TCS, 658:293-306, 2017. [doi]

2016

Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday LifeGiorgio Ausiello, Rossella Petreschi. eatcs, 118, 2016. [doi]

On Resilient Graph SpannersGiorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini. algorithmica, 74(4):1363-1385, 2016. [doi]

2015

TCS in the 21st centuryGiorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella. TCS, 591:3-4, 2015. [doi]

2013

Algorithms, An Historical PerspectiveGiorgio Ausiello. In Giorgio Ausiello, Rossella Petreschi, editors, The Power of Algorithms - Inspiration and Examples in Everyday Life. pages 3-26, Springer, 2013. [doi]

On Resilient Graph SpannersGiorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini. esa 2013: 85-96 [doi]

The (betweenness) centrality of critical nodes and network coresGiorgio Ausiello, Donatella Firmani, Luigi Laura. iwcmc 2013: 90-95 [doi]

2012

Online maximum k-coverageGiorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos. DAM, 160(13-14):1901-1913, 2012. [doi]

Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism CompleteGiorgio Ausiello, Francesco Cristiano, Luigi Laura. eccc, 19:122, 2012. [doi]

Structure Theorems for Optimum Hyperpaths in Directed HypergraphsGiorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco. iscopt 2012: 1-14 [doi]

PrefaceGiorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa. TCS, 429:1-20, 2012. [doi]

k-Calling context profilingGiorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani. OOPSLA 2012: 867-878 [doi]

Real-time analysis of critical nodes in network coresGiorgio Ausiello, Donatella Firmani, Luigi Laura. iwcmc 2012: 42-46 [doi]

Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected componentsGiorgio Ausiello, Donatella Firmani, Luigi Laura. networks, 59(3):275-288, 2012. [doi]

2011

Online Maximum k-CoverageGiorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos. fct 2011: 181-192 [doi]

Real-time anomalies detection and analysis of network structure, with application to the Autonomous System networkGiorgio Ausiello, Donatella Firmani, Luigi Laura. iwcmc 2011: 1575-1579 [doi]

2010

Computing Graph Spanners in Small Memory: Fault-Tolerance and StreamingGiorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano. dmaa, 2(4):591-606, 2010. [doi]

Computing Graph Spanners in Small Memory: Fault-Tolerance and StreamingGiorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini. cocoon 2010: 160-172 [doi]

2009

Greedy Algorithms For On-Line Set-CoveringGiorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos. aor, 4(1):36-48, 2009. [doi]

Reoptimization of minimum and maximum traveling salesman s toursGiorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos. jda, 7(4):453-463, 2009. [doi]

Small stretch (alpha, beta)-spanners in the streaming modelGiorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano. TCS, 410(36):3406-3413, 2009. [doi]

Graph Spanners in the Streaming Model: An Experimental StudyGiorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini. algorithmica, 55(2):346-374, 2009. [doi]

Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected ComponentsGiorgio Ausiello, Donatella Firmani, Luigi Laura. ictcs 2009: 26-29

2008

On the power of lookahead in on-line server routing problemsLuca Allulli, Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura. TCS, 408(2-3):116-128, 2008. [doi]

The online Prize-Collecting Traveling Salesman ProblemGiorgio Ausiello, Vincenzo Bonifaci, Luigi Laura. ipl, 107(6):199-204, 2008. [doi]

The on-line asymmetric traveling salesman problemGiorgio Ausiello, Vincenzo Bonifaci, Luigi Laura. jda, 6(2):290-298, 2008. [doi]

2007

Clairvoyance and Laziness for on Line Travelling AgentsGiorgio Ausiello. ictcs 2007: 3

Small Stretch Spanners in the Streaming Model: New Algorithms and ExperimentsGiorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini. esa 2007: 605-617 [doi]

2006

2005

2004

Algorithms for the On-Line Quota Traveling Salesman ProblemGiorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos. cocoon 2004: 290-299 [doi]

Algorithms for the On-Line Quota Traveling Salesman ProblemGiorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos. ipl, 92(2):89-94, 2004. [doi]

2003

Completeness in Differential Approximation ClassesGiorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos. mfcs 2003: 179-188 [doi]

2002

Selected Papers in honour of Maurice Nivat - EditorialGiorgio Ausiello. TCS, 281(1-2):1, 2002. [doi]

2001

25 YearsGiorgio Ausiello, Donald Sannella, Michael W. Mislove. TCS, 250(1-2), 2001.

Algorithms for the On-Line Travelling SalesmanGiorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo. algorithmica, 29(4):560-581, 2001. [doi]

Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental ApproachGiorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni. ictcs 2001: 312-327 [doi]

2000

Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto PliniusAngela Antonicelli, Giovanni Sciscio, Renato Rosicarelli, Giorgio Ausiello, Tiziana Catarci, Massimo Ferrarini. sebd 2000: 415-427

Algorithm Design ChallengesGiorgio Ausiello. ifipTCS 2000: 602-603 [doi]

On Salesmen, Repairmen, Spiders, and Other Traveling AgentsGiorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela. ciac 2000: 1-16 [doi]

1999

Exploiting Pompei Cultural Heritage: The Plinius ProjectAngela Antonicelli, Giovanni Sciscio, Renato Rosicarelli, Giorgio Ausiello, Tiziana Catarci, Massimo Ferrarini. eurographics 1999: [doi]

Complexity and approximation: combinatorial optimization problems and their approximability propertiesGiorgio Ausiello. Springer, 1999. [doi]

1998

Hypergraph Traversal Revisited: Cost Measures and Dynamic AlgorithmsGiorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni. mfcs 1998: 1-16 [doi]

1997

On-Line Algorithms for Satisfiability Problems with UncertaintyGiorgio Ausiello, Roberto Giaccio. TCS, 171(1-2):3-24, 1997. [doi]

Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn FormulaeGiorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio. isaac 1997: 122-131

1995

Local Search, Reducibility and Approximability of NP-Optimization ProblemsGiorgio Ausiello, Marco Protasi. ipl, 54(2):73-79, 1995. [doi]

Competitive Algorithms for the On-line Traveling SalesmanGiorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo. wads 1995: 206-217

Approximate Solution of NP Optimization ProblemsGiorgio Ausiello, Pierluigi Crescenzi, Marco Protasi. TCS, 150(1):1-55, 1995. [doi]

1994

Serving Requests with On-line RoutingGiorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo. swat 1994: 37-48

1992

On-Line Computation of Minimal and Maximal Length PathsGiorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni. TCS, 95(2):245-261, 1992.

1991

On-Line Algorithms for Polynomially Solvable Satisfiability ProblemsGiorgio Ausiello, Giuseppe F. Italiano. jlp, 10(1/2/3&4):69-90, 1991.

Incremental Algorithms for Minimal Length PathsGiorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni. jal, 12(4):615-638, 1991.

1990

Limiting Polynomial Approximation of Complexity ClassesGiorgio Ausiello, Marco Protasi. ijfcs, 1(2):111-122, 1990.

Dynamic Maintenance of Directed HypergraphsGiorgio Ausiello, Umberto Nanni. TCS, 72(2&3):97-117, 1990.

Incremental Algorithms for Minimal Length PathsGiorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni. soda 1990: 12-21

1988

Directed Hypergraphs: Data Structures and ApplicationsGiorgio Ausiello. caap 1988: 295-303

Special Issue: First International Conference on Database Theory, Rome, September 1986, ForwordGiorgio Ausiello. TCS, 62(1-2):1, 1988.

Dynamic Maintenance of Paths and Path Expressions on GraphsGiorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni. issac 1989: 1-12

1986

Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data ModelsGiorgio Ausiello, Alessandro D Atri, Marina Moscarini. jcss, 33(2):179-202, 1986.

Minimal Representation of Directed HypergraphsGiorgio Ausiello, Alessandro D Atri, Domenico Saccà. SICOMP, 15(2):418-431, 1986.

1985

Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data ModelsGiorgio Ausiello, Alessandro D Atri, Marina Moscarini. PODS 1985: 164-170 [doi]

On the Existence of Acyclic Views in a Database SchemeGiorgio Ausiello, Alessandro D Atri, Marina Moscarini. TCS, 35:165-177, 1985.

1983

Probabilistic Models for Database Schemes and Random HypergraphsGiorgio Ausiello, Marco Protasi, Maurizio Talamo. wg 1984: 5-16

Graph Algorithms for Functional Dependency ManipulationGiorgio Ausiello, Alessandro D Atri, Domenico Saccà. JACM, 30(4):752-766, October 1983. [doi]

1982

Inclusion and Equivalence between Relational Database SchemataPaolo Atzeni, Giorgio Ausiello, Carlo Batini, Marina Moscarini. TCS, 19:267-285, 1982.

Minimal Coverings of Acyclic Database SchemataGiorgio Ausiello, Alessandro D Atri, Marina Moscarini. adbt 1982: 27-51

1981

Lattice theoretic ordering properties for NP-complete optimization problemsGiorgio Ausiello, Alessandro D Atri, Marco Protasi. FUIN, 4(1):83-94, 1981.

Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial ProblemsGiorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi. fct 1981: 24-33

Full Approximatibility of a Class of Problems over Power SetsGiorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi. caap 1981: 76-87

1980

On the Equivalence among Data Base SchemataGiorgio Ausiello, Carlo Batini, Marina Moscarini. icod 1980: 34-46

Conceptual Relations between Databases Transformed under Join and ProjectionGiorgio Ausiello, Carlo Batini, Marina Moscarini. mfcs 1980: 123-136

Graph Algorithms for the Synthesis and Manipulation of Data Base SchemesGiorgio Ausiello, Alessandro D Atri. criwg 1981: 212-233

Structure Preserving Reductions among Convex Optimization ProblemsGiorgio Ausiello, Alessandro D Atri, Marco Protasi. jcss, 21(1):136-153, 1980.

Toward a Unified Approach for the Classification of NP-Complete Optimization ProblemsGiorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi. TCS, 12:83-96, 1980.

Polynomials - The Specification, Analysis and Development of an Abstract Data TypeWalter Dosch, Martin Wirsing, Giorgio Ausiello, Gianfranco Mascari. gi 1980: 306-320

1979

Design of algebraic data structures with the approach of abstract data typesGiorgio Ausiello, Giovanni Mascari. eurosam 1979: 514-530

1977

On the Structure of Combinatorial Problems and Structure Preserving ReductionsGiorgio Ausiello, Alessandro D Atri, Marco Protasi. icalp 1977: 45-60

Classes of Structurally Isomorphic {NP}-Optimization ProblemsGiorgio Ausiello, Alessandro D Atri, Marco Gaudiano, Marco Protasi. mfcs 1977: 222-230

On the Structure and Properties of NP-Complete Problems and Their Associated Optimization ProblemsGiorgio Ausiello. mfcs 1977: 1-16

1976

On the Complexity of Decision Problems for Classes of Simple Programs on StringsGiorgio Ausiello, Marina Moscarini. gi 1976: 148-163

Sign in or sign up to see more results.

runs on WebDSL