Computing and Combinatorics

1. Automata and Learning Theory

   1. Regular Expressions for Languages over Infinite Alphabets

      • Michael Kaminski, Tony Tan

      Pages 171-178

   2. On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations

      • Masaki Nakanishi

      Pages 179-187

   3. Learning DNFs and Circuits Using Teaching Assistants

      • N. Variyam Vinodchandran

      Pages 188-197

   4. On the Complexity of Samples for Learning

      • Joel Ratsaby

      Pages 198-209

2. Scheduling

   1. New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation

      • Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Prudence W. H. Wong

      Pages 210-218

   2. Maximization of the Size and the Weight of Schedules of Degradable Intervals

      • Fabien Baille, Evripidis Bampis, Christian Laforest

      Pages 219-228

   3. Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines

      • Shuguang Li, Guojun Li, Shaoqiang Zhang

      Pages 229-237

3. Computational Geometry II

   1. Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain

      • Danny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama

      Pages 238-248

   2. Algorithms for Point Set Matching with k-Differences

      • Tatsuya Akutsu

      Pages 249-258

   3. Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon

      • Hee-Kap Ahn, Peter Brass, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron

      Pages 259-267

4. Data Structures and Algorithms II

   1. The Traveling Salesman Problem with Few Inner Points

      • Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger

      Pages 268-277

   2. A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application

      • Tadao Takaoka

      Pages 278-289

   3. Algorithms for the On-Line Quota Traveling Salesman Problem

      • Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Paschos

      Pages 290-299

5. Graph Drawing

   1. On the Orthogonal Drawing of Outerplanar Graphs

      • Kumiko Nomura, Satoshi Tayu, Shuichi Ueno

      Pages 300-308

   2. Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs

      • Kazuyuki Miura, Machiko Azuma, Takao Nishizeki

      Pages 309-318

   3. New Bounds on the Number of Edges in a k-Map Graph

      • Zhi-Zhong Chen

      Pages 319-328

6. Combinatorial Optimization II

   1. Dynamic Storage Allocation and On-Line Colouring Interval Graphs

      • N. S. Narayanaswamy

      Pages 329-338

   2. New Approximation Algorithms for Some Dynamic Storage Allocation Problems

      • Shuai Cheng Li, Hon Wai Leong, Steven K. Quek

      Pages 339-348

   3. k-Center Problems with Minimum Coverage

      • Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu

      Pages 349-359

7. Complexity Theory

   1. On the Extensions of Solovay-Reducibility

      • Xizhong Zheng, Robert Rettinger

      Pages 360-369

Thepapersinthisvolumewereselectedforpresentationatthe10thInternational Computing and Combinatorics Conference (COCOON 2004), held on August 17–20, 2004 in Jeju Island, Korea. Previous meetings were held in Xi’an (1995), HongKong(1996),Shanghai(1997),Taipei(1998),Tokyo(1999),Sydney(2000), Guilin (2001), Singapore (2002), and Big Sky (2003). In response to the call for papers, 109 extended abstracts were submitted from 23 countries, of which 46 were accepted. The submitted papers were from Belgium (1), Canada (5), China (6), France (1), Germany (6), Hong Kong (8), India (6), Iran (1), Ireland (1), Israel (4), Italy (2), Japan (17), Korea (23), Mexico (3), New Zealand (1), Poland(1), Russia (1), Singapore (5), Sweden (2), Switzerland (3), Taiwan (2), the UK (1), and the USA (9). Each paper was evaluated by at least three program committee members, with the assistance of referees, as indicated by the referee list found in these proceedings. There were many more acceptable papers than there was space available in the conference schedule, and the program committee’s task was extremely di?cult. In addition to selected papers, the conference also included threeinvitedpresentationsbyLarsArge,JeongHanKim,andKokichiSugihara. We thank all program committee members and their referees for their - cellent work, especially given the demanding time constraints; they gave the conference its distinctive character. We thank all who submitted papers for c- sideration: they all contributed to the high quality of the conference. Finally,wethankallthepeoplewhoworkedhardtoputinplacethelogistical arrangements of the conference — our colleagues and our graduate students. It is their hard work that made the conference possible and enjoyable.

• Automat
• algorithms
• automata
• combinatorial optimization
• complexity
• complexity theory
• computational geometry
• data structures
• optimization
• algorithm analysis and problem complexity

• Division of Computer Science, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea

  Kyung-Yong Chwa

• Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada

  J. Ian J. Munro

Policies and ethics