WALCOM: Algorithms and Computation

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 A Separator Theorem for String Graphs and Its Applications
3. Altmetric Badge
   Chapter 2 Foundations of Exact Rounding
4. Altmetric Badge
   Chapter 3 Approximating Shortest Paths in Graphs
5. Altmetric Badge
   Chapter 4 Line Transversals and Pinning Numbers
6. Altmetric Badge
   Chapter 5 Algorithms for Computing Diffuse Reflection Paths in Polygons
7. Altmetric Badge
   Chapter 6 Shortest Gently Descending Paths
8. Altmetric Badge
   Chapter 7 All Farthest Neighbors in the Presence of Highways and Obstacles
9. Altmetric Badge
   Chapter 8 Improved Algorithm for a Widest 1-Corner Corridor
10. Altmetric Badge
    Chapter 9 Maximum Neighbour Voronoi Games
11. Altmetric Badge
    Chapter 10 On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
12. Altmetric Badge
    Chapter 11 Colinear Coloring on Graphs
13. Altmetric Badge
    Chapter 12 Recursive Generation of 5-Regular Planar Graphs
14. Altmetric Badge
    Chapter 13 Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
15. Altmetric Badge
    Chapter 14 Generating All Triangulations of Plane Graphs (Extended Abstract)
16. Altmetric Badge
    Chapter 15 Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
17. Altmetric Badge
    Chapter 16 Random Generation and Enumeration of Proper Interval Graphs
18. Altmetric Badge
    Chapter 17 A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
19. Altmetric Badge
    Chapter 18 Minmax Tree Cover in the Euclidean Space
20. Altmetric Badge
    Chapter 19 Network Design with Weighted Degree Constraints
21. Altmetric Badge
    Chapter 20 Minimum Cuts of Simple Graphs in Almost Always Linear Time
22. Altmetric Badge
    Chapter 21 The Generalized Stable Allocation Problem
23. Altmetric Badge
    Chapter 22 Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
24. Altmetric Badge
    Chapter 23 Core and Conditional Core Path of Specified Length in Special Classes of Graphs
25. Altmetric Badge
    Chapter 24 The Planar k-Means Problem is NP-Hard
26. Altmetric Badge
    Chapter 25 On the Computational Complexity of Monotone Constraint Satisfaction Problems
27. Altmetric Badge
    Chapter 26 Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
28. Altmetric Badge
    Chapter 27 Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O ( n log n ) Area (Extended Abstract)
29. Altmetric Badge
    Chapter 28 Matched Drawability of Graph Pairs and of Graph Triples
30. Altmetric Badge
    Chapter 29 WALCOM: Algorithms and Computation
31. Altmetric Badge
    Chapter 30 Spherical-Rectangular Drawings
32. Altmetric Badge
    Chapter 31 The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
33. Altmetric Badge
    Chapter 32 The Minimal Manhattan Network Problem in Three Dimensions
34. Altmetric Badge
    Chapter 33 Shape Matching by Random Sampling
35. Altmetric Badge
    Chapter 34 Object Caching for Queries and Updates