A) INTERNATIONAL JOURNALS
A1) G.Ausiello
Abstract computational complexity and cycling computations
Journal of Computer and System Sciences 5, 2, 1971
A2) G.Ausiello
Difficult logical theories and their computer approximations
Journées Algorithmiques, Asterisque 38-39, 1976
A2bis) G.Ausiello, A. Marchetti-Spaccamela, M. Protasi
Combinatorial problems over power sets
Calcolo, XVI, IV, 1979.
A3) G.Ausiello, A. Marchetti-Spaccamela, M. Protasi
Toward a unified approach for the classification of NP-complete optimization problems
Theoretical Computer Science, 12, 1980.
A4) G.Ausiello, A. D'Atri, M. Protasi
Structure preserving reductions among convex optimization problems
Journal of Computer and System Sciences, 21,1, 1980.
A5) G.Ausiello, A. D'Atri, M. Protasi
Lattice theoretic ordering properties of NP-complete optimization problems
Fundamenta Informaticae, IV 1, 1981.
A5bis) G.Ausiello, A. Marchetti-Spaccamela, M. Protasi
Full approximability of a class of problems over power sets
Questio', 5, 1, 1981
A6) P. Atzeni, G.Ausiello, C. Batini, M. Moscarini
Conceptual relations among relational data base schemata
Theoretical Computer Science, 1982.
A7) G.Ausiello, A. D'Atri, D. Sacca'
Graph algorithms for functional dependency manipulation
Journal of ACM, 30 (1983), pp. 752-766.
A8) G.Ausiello, A. D'Atri, M. Moscarini
Minimal coverings of acyclic database schemata
Advances in database theory, Vol. II, Gallaire e MinkerEds., Plenum Press, 1984.
A9) G.Ausiello, A. D'Atri, D. Sacca'
Strongly equivalent directed hypergraphs
Analysis and design of algorithms for combinatorial problems,Annals of Discrete Mathematics, North Holland, 1984.
A10) G.Ausiello, A. D'Atri, M. Moscarini
On the existence of acyclic views in database schemata
Theoretical Computer Science, 35, 1985.
A11) G.Ausiello, A. D'Atri, M.Moscarini
Chordality properties on graphs and minimal conceptual connections in Semantic Data Models
Journal of Computer and System Sciences, 33, 2, 1986.
A12) G.Ausiello, A. D'Atri, D. Sacca'
Minimal representation of directed hypergraphs
SIAM Journal on Computing 15, 2, 1986
A13) G.Ausiello, G.F. Italiano, U. Nanni
Dynamic maintenance of directed hypergraphs
Theoretical Computer Science, 72, 1990
A14) G.Ausiello, G.F. Italiano
On line algorithms for polynomially solvable satisfiability problems
J. of Logic Programming, 7, 1990
A15) G.Ausiello, M. Protasi
Limiting polynomial approximation of complexity classes
Int. J. of Foundations of Computer Science, 1, 2, 1990
A16) G.Ausiello, G.F. Italiano, A. Marchetti Spaccamela, U. Nanni
Incremental algorithms for minimal length paths
J. of Algorithms, 12, 615-638, 1991
A17) G.Ausiello, G.F.Italiano A.Marchetti Spaccamela, U. Nanni
On line computation of minimal and maximal length paths,
Theoretical Computer Science, 95, 245-261, 1992
A18) G.Ausiello, P.L. Crescenzi, M. Protasi
Approximate solution of NP optimization problems,
Theoretical Computer Science, 150 (1995) 1-55
A19) G.Ausiello, M. Protasi
Local search, reducibility and approximability of NP optimization problems
Information Processing Letters , 54 (1995) 73-79
A20) G.Ausiello, R. Giaccio
On-line algorithms for satisfiabillity problems with uncertainty
Theoretical Computer Science, 171 (1997) 3-24
A21) G.Ausiello, L. Cabibbo
Expressiveness and complexity of formal systems
Functional Models of Cognition, A. Carsetti Ed., Kluwer, (1999)
A22) G.Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo
Algorithms for the on-line traveling salesman
Algorithmica, 29, (2001) 560-581
A23) G.Ausiello, P.G. Franciosa, D. Frigioni
Partially dynamic maintenance of minimum weight hyperpaths
Journal of Discrete Algorithms, 3, 1,(2005) pp. 27-46.
A24) G. Ausiello, M. Demange, L. Laura, V. Paschos,
Algorithms for the on-line quota traveling salesman problem,
Information Processing Letters, Vol 92/2 (2005) pp 89-94
A25) G.Ausiello, C. Bazgan, M. Demange, V. Paschos
Completeness in differential approximation classes
International Journal of Foundations of Computer Science, 16, 6 (2005) pp. 1267-1295.
A26) G.Ausiello, V. Paschos
Reductions, completeness and the hardness of approximability
European Journal of Operations Research, 172 (2006) pp. 719-739.
A27) G.Ausiello, P.G. Franciosa, G.F. Italiano
Small stretch spanners in dynamic graphs
Journal of Graph Algorithms and Applications 10. 2 (2006) pp. 365-385.
A28) G.Ausiello, V. Bonifaci, L. Laura
On-line algorithms for the Asymmetric Traveling Salesman Problem
Journal of Discrete Algorithms, 6 (2) (2008) pp. 290-298.
A29) G.Ausiello, L. Allulli, V. Bonifaci, L. Laura
On the Power of Lookahead in On-line Server Routing Problems
Special Issue in honour of Franco Preparata, Theoretical Computer Science, 408 (2008) pp. 116-128
A30) G.Ausiello, P.G. Franciosa, G.F. Italiano
Small Stretch (a, b)-Spanners in the Streaming Model
Theoretical Computer Science, Special Issue in Honour of Burkhard Monien 410 (2009) pp. 3406-3413.
A31) G.Ausiello, V. Bonifaci, L. Laura
On-line Prize-Collecting Traveling Salesman Problem
Information Processing Letters, 107 (6), (2008) pp.199-204.
A32) G.Ausiello, C. Demetrescu, P. G. Franciosa, G. F. Italiano, and A. Ribichini
Graph Spanners in the Streaming Model: An Experimental Study
Algorithmica, vol. 55 (2), (2009) pp. 346-374.
A33) G.Ausiello, B. Escoffier, J. Monnot, V. Th. Paschos
Re-optimization of minimum and maximum traveling salesman's tours
Journal of Discrete Algorithms, 7 (2009), pp. 453-463.
A34) G.Ausiello, N. Bourgeois, A. Giannakos, V. Th. Paschos
Greedy Algorithms for On-Line Set-Covering
Algorithmic Operations Research, 4 (1), (2009) pp. 36-48.


