12. ISAAC 2001:
Christchurch, New Zealand
: Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages.
Combinatorial Generation and Optimization (I)
, Hiroshi Nagamochi
: A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.
Parallel and Distributed Algorithms (I)
Graph Drawing and Algorithms (I)
: Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number.
Computational Geometry (I)
Computational Complexity and Cryptology
Automata and Formal Languages
: A New Recognition Algorithm for Extended Regular Expressions.
: Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata.
Graph Drawing and Algorithms (II)
Combinatorial Generation and Optimization (II)
: A Fast Algorithm for Enumerating Bipartite Perfect Matchings.
Computational Biology and String Matching (I)
Computational Geometry (II)
Graph Drawing and Algorithms (III)
Parallel and Distributed Algorithms (II)
: Delay Optimizations in Quorum Consensus.
Computational Geometry (III)
, Takeshi Tokuyama
: How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy.
Randomized and Approximation Algorithms
Computational Biology and String Matching (II)
Algorithms and Data Structures