9. COCOON 2003:
Big Sky, MT, USA
Tandy J. Warnow,
Binhai Zhu:
Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings. Lecture Notes in Computer Science 2697,
Springer 2003, ISBN
3-540-40534-8
Anne Bergeron,
Jens Stoye:
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. 68-79
Computational/Complexity Theory I
Xizhong Zheng:
On the Divergence Bounded Computable Real Numbers. 102-111 Hanno Lefmann:
Sparse Parity-Check Matrices over Finite Fields (Extended Abstract). 112-121
Graph Theory/Algorithms I
Automata/Petri Net Theory
Graph Theory/Algorithms II
Jin-yi Cai,
Osamu Watanabe:
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results. 202-211 Martin Kutz:
The Complexity of Boolean Matrix Root Computation. 212-221
Graph Theory/Algorithms III
Computational Geometry II
Graph Theory/Algorithms IV
Computational Geometry III
Ashim Garg,
Adrian Rusu:
Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees. 475-486
Ronald I. Greenberg:
Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences: (Extended Abstract). 528-536
Fixed-Parameter Complexity Theory
Stefan Szeider:
Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. 548-558
maintained by

, founded at