B) INTERNATIONAL CONFERENCES AND CHAPTERS OF BOOKS
B1) G.Ausiello
On bounds on the number of steps to compute functions
Second Annual ACM Symposium on Theory of computing, Northampton, Mass.1970.
B2) G.Ausiello
Parallel Universal Computation
Proceedings of the IV AnnualPrinceton Conference on Information Sciences and Systems, Princeton, N. J.1970.
B3) G.Ausiello
Weaker axioms for abstract computational complexity
ibidem.
B4) G.Ausiello
Complexity bounded universal functions
Conference Record of the International Symposium on the Theory of Machines and computations, Haifa, Israele 1971.
B5) G.Ausiello
Computational complexity: main results and a commentary
in Seminaires IRIA, Theorie des algorithmes, des languages et de la programmation, 1972 anche in "Open House" in Unusual Automata Theory,DAIMI-PB-15, Institute of Mathematics, University of Aarhus 1972.
B6) G.Ausiello
Relations between semantics and complexity of recursive programs
Second colloquium on Automata, Languages and Programming Lecture Notes in Computer Science, 14, Springer Verlag, 1974.
B7) G.Ausiello
On the description of time varying systems in lambda -calculus
Symposium on lambda - calculus and Computer Science Theory, Lecture Notes in Computer Science, 37, Springer Verlag 1975.
B8) G.Ausiello, M. Protasi
On the comparison of different notions of approximation
Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, 32, Springer Verlag 1975.
B9) G.Ausiello, M. Moscarini
On the complexity of decision problems for classes of simple programs on strings
6 GI, Informatik Fachberichte, 5,Springer Verlag 1976.
B10) G.Ausiello, A. D'Atri, M. Protasi
On structure preserving reductions among combinatorial problems
Fourth Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 52, Springer Verlag1977.
B11) G.Ausiello, A. D'Atri, M. Gaudiano, M. Protasi
Classes of structurally isomorphic NP-complete optimization problems
Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, 53,Springer Verlag 1977.
B12) G.Ausiello
On the structure and properties of NP-complete problems
(Invited paper) ibidem.
B13) G.Ausiello, G.F. Mascari
On the design of algebraic data structures with the approach of abstract data types
Proceeedingg 1979 European Symposiumand Algebraic Manipulation, Lecture Notes in Computer Science 72, SpringerVerlag, 1979.
B14) G.Ausiello, A. D'Atri, D. Sacca'
Graph algorithms for the synthesis and manipulation of data base schemes
Graph theoretic Concepts in Computer Science, Lecture Notes in Computer Science, 100, 1980.
B15) G.Ausiello, W, Dosch, G.F. Mascari, M. Wirsing
Polynomials. The specification analysis and development of an abstract data type
10 Jahrestagung der GI, Saarbrucken, 1980
B16) G.Ausiello, C. Batini, M. Moscarini
On the equivalence among database schemata
International Conference on Data Bases, Aberdeen, 1980.
B17) G.Ausiello, C. Batini, M. Moscarini
Computational relations between databases transformed under join and projection
Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 88, 1980.
B18) G.Ausiello, A. Marchetti-Spaccamela, M. Protasi
Full approximability of a class of problems over power sets
6th Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science112, 1981.
B19) G.Ausiello, A. Marchetti-Spaccamela, M. Protasi
Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems
Fundamentals of Computation Theory, Lecture Notesin Computer Science 117, 1981.
B20) G.Ausiello, A. Marchetti-Spaccamela, M. Protasi
Probabilistic analysis of the solution of the knapsack problem
IFIP Conference on Optimization, New York 1981.
B21) G.Ausiello, M. Protasi, M. Talamo
Probabilistic models for database schemata and random hypergraphs
Proceedings of the Workshop on Graph theoretic Concepts in Computer Science, Nagel Ed., Traumer Verlag,1983.
B21bis) G.Ausiello, A. D'Atri, M. Moscarini
Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models
ACM PODS 1985: 164-170.
B22) G.Ausiello, A. Marchetti Spaccamela, U.Nanni
Dynamic maintenance of paths and path expressions on graphs
(Invited paper) Joint Conference ISSAC-88 AAECC-6, 1988.
B23) G.Ausiello
Directed hypergraphs: Data structures and applications
(Invited paper) CAAP 88, Lecture Notes in Computer Science 299, 1988
B24) G.Ausiello
Data structures and algorithms
in Software Engineering Reference Book, J. Mc Dermid Ed., Butterworth-Heinemann, 1991
B25) G.Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo
Serving requests with on-line routing
4th Scandinavian Workshop on AlgorithmTheory, Lecture Notes in Computer Science 824, 37-48, 1994
B26) G.Ausiello, M. Protasi
NP Optimization Problems and Local Optima Graph Theory,
Combinatorics and Applications: Proc. of the Seventh Quadr.Int. Conf. on the Theory and Applications of Graphs, 2nd Vol., Y.Alavi andA. Schwenk Eds., 957-975, Wiley and Sons, Inc. 1995
B27) G.Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo
Competitive algorithms for the on-line traveling salesman
Proceedings of 4th WADS, Lecture Notes in Computer Science 955, 1995
B28) G.Ausiello, P.G. Franciosa, D. Frigioni, R. Giaccio
Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae Eight International
Symposium on Algorithms and Computation(ISAAC '97), Lecture Notes in Computer Science 1350, 122-131, 1997
B29) G.Ausiello, G.F. Italiano, U. Nanni
Hypergraph traversal revisited:Cost measures and dynamic algorithms
(Invited paper) Mathematical Foundations of Computer Science 1998, Lecture Notes in Computer Science1450, 1-16, 1998
B30) G.Ausiello, S. Leonardi, A. Marchetti Spaccamela,
On salesmen repairmen, spiders and other traveling agents,
CIAC 2000, Lecture Notes in Computer Science 1767, 1-16, Springer 2000
B31) G.Ausiello,
Algorithm design challenges,
TCS 2000, Lecture Notes in Computer Science 1872, 602-3, Springer 2000
B32) G. Ausiello, P.G. Franciosa, D. Frigioni,
Directed hypergraphs: Problems, algorithmic results, and a novel decremental algorithm,
ICTCS 2001, Lecture Notes in Computer Science 2202, 312-327, Springer 2001
B33) Ausiello G., C. Bazgan, M. Demange, V. Th. Paschos,
Completeness in differential approximation classes,
B. Rovan and P. Vojtas Eds., Mathematical Foundations of Computer Science (2003), Bratislava, Slovakia, Lecture Notes in Computer Science, Springer, (2003)
B34) G. Ausiello, V. Bonifaci, L., Laura,
On explorers, chasers, and cameramen,
Proc. of Int. Conf. Fun with Algorithms, 2004
B35) G.Ausiello, M. Demange, L. Laura, V. Th. Paschos
Algorithms for the on-line quota traveling salesman problem
COCOON 2004, LNCS 3106, pp290-299, Springer 2004
B36) G.Ausiello, V. Th. Paschos
Réductions préservant l'approximation, in Optimisation combinatoire
59-90, Hermes Science, 2005
B37) G.Ausiello, L. Becchetti
Algorithmes on-line, in Optimisation combinatoire
249-286, Hermes Science, 2005
B38) L. Allulli, G.Ausiello, L. Laura
On the Power of Lookahead in On-line Vehicle Routing Problems
COCOON 2005, LNCS 3595, 2005
B39) G.Ausiello, V. Bonifaci, L. Laura
On-line algorithms for the Asymmetric Traveling Salesman Problem
WADS 2005, LNCS 3608, 2005
B40) G.Ausiello, P.G.Franciosa, G.F.Italiano
Small stretch spanners on dynamic graphs
ESA 2005, LNCS 3669, 2005
B41) G.Ausiello, L. Laura
Algorithmic Research for the 21st Century (Position Paper)
Collection of the Papers of Shanghai Forum 2005, Fudan University, 2005
B42) G.Ausiello, A. Giannakos, V. Th. Paschos
Greedy algorithms for the on line set covering and other problems
CATS 2006, CRPIT 51, pp 145-151, 2006
B43) L. Allulli, G.Ausiello, V. Bonifaci, L. Laura
On line algorithms, real time, the virtue of laziness, and the power of clairvoyance
TAMC 2006, LNCS 3959, 2006
B44) G.Ausiello, B. Escoffier, J. Monnot, V. Th. Paschos
Reoptimization of minimum and maximum traveling salesman's tours
SWAT 2006, LNCS 4059, pp. 196-207, 2006
B45) G.Ausiello, V. Paschos
Reductions that preserve approximability
Handbook on Approximation Algorithms and Metaheuristics, Gonzales Ed., 2007
B46) G.Ausiello, V. Paschos
Differential ratio approximation
Handbook on Approximation Algorithms and Metaheuristics, Gonzales Ed., 2007
B47) G.Ausiello, V. Bonifaci, S. Leonardi, A. Marchetti-Spaccamela
Prize collecting traveling salesman and related problems
Handbook on Approximation Algorithms and Metaheuristics, Gonzales Ed., 2007
B48) G.Ausiello, C. Demetrescu, P.G.Franciosa, G.F.Italiano, A. Ribichini
Small stretch spanners in the streaming model: New algorithms and experiments
ESA 2007, LNCS 4698, pp. 605-617, 2007
B49) G.Ausiello, V. Bonifaci, B. Escoffier
Complexity and Approximation in Reoptimization
in Computability in Context: Computation and Logic in the Real World, B. Cooper, A. Sorbi Eds., Imperial College Press/World Scientific (to appear 2010)


