Skip to main content
SpringerLink
Log in

Algorithms and Computation

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

  • Conference proceedings
  • © 2005

Access provided by Autonomous University of Puebla

Download book PDF

Overview

Editors:
  1. Xiaotie Deng

    1. Department of Computer Science, City University of Hong Kong, Kowloon , Hong Kong

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ding-Zhu Du

    1. Department of Computer Science, University of Texas at Dallas, Richardson, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

Included in the following conference series:

Conference proceedings info: ISAAC 2005.

Buy print copy

Keywords

Table of contents (116 papers)

  1. Front Matter

    Download chapter PDF

  2. Algorithmic Problems in Wireless Ad Hoc Networks

    1. Algorithmic Problems in Wireless Ad Hoc Networks

      • Frances F. Yao
      Pages 1-1
      Download chapter PDF

    2. Probability and Recursion

      • Kousha Etessami, Mihalis Yannakakis
      Pages 2-4
      Download chapter PDF

    3. 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
      Download chapter PDF

    4. The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation

      • Xiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka
      Pages 17-27
      Download chapter PDF

    5. Separability with Outliers

      • Sariel Har-Peled, Vladlen Koltun
      Pages 28-39
      Download chapter PDF

    6. Casting an Object with a Core

      • Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa
      Pages 40-49
      Download chapter PDF

    7. Sparse Geometric Graphs with Small Dilation

      • Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman Haverkort, Antoine Vigneron
      Pages 50-59
      Download chapter PDF

    8. Multiple Polyline to Polygon Matching

      • Mirela Tănase, Remco C. Veltkamp, Herman Haverkort
      Pages 60-70
      Download chapter PDF

    9. Minimizing a Monotone Concave Function with Laminar Covering Constraints

      • Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
      Pages 71-81
      Download chapter PDF

    10. Almost Optimal Solutions for Bin Coloring Problems

      • Mingen Lin, Zhiyong Lin, Jinhui Xu
      Pages 82-91
      Download chapter PDF

    11. GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints

      • Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue
      Pages 92-105
      Download chapter PDF

    12. Simultaneous Matchings

      • Khaled Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan
      Pages 106-115
      Download chapter PDF

    13. An Optimization Problem Related to VoD Broadcasting

      • Tsunehiko Kameda, Yi Sun, Luis Goddyn
      Pages 116-125
      Download chapter PDF

    14. A Min-Max Relation on Packing Feedback Vertex Sets

      • Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
      Pages 126-135
      Download chapter PDF

    15. Average Case Analysis for Tree Labelling Schemes

      • Ming-Yang Kao, Xiang-Yang Li, WeiZhao Wang
      Pages 136-145
      Download chapter PDF

    16. Revisiting T. Uno and M. Yagiura’s Algorithm

      • Binh-Minh Bui Xuan, Michel Habib, Christophe Paul
      Pages 146-155
      Download chapter PDF

    17. Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs

      • L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, V. Gurvich, K. Makino
      Pages 156-165
      Download chapter PDF

    18. Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends

      • Xiao Zhou, Takao Nishizeki
      Pages 166-175
      Download chapter PDF

    19. Bisecting a Four-Connected Graph with Three Resource Sets

      • Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
      Pages 176-185
      Download chapter PDF
Back to top

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

Publish with us

Policies and ethics

Back to top

Search

Navigation