3. CIAC 1997: Rome, Italy
Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista (Eds.): Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings. Springer 1997 Lecture Notes in Computer Science ISBN 3-540-62592-5
Invited Presentations
- Gianfranco Bilardi: Algorithms and Data Structures for Control Dependence and Related Compiler Problems. 1-2
- Guy Even, Shimon Even: Embedding Interconnection Networks in Grids via the Layered Cross Product. 3-12
Regular Presentations
- Yefim Dinitz, Zeev Nutov: Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5. 13-24
- Klaus Jansen: The Optimum Cost Chromatic Partition Problem. 25-36
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. 49-60
- Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino: Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. 61-73
- Francisco Gómez, Suneeta Ramaswami, Godfried T. Toussaint: On Removing Non-degeneracy Assumptions in Computational Geometry. 86-99
- Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo: Maintaining Maxima under Boundary Updates. 100-109
- Amitava Datta, Kamala Krithivasan, Thomas Ottmann: An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons. 110-121
- Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis, Paola Vocca: Area Requirement of Gabriel Drawings. 135-146
- Fabrizio Luccio, Alberto Pedrotti: Design of Reliable Combinatorial Algorithms Using Certificates. 147-158
- Amihood Amir, Emanuel Dar: An Improved Deterministic Algorithms for Generalized Random Sampling. 159-170
- Carlos Domingo: Polynominal Time Algorithms for Some Self-Duality Problems. 171-180
- Peter Damaschke: The Algorithmic Complexity of Chemical Threshold Testing. 205-216
- Gianpiero Cattaneo, Michele Finelli, Luciano Margara: Topological Chaos for Elementary Cellular Automata. 241-252
- Anna Bernasconi: On the Complexity of Balanced Boolean Functions. 253-263
- Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung: On Sets with Easy Certificates and the Existence of One-Way Permutations. 264-275
- Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos: Isomorphism for Graphs of Bounded Distance Width. 276-287
- Ming-Yang Kao: Tree Contractions and Evolutionary Trees. 299-310
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team