C) NATIONAL JOURNALS
C1) G.Ausiello
Teorie della complessita' di calcolo
Calcolo,Luglio-Dicembre 1970.
C2) G.Ausiello
A. Miola Una introduzione alla manipolazione algebrica
Calcolo, Ottobre-Dicembre 1971.
C3) G.Ausiello, A. Marchetti-Spaccamela, M. Protasi
Combinatorial problems over power sets
Calcolo, XVI, IV, 1979.
C4) G.Ausiello
Complessita' di Calcolo,
in Enciclopedia delle Scienze Fisiche, UTET, 1986
C5) G.Ausiello,
L. Cabibbo, Expressiveness and complexity of formal systems, in Modelli della Cognizione e Teoria della Complessita',
La Nuova Critica, 31-32, Union Printing, 1998
C6) G.Ausiello,
Scienze dell'Informazione,
in Enciclopedia Italiana, Appendice 2000, Istituto dell'Enciclopedia Italiana, 2000
C7) G.Ausiello, T. Catarci, A. Rizzo, G. Santucci
Una base di dati multimediale per la gestione di dati di interesse archeologico, in Comunicazione Multimediale per i Beni Culturali
a cura di M. Rossi e P. Salonia, Addison Wesley Italia, 2005
C8) G.Ausiello
Informatica Teorica
in Enciclopedia della Scienza e della Tecnologia, Istituto dell'Enciclopedia Italiana, 2007


D) NATIONAL CONFERENCES
D1) G.Ausiello, C. Böhm
Applicazione del linguaggio CUCH alla programmazione di macchine analogiche sequenziali
Atti del IX Convegno dell'Automazione e Strumentazione, FAST 1966.
D2) G.Ausiello
Automatic reduction of CUCH expressions by means of the value method
Atti del II Congresso AICA, Napoli 1968
D3) G.Ausiello
Analisi degli algoritmi e complessita' delle funzioni
Atti del Convegno AICA di Informatica Teorica, Pisa 1973.
D4) G.Ausiello, M. Moscarini
Risoluzione di relazioni di ricorrenza, complessita' della soluzione in forma chiusa
Convegno di InformaticaTeorica, Mantova 1974.
D5) G.Ausiello, A. D'Atri, D. Sacca'
Minimal representations of directedhypergraphs and their application to database design
Proceedings of theSchool on "Algorithm design for computer system design", CISM, Springer,1984.
D6) G.Ausiello, P. Bertolazzi
Parallel computer models. An introduction
ibidem.
D7) G.Ausiello
Complexity of exact and approximate solution of problems. An introduction
ibidem.
D8) G.Ausiello
Informatica Giuridica e tecnica legislativa,
in Atti del Convegno su Applicazione e tecnica legislativa, a cura di E. Pattaro e F. Zannotti, Bologna, 1998
D9) A. Antonicelli, G. Sciscio, R. Rosicarelli, G.Ausiello, T. Catarci, M. Ferrarini
Sistemi Multimediali per la Valorizzazione del Patrimonio Culturale: il Progetto Plinius,
Atti del Congresso SEBD'00 (Sistemi Evoluti per Basi di Dati) , L'Aquila, Giugno 2000.


E) BOOKS
E1) G.Ausiello
Teoria degli algoritmi e della calcolabilita'
Ed. Siderea, 1974.
E2) G.Ausiello
Complessita' di calcolo delle funzioni
Ed. Boringhieri , 1975.
E3) G.Ausiello, A. Marchetti-Spaccamela, M.Protasi
Teoria e progetto di algoritmi fondamentali
Ed. F. Angeli, 1985.
E4) G.Ausiello, M. Talamo
Strutture per la gestione statica e dinamica dei dati
Serie CRAI, F. Angeli, 1987.
E5) G.Ausiello, M. Protasi
Fondamenti di Informatica
Ed. CUD, 1987.
E6) G.Ausiello, C. Batini, D. Mandrioli, M. Protasi
Linguaggi e modelli dell'informatica
Mc Graw Hill Italia, 1991
E7) G.Ausiello, M. Talamo
Fondamenti di Informatica II
Ed. CUD, 1994.
E8) G.Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti Spaccamela, M. Protasi
Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties
Springer, 1999
E9) G.Ausiello, F. d'Amore, G. Gambosi
Linguaggi, modelli, complessità
F. Angeli, 2003


F) VOLUMES EDITED
F1) G.Ausiello, C. Böhm
Automata, Languages and Programming
Proceedings of the 5th International Colloquium, Lecture Notes in Computer Science, Vol.62, Springer Verlag, 1978.
F2) G.Ausiello, M. Lucertini
Analysis and Design of Algorithms in Combinatorial Optimization
CISM 266, Springer Verlag, 1981.
F3) G.Ausiello, M. Protasi
Proceedings of 8th International Colloquium on Trees in Algebra and Programming Lecture Notes in Computer Science,
Vol.59, Springer Verlag, 1983.
F4) G.Ausiello, M. Lucertini
Algorithm Design for Computer System Design
CISM 284, Springer Verlag, 1984.
F5) G.Ausiello, M. Lucertini
Analysis and Design of Algorithms for combinatorial Problems
Annals of Discrete Mathematics, North Holland,1985.
F6) G.Ausiello, P. Atzeni
International Conference on Database Theory
Lecture Notes in Computer Science, Vol. 243, Springer Verlag, 1986.
F7) G.Ausiello
Special issue of Theoretical Computer Science
devoted to the International Colloquium on Database Theory 1987.
F8) G.Ausiello, M. Dezani Ciancaglini, S. Ronchi della Rocca
Automata, Languages and Programming
Proceedings of the 17th International Colloquium, Lecture Notes in Computer Science, Vol. 372, Springer Verlag,1989
F9) G.Ausiello, M. Dezani Ciancaglini
Special issue of Theoretical Computer Science
devoted to ICALP 89
F10) G.Ausiello, D.P. Bovet, R. Petreschi
Algorithms and Complexity
Proceedings of the First Italian Conference on Algorithms and Complexity, World Scientific, 1990
F11) G.Ausiello, G.F. Italiano
Special issue of Theoretical Computer Science
devoted to Dynamic Algorithms, 1994
F12) G.Ausiello, A. Marchetti Spaccamela
Special Issue of Theoretical Computer Science
devoted to WG 96, Vol 203, 1998
F13) G.Ausiello, J. Karhumäki, G. Mauri, L. Ong
Fifth IFIP Conference on Theoretical Computer Science
TCS 2008, Springer, 2008


G) TECHNICAL REPORTS
G1) REPORTS OF THE ISTITUTO PER LE APPLICAZIONI DEL CALCOLO
G1.1) G.Ausiello
Linguaggio di programmazione di macchine analogiche sequenziali
Quaderno n. 10, Pubbl. 695, 1967.
G1.2) G.Ausiello, C. Böhm, H. Moncayo Lopez
Costruzione di un interprete CINAC per il linguaggio LISP (ROMALISP 1
ibidem.
G1.3) G.Ausiello, A. Miola
Costruzione di un garbage collector per l'interprete ROMALISP
Pubbl.s. III, n. 11, 1968.
G1.4) G.Ausiello, C. Böhm, P. Deutsch, A. Miola, H. Moncayo Lopez
Manuale pe ril ROMALISP
Pubbl. s. III, n. 19, 1969.
G1.5) G.Ausiello
Complessita' di calcolo delle funzioni ricorsive
in Seminari di Informatica Teorica, 1973.
G1.6) G.Ausiello
Un linguaggio di programmazione per le funzioni subricorsive
in Seminari di Informatica Teorica, 1974.
G1.7) G.Ausiello
Tipi di dati e strutture di controllo per la manipolazione algebrica
Atti del Seminario di Introduzione alla Manipolazione Simbolica e Algebrica, Roma 1978.
G2) REPORTS OF THE DIPARTIMENTO DI INFORMATICA E SISTEMISTICA (FORMERLY ISTITUTO DI AUTOMATICA) OF THE UNIVERSITY OF ROME 'LA SAPIENZA'
G2.1) G.Ausiello, M. Moscarini
On the complexity of functions defined by recurrence relations,
R. 74-10, 1974.
G2.2) G.Ausiello
Simple Programs on strings and their decision problems
R.75-15, 1975.
G2.3) G.Ausiello
Difficult logical theories and their computer approximations
R. 75-22, 1975.
G2.4) G.Ausiello, A. D'Atri, M. Protasi
A characterization of reductions among combinatorial problems
R. 76-23, 1976.
G2.5) G.Ausiello, A. D'Atri, M. Gaudiano, M. Protasi
Classes of structurally isomorphic NP-Optimization problems
R. 77-08, 1977.
G2.6) G.Ausiello
On the structure and properties of NP-complete problems and their associated optimization problems
R. 77-11, 1977.
G2.7) G.Ausiello, A. D'Atri, M. Protasi
Lattice theoretic ordering properties for NP-complete optimization problems
R. 78-18, 1978.
G2.8) G.Ausiello, A. Marchetti Spaccamela, M. Protasi
Toward a unified approach for the classification of NP-complete optimization problems
R. 79-06,1979.
G2.9) G.Ausiello, C. Batini, M. Moscarini
Comparisons among conceptual content of data bases in the relational model
R. 79-33, 1979.
G2.10) G.Ausiello, A. Marchetti Spaccamela, M. Protasi
Combinatorial problems over power sets
R. 79-43, 1979.
G2.11) G.Ausiello, A. D'Atri, D. Sacca'
Graph algorithms for the synthesis and manipulation of data base schemes
R. 80-24, 1980.
G2.12) P. Atzeni, G.Ausiello, C. Batini, M. Moscarini
Conceptual relations among relational database schemata
R. 80-32, 1980.
G2.13) G.Ausiello, A. D'Atri, D. Sacca'
Graph algorithms for functional dependencies manipulation
R. 81-09, 1981.
G2.14) G.Ausiello, A. D'Atri, D. Sacca'
Minimal representations of directed hypergraphs
R. 83-02, 1983.
G2.15) G.Ausiello, A. D'Atri, D. Sacca'
Strongly equivalent directed hypergraphs
Rap. 06-83, 1983.
G2.16) G.Ausiello, G.F. Italiano
On line computation of minimal and maximal length paths
Rap. 02-87, 1987.
G2.17) G.Ausiello, G.F. Italiano
On line algorithms for polynomially solvable satisfiability problems
Rap. 12-87,1987.
G2.18) G.Ausiello, G.F. Italiano,
U. Nanni Dynamic maintenance of directed hypergraphs
Rap. 15-88, 1988.
G3) REPORTS OF THE ISTITUTO DI ANALISI DEI SISTEMI ED INFORMATICA OFTHE NATIONAL RESEARCH COUNCIL
G3.1) G.Ausiello, A. Marchetti Spaccamela, M. Protasi
Full approximability of a class of problems over power sets
R. 4, 1981.
G3.2) G.Ausiello, A. Marchetti-Spaccamela, M. Protasi
Probabilistic Analysis of the performance of Greedy strategies over some combinatorial problems
R.21, 1981.
G3.3) G.Ausiello, A. D'Atri, M. Moscarini
Minimal coverings of acyclic database schemata
R. 41, 1982.
G3.4) G.Ausiello, A. D'Atri, M. Moscarini
Optimal acyclic coverings over hypergraphs
R. 87, 1984.
G3.5) G.Ausiello, A. D'Atri, M. Moscarini
Chordality properties on graphs and minimal conceptual connections in semantic data models
R. 123, 1985.
G3.6) G.Ausiello, G. Gambosi
Pictorial database systems: A survey
R. 212, 1988.
G4) OTHER TECHNICAL REPORTS
G4.1) G.Ausiello, M. Protasi, M. Angelaccio
A characterization of space complexity classes and subexponential time classes as limiting polynomially decidable sets
International Computer Science Institute, TR-91-046,Berkeley 1991
G4.2) G.Ausiello, M. Protasi
NP Optimization problems and local optima
ESPRIT Basic Research Action ALCOM II, 1992
G4.3) G.Ausiello, G. F. Italiano,
U. Nanni Optimal traversal of directed hypergraphs
ESPRIT Basic Researech Action ALCOM II, 1992
G4.4) G.Ausiello, E. Nardelli
Sistemi multimediali. Tecnologia, ricerca,applicazioni
Rapp. EUR 15172, 1993
G4.5) G.Ausiello, P.G.Franciosa, G.F. Italiano,
Fully dynamic maintenance of t-spanners on general graphs,
ALCOMFT-TR-03-23, September 2003
G4.6) G. Ausiello, V. Th. Paschos,
Réductions préservant l'approximation, in Optimisation combinatoire,
Hermes, to appear
G4.7) G. Ausiello, L. Becchetti,
Algorithmes on-line, in Optimisation combinatoire,
Hermes, to appear