19. STACS 2002:
Antibes Juan-les-Pins,
France
Helmut Alt, Afonso Ferreira (Eds.):
STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings.
Lecture Notes in Computer Science 2285 Springer 2002, ISBN 3-540-43283-3 BibTeX
@proceedings{DBLP:conf/stacs/2002,
editor = {Helmut Alt and
Afonso Ferreira},
title = {STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer
Science, Antibes - Juan les Pins, France, March 14-16, 2002,
Proceedings},
booktitle = {STACS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2285},
year = {2002},
isbn = {3-540-43283-3},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Papers
Algorithms
- Pierre Fraigniaud, Cyril Gavoille:
A Space Lower Bound for Routing in Trees.
65-75
Electronic Edition (Springer LINK) BibTeX
- Amos Korman, David Peleg, Yoav Rodeh:
Labeling Schemes for Dynamic Tree Networks.
76-87
Electronic Edition (Springer LINK) BibTeX
- Micah Adler, Adi Rosén:
Tight Bounds for the Performance of Longest-in-System on DAGs.
88-99
Electronic Edition (Springer LINK) BibTeX
- Klaus Jansen:
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling.
100-111
Electronic Edition (Springer LINK) BibTeX
- Benjamin Doerr:
Balanced Coloring: Equally Easy for All Numbers of Colors?
112-120
Electronic Edition (Springer LINK) BibTeX
- Johannes Köbler, Jacobo Torán:
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3.
121-132
Electronic Edition (Springer LINK) BibTeX
- Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.
133-141
Electronic Edition (Springer LINK) BibTeX
- Khaled M. Elbassioni:
On Dualization in Products of Forests.
142-153
Electronic Edition (Springer LINK) BibTeX
- Renaud Lepère, Christophe Rapine:
An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs.
154-165
Electronic Edition (Springer LINK) BibTeX
- Hannah Bast:
Scheduling at Twilight the Easy Way.
166-178
Electronic Edition (Springer LINK) BibTeX
- Alain Darte, Guillaume Huard:
Complexity of Multi-dimensional Loop Alignment.
179-191
Electronic Edition (Springer LINK) BibTeX
- Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe:
A Probabilistic 3-SAT Algorithm Further Improved.
192-202
Electronic Edition (Springer LINK) BibTeX
- Ulf Lorenz, Burkhard Monien:
The Secret of Selective Game Tree Search, When Using Random-Error Evaluations.
203-214
Electronic Edition (Springer LINK) BibTeX
- Victor Y. Pan:
Randomized Acceleration of Fundamental Matrix Computations.
215-226
Electronic Edition (Springer LINK) BibTeX
- L. Sunil Chandran, L. Shankar Ram:
Approximations for ATSP with Parametrized Triangle Inequality.
227-237
Electronic Edition (Springer LINK) BibTeX
- Joachim Giesen, Matthias John:
A New Diagram from Disks in the Plane.
238-249
Electronic Edition (Springer LINK) BibTeX
- Stefan Langerman, Pat Morin, Michael A. Soss:
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles.
250-261
Electronic Edition (Springer LINK) BibTeX
Current Challenges
Computational and Structural Complexity
Automata and Formal Languages
Logic in Computer Science
Copyright © Sat May 16 23:43:06 2009
by Michael Ley (ley@uni-trier.de)
