Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Algorithms and Computation

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

  • Conference proceedings
  • © 2005

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.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

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

    2. Probability and Recursion

      • Kousha Etessami, Mihalis Yannakakis
      Pages 2-4

    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

    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

    5. Separability with Outliers

      • Sariel Har-Peled, Vladlen Koltun
      Pages 28-39

    6. Casting an Object with a Core

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

    7. Sparse Geometric Graphs with Small Dilation

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

    8. Multiple Polyline to Polygon Matching

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

    9. Minimizing a Monotone Concave Function with Laminar Covering Constraints

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

    10. Almost Optimal Solutions for Bin Coloring Problems

      • Mingen Lin, Zhiyong Lin, Jinhui Xu
      Pages 82-91

    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

    12. Simultaneous Matchings

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

    13. An Optimization Problem Related to VoD Broadcasting

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

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

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

    15. Average Case Analysis for Tree Labelling Schemes

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

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

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

    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

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

      • Xiao Zhou, Takao Nishizeki
      Pages 166-175

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

      • Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
      Pages 176-185
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