Computing and Combinatorics

This book constitutes the refereed proceedings of the 10th Annual International Computing and Combinatorics Conference, COCOON 2004, held in Jeju Island, Korea, in August 2004. The 46 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 109 submissions. The papers are organized in topical sections on data structures and algorithms, computational geometry, games and combinatorics, combinatorial optimization, graph algorithms, automata and learning theory, scheduling, graph drawing, complexity theory, parallel and distributed architectures, and computational biology.

Invited Presentations.- External Geometric Data Structures.- The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems.- Robust Geometric Computation Based on Digital Topology.- Data Structures and Algorithms I.- Adjacency of Optimal Regions for Huffman Trees.- A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs.- Towards Constructing Optimal Strip Move Sequences.- Computational Geometry I.- Large Triangles in the d-Dimensional Unit-Cube.- Progress on Maximum Weight Triangulation.- Coloring Octrees.- Games and Combinatorics.- Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes.- Q-Ary Ulam-Rényi Game with Weighted Constrained Lies.- Necessary and Sufficient Numbers of Cards for the Transformation Protocol.- Combinatorial Optimization I.- On the Selection and Assignment with Minimum Quantity Commitments.- Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study.- Transshipment Through Crossdocks with Inventory and Time Windows.- Graph Algorithms.- Approximated Vertex Cover for Graphs with Perfect Matchings.- An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs.- On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts.- The Worst-Case Time Complexity for Generating All Maximal Cliques.- Automata and Learning Theory.- Regular Expressions for Languages over Infinite Alphabets.- On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations.- Learning DNFs and Circuits Using Teaching Assistants.- On the Complexity of Samples for Learning.- Scheduling.- New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation.- Maximization of the Size and the Weight of Schedules of Degradable Intervals.- Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines.- Computational Geometry II.- Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain.- Algorithms for Point Set Matching with k-Differences.- Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.- Data Structures and Algorithms II.- The Traveling Salesman Problem with Few Inner Points.- A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application.- Algorithms for the On-Line Quota Traveling Salesman Problem.- Graph Drawing.- On the Orthogonal Drawing of Outerplanar Graphs.- Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs.- New Bounds on the Number of Edges in a k-Map Graph.- Combinatorial Optimization II.- Dynamic Storage Allocation and On-Line Colouring Interval Graphs.- New Approximation Algorithms for Some Dynamic Storage Allocation Problems.- k-Center Problems with Minimum Coverage.- Complexity Theory.- On the Extensions of Solovay-Reducibility.- The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups.- Computational Complexity Classification of Partition under Compaction and Retraction.- Parallel and Distributed Architectures.- One-to-Many Disjoint Path Covers in a Graph with Faulty Elements.- Fault-Tolerant Meshes with Constant Degree.- Fault Hamiltonicity of Meshes with Two Wraparound Edges.- On the Expected Time for Herman’s Probabilistic Self-stabilizing Algorithm.- Computational Biology.- An Efficient Online Algorithm for Square Detection.- An Efficient Local Alignment Algorithm for Masked Sequences.- Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard.- Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets.