The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Giorgio Ausiello: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paolo Atzeni, Giorgio Ausiello, Carlo Batini, Marina Moscarini
    Inclusion and Equivalence between Relational Database Schemata. [Citation Graph (15, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:267-285 [Journal]
  2. Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà
    Graph Algorithms for Functional Dependency Manipulation [Citation Graph (5, 0)][DBLP]
    J. ACM, 1983, v:30, n:4, pp:752-766 [Journal]
  3. Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
    Minimal Coverings of Acyclic Database Schemata. [Citation Graph (3, 0)][DBLP]
    Advances in Data Base Theory, 1982, pp:27-51 [Conf]
  4. Giorgio Ausiello, Carlo Batini, Marina Moscarini
    Conceptual Relations between Databases Transformed under Join and Projection. [Citation Graph (3, 0)][DBLP]
    MFCS, 1980, pp:123-136 [Conf]
  5. Giorgio Ausiello, Carlo Batini, Marina Moscarini
    On the Equivalence among Data Base Schemata. [Citation Graph (1, 0)][DBLP]
    ICOD, 1980, pp:34-46 [Conf]
  6. Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
    Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. [Citation Graph (1, 8)][DBLP]
    PODS, 1985, pp:164-170 [Conf]
  7. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    Incremental Algorithms for Minimal Length Paths. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:615-638 [Journal]
  8. Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
    Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:2, pp:179-202 [Journal]
  9. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    On-Line Computation of Minimal and Maximal Length Paths. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:95, n:2, pp:245-261 [Journal]
  10. Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
    On the Existence of Acyclic Views in a Database Scheme. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:165-177 [Journal]
  11. Giorgio Ausiello
    Directed Hypergraphs: Data Structures and Applications. [Citation Graph (0, 0)][DBLP]
    CAAP, 1988, pp:295-303 [Conf]
  12. Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
    Full Approximatibility of a Class of Problems over Power Sets. [Citation Graph (0, 0)][DBLP]
    CAAP, 1981, pp:76-87 [Conf]
  13. Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela
    On Salesmen, Repairmen, Spiders, and Other Traveling Agents. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:1-16 [Conf]
  14. Luca Allulli, Giorgio Ausiello, Luigi Laura
    On the Power of Lookahead in On-Line Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:728-736 [Conf]
  15. Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
    Algorithms for the On-Line Quota Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:290-299 [Conf]
  16. Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
    Small Stretch Spanners on Dynamic Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:532-543 [Conf]
  17. Giorgio Ausiello, Giovanni Mascari
    Design of algebraic data structures with the approach of abstract data types. [Citation Graph (0, 0)][DBLP]
    EUROSAM, 1979, pp:514-530 [Conf]
  18. Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
    Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:24-33 [Conf]
  19. Giorgio Ausiello, Marina Moscarini
    On the Complexity of Decision Problems for Classes of Simple Programs on Strings. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1976, pp:148-163 [Conf]
  20. Walter Dosch, Martin Wirsing, Giorgio Ausiello, Gianfranco Mascari
    Polynomials - The Specification, Analysis and Development of an Abstract Data Type. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1980, pp:306-320 [Conf]
  21. Giorgio Ausiello
    Relations between Semantics and Complexity of Recursive Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:129-140 [Conf]
  22. Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
    On the Structure of Combinatorial Problems and Structure Preserving Reductions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:45-60 [Conf]
  23. Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni
    Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:312-327 [Conf]
  24. Giorgio Ausiello
    Algorithm Design Challenges. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:602-603 [Conf]
  25. Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
    Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:122-131 [Conf]
  26. Giorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni
    Dynamic Maintenance of Paths and Path Expressions on Graphs. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1988, pp:1-12 [Conf]
  27. Giorgio Ausiello
    On the description of time varying systems in lambda - calculus. [Citation Graph (0, 0)][DBLP]
    Lambda-Calculus and Computer Science Theory, 1975, pp:177-191 [Conf]
  28. Giorgio Ausiello
    On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:1-16 [Conf]
  29. Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
    Completeness in Differential Approximation Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:179-188 [Conf]
  30. Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi
    Classes of Structurally Isomorphic {NP}-Optimization Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:222-230 [Conf]
  31. Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
    Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:1-16 [Conf]
  32. Giorgio Ausiello, Marco Protasi
    On the Comparison of Notions of Approximation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:172-178 [Conf]
  33. Angela Antonicelli, Giovanni Sciscio, Renato Rosicarelli, Giorgio Ausiello, Tiziana Catarci, Massimo Ferrarini
    Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto Plinius. [Citation Graph (0, 0)][DBLP]
    SEBD, 2000, pp:415-427 [Conf]
  34. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    Incremental Algorithms for Minimal Length Paths. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:12-21 [Conf]
  35. Giorgio Ausiello
    On Bounds on the Number of Steps to Compute Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1970, pp:41-47 [Conf]
  36. Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
    Reoptimization of Minimum and Maximum Traveling Salesman's Tours. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:196-207 [Conf]
  37. Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
    Serving Requests with On-line Routing. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:37-48 [Conf]
  38. Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci, Luigi Laura
    On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:1-20 [Conf]
  39. Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
    The On-line Asymmetric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:306-317 [Conf]
  40. Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
    Competitive Algorithms for the On-line Traveling Salesman. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:206-217 [Conf]
  41. Giorgio Ausiello, Alessandro D'Atri
    Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes. [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:212-233 [Conf]
  42. Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
    Algorithms for the On-Line Travelling Salesman. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:560-581 [Journal]
  43. Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
    Lattice theoretic ordering properties for NP-complete optimization problems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:1, pp:83-94 [Journal]
  44. Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
    Completeness in differential approximation classes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1267-1295 [Journal]
  45. Giorgio Ausiello, Marco Protasi
    Limiting Polynomial Approximation of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:2, pp:111-122 [Journal]
  46. Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
    Algorithms for the On-Line Quota Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:89-94 [Journal]
  47. Giorgio Ausiello, Marco Protasi
    Local Search, Reducibility and Approximability of NP-Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:2, pp:73-79 [Journal]
  48. Giorgio Ausiello
    Abstract Computational Complexity and Cycling Computations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1971, v:5, n:2, pp:118-128 [Journal]
  49. Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
    Structure Preserving Reductions among Convex Optimization Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:1, pp:136-153 [Journal]
  50. Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni
    Partially dynamic maintenance of minimum weight hyperpaths. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:27-46 [Journal]
  51. Giorgio Ausiello, Giuseppe F. Italiano
    On-Line Algorithms for Polynomially Solvable Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1991, v:10, n:1/2/3&4, pp:69-90 [Journal]
  52. Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà
    Minimal Representation of Directed Hypergraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:418-431 [Journal]
  53. Giorgio Ausiello
    Selected Papers in honour of Maurice Nivat - Editorial. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:1- [Journal]
  54. Giorgio Ausiello
    Special Issue: First International Conference on Database Theory, Rome, September 1986, Forword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:62, n:1-2, pp:1- [Journal]
  55. Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi
    Approximate Solution of NP Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:150, n:1, pp:1-55 [Journal]
  56. Giorgio Ausiello, Roberto Giaccio
    On-Line Algorithms for Satisfiability Problems with Uncertainty. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:171, n:1-2, pp:3-24 [Journal]
  57. Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
    Toward a Unified Approach for the Classification of NP-Complete Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:83-96 [Journal]
  58. Giorgio Ausiello, Umberto Nanni
    Dynamic Maintenance of Directed Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:72, n:2&3, pp:97-117 [Journal]
  59. Giorgio Ausiello, Donald Sannella, Michael W. Mislove
    25 Years. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:- [Journal]
  60. Giorgio Ausiello, Vangelis Th. Paschos
    Reductions, completeness and the hardness of approximability. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:172, n:3, pp:719-739 [Journal]
  61. Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
    Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:605-617 [Conf]

  62. Greedy algorithms for on-line set-covering and related problems. [Citation Graph (, )][DBLP]


  63. Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. [Citation Graph (, )][DBLP]


  64. Clairvoyance and Laziness for on Line Travelling Agents. [Citation Graph (, )][DBLP]


  65. Graph Spanners in the Streaming Model: An Experimental Study. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002