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.
Lecture Notes in Computer Science 1203 Springer 1997, ISBN 3-540-62592-5 BibTeX
@proceedings{DBLP:conf/ciac/1997,
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Algorithms and Complexity, Third Italian Conference, CIAC '97,
Rome, Italy, March 12-14, 1997, Proceedings},
booktitle = {CIAC},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1203},
year = {1997},
isbn = {3-540-62592-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Presentations
Regular Presentations
- Yefim Dinitz, Zeev Nutov:
Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5.
13-24 BibTeX
- Klaus Jansen:
The Optimum Cost Chromatic Partition Problem.
25-36 BibTeX
- Samir Khuller, Robert Pless, Yoram J. Sussmann:
Fault Tolerant K-Center Problems.
37-48 BibTeX
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness.
49-60 BibTeX
- Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino:
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy.
61-73 BibTeX
- Uriel Feige, Giora Rayzman:
On the Drift of Short Schedules.
74-85 BibTeX
- Francisco Gómez, Suneeta Ramaswami, Godfried T. Toussaint:
On Removing Non-degeneracy Assumptions in Computational Geometry.
86-99 BibTeX
- Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo:
Maintaining Maxima under Boundary Updates.
100-109 BibTeX
- Amitava Datta, Kamala Krithivasan, Thomas Ottmann:
An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons.
110-121 BibTeX
- Ulrich Fößmeier, Michael Kaufmann:
Nice Drawings for Planar Bipartite Graphs.
122-134 BibTeX
- Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis, Paola Vocca:
Area Requirement of Gabriel Drawings.
135-146 BibTeX
- Fabrizio Luccio, Alberto Pedrotti:
Design of Reliable Combinatorial Algorithms Using Certificates.
147-158 BibTeX
- Amihood Amir, Emanuel Dar:
An Improved Deterministic Algorithms for Generalized Random Sampling.
159-170 BibTeX
- Carlos Domingo:
Polynominal Time Algorithms for Some Self-Duality Problems.
171-180 BibTeX
- Paolo Ferragina, Roberto Grossi, Manuela Montangero:
A Note on Updating Suffix Tree Labels.
181-192 BibTeX
- Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen:
Relaxed Balanced Red-Black Trees.
193-204 BibTeX
- Peter Damaschke:
The Algorithmic Complexity of Chemical Threshold Testing.
205-216 BibTeX
- Jyrki Katajainen, Jesper Larsson Träff:
A Meticulous Analysis of Mergesort Programs.
217-228 BibTeX
- Jop F. Sibeyn, Michael Kaufmann:
BSP-Like External-Memory Computation.
229-240 BibTeX
- Gianpiero Cattaneo, Michele Finelli, Luciano Margara:
Topological Chaos for Elementary Cellular Automata.
241-252 BibTeX
- Anna Bernasconi:
On the Complexity of Balanced Boolean Functions.
253-263 BibTeX
- Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung:
On Sets with Easy Certificates and the Existence of One-Way Permutations.
264-275 BibTeX
- Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width.
276-287 BibTeX
- Paola Alimonti, Viggo Kann:
Hardness of Approximating Problems on Cubic Graphs.
288-298 BibTeX
- Ming-Yang Kao:
Tree Contractions and Evolutionary Trees.
299-310 BibTeX
Copyright © Sat May 16 23:01:28 2009
by Michael Ley (ley@uni-trier.de)