Algorithms and Computation

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

  • Xiaotie Deng
  • Ding-Zhu Du
Conference proceedings ISAAC 2005

DOI: 10.1007/11602613

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

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. Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
      Xiao Zhou, Takao Nishizeki
      Pages 166-175
    17. Bisecting a Four-Connected Graph with Three Resource Sets
      Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
      Pages 176-185

About these proceedings


AAC algorithm algorithms complexity computational geometry data structure optimization

Editors and affiliations

  • Xiaotie Deng
    • 1
  • Ding-Zhu Du
    • 2
  1. 1.Department of Computer ScienceCity University of Hong KongKowloon , Hong Kong
  2. 2.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-30935-2
  • Online ISBN 978-3-540-32426-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349