Skip to main content
  • Conference proceedings
  • © 2005

Algorithms and Computation

16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3827)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ISAAC: International Symposium on Algorithms and Computation

Conference proceedings info: ISAAC 2005.

Table of contents (116 papers)

  1. Front Matter

  2. Algorithmic Problems in Wireless Ad Hoc Networks

    1. Probability and Recursion

      • Kousha Etessami, Mihalis Yannakakis
      Pages 2-4
    2. Embedding Point Sets into Plane Graphs of Small Dilation

      • Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas
      Pages 5-16
    3. The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation

      • Xiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka
      Pages 17-27
    4. Separability with Outliers

      • Sariel Har-Peled, Vladlen Koltun
      Pages 28-39
    5. Casting an Object with a Core

      • Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa
      Pages 40-49
    6. Sparse Geometric Graphs with Small Dilation

      • Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman Haverkort, Antoine Vigneron
      Pages 50-59
    7. Multiple Polyline to Polygon Matching

      • Mirela Tănase, Remco C. Veltkamp, Herman Haverkort
      Pages 60-70
    8. Minimizing a Monotone Concave Function with Laminar Covering Constraints

      • Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
      Pages 71-81
    9. Almost Optimal Solutions for Bin Coloring Problems

      • Mingen Lin, Zhiyong Lin, Jinhui Xu
      Pages 82-91
    10. Simultaneous Matchings

      • Khaled Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan
      Pages 106-115
    11. An Optimization Problem Related to VoD Broadcasting

      • Tsunehiko Kameda, Yi Sun, Luis Goddyn
      Pages 116-125
    12. A Min-Max Relation on Packing Feedback Vertex Sets

      • Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
      Pages 126-135
    13. Average Case Analysis for Tree Labelling Schemes

      • Ming-Yang Kao, Xiang-Yang Li, WeiZhao Wang
      Pages 136-145
    14. Revisiting T. Uno and M. Yagiura’s Algorithm

      • Binh-Minh Bui Xuan, Michel Habib, Christophe Paul
      Pages 146-155
    15. Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs

      • L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, V. Gurvich, K. Makino
      Pages 156-165
    16. Bisecting a Four-Connected Graph with Three Resource Sets

      • Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
      Pages 176-185

Other Volumes

  1. Algorithms and Computation

Editors and Affiliations

  • Department of Computer Science, City University of Hong Kong, Kowloon , Hong Kong

    Xiaotie Deng

  • Department of Computer Science, University of Texas at Dallas, Richardson, USA

    Ding-Zhu Du

Bibliographic Information