Algorithms and Computation

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

Editors:

ISBN: 978-3-540-30935-2 (Print) 978-3-540-32426-3 (Online)

Table of contents (116 chapters)

previous Page of 6
  1. Front Matter

    Pages -

  2. Algorithmic Problems in Wireless Ad Hoc Networks

    1. No Access

      Book Chapter

      Pages 1-1

      Algorithmic Problems in Wireless Ad Hoc Networks

    2. No Access

      Book Chapter

      Pages 2-4

      Probability and Recursion

    3. No Access

      Book Chapter

      Pages 5-16

      Embedding Point Sets into Plane Graphs of Small Dilation

    4. No Access

      Book Chapter

      Pages 17-27

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

    5. No Access

      Book Chapter

      Pages 28-39

      Separability with Outliers

    6. No Access

      Book Chapter

      Pages 40-49

      Casting an Object with a Core

    7. No Access

      Book Chapter

      Pages 50-59

      Sparse Geometric Graphs with Small Dilation

    8. No Access

      Book Chapter

      Pages 60-70

      Multiple Polyline to Polygon Matching

    9. No Access

      Book Chapter

      Pages 71-81

      Minimizing a Monotone Concave Function with Laminar Covering Constraints

    10. No Access

      Book Chapter

      Pages 82-91

      Almost Optimal Solutions for Bin Coloring Problems

    11. No Access

      Book Chapter

      Pages 92-105

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

    12. No Access

      Book Chapter

      Pages 106-115

      Simultaneous Matchings

    13. No Access

      Book Chapter

      Pages 116-125

      An Optimization Problem Related to VoD Broadcasting

    14. No Access

      Book Chapter

      Pages 126-135

      A Min-Max Relation on Packing Feedback Vertex Sets

    15. No Access

      Book Chapter

      Pages 136-145

      Average Case Analysis for Tree Labelling Schemes

    16. No Access

      Book Chapter

      Pages 146-155

      Revisiting T. Uno and M. Yagiura’s Algorithm

    17. No Access

      Book Chapter

      Pages 156-165

      Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs

    18. No Access

      Book Chapter

      Pages 166-175

      Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends

    19. No Access

      Book Chapter

      Pages 176-185

      Bisecting a Four-Connected Graph with Three Resource Sets

    20. No Access

      Book Chapter

      Pages 186-195

      Laminar Structure of Ptolemaic Graphs and Its Applications

previous Page of 6