14. ISAAC 2003:
Kyoto, Japan Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono (Eds.):
Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings.
Lecture Notes in Computer Science 2906 Springer 2003, ISBN 3-540-20695-7
Computational Complexity I
Graph and Combinatorial Algorithms I
Computational Complexity II
Graph and Combinatorial Algorithms II
- Gabriel Valiente:
A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs.
- Hiroshi Nagamochi, Kohei Okada:
Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem.
- Jianer Chen, Iyad A. Kanj, Ge Xia:
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.
- Hiroaki Yamamoto:
A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem.
Graph and Combinatorial Algorithms III
Computational Geometry II
Combinatorial Optimization I
Computational Geometry III
Graph and Computational Algorithms IV
Distributed and Parallel Algorithms
Graph and Computational Algorithms V
Graph and Computational Algorithms VI
Combinatorical and Network Optimization
Computational Complexity and Cryptography
Game Theory and Ramdonized Algorithms
Algebraic and Arithmetic Computation
Last update Fri May 17 19:22:32 2013
CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page