WALCOM: Algorithms and Computation

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Crossings between Curves with Many Tangencies
3. Altmetric Badge
   Chapter 2 Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
4. Altmetric Badge
   Chapter 3 Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
5. Altmetric Badge
   Chapter 4 The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
6. Altmetric Badge
   Chapter 5 Small Grid Drawings of Planar Graphs with Balanced Bipartition
7. Altmetric Badge
   Chapter 6 Switch-Regular Upward Planar Embeddings of Trees
8. Altmetric Badge
   Chapter 7 A Global k -Level Crossing Reduction Algorithm
9. Altmetric Badge
   Chapter 8 Computation of Non-dominated Points Using Compact Voronoi Diagrams
10. Altmetric Badge
    Chapter 9 Cutting a Convex Polyhedron Out of a Sphere
11. Altmetric Badge
    Chapter 10 A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion
12. Altmetric Badge
    Chapter 11 Acyclically 3-Colorable Planar Graphs
13. Altmetric Badge
    Chapter 12 Reconstruction Algorithm for Permutation Graphs
14. Altmetric Badge
    Chapter 13 Harmonious Coloring on Subclasses of Colinear Graphs
15. Altmetric Badge
    Chapter 14 Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
16. Altmetric Badge
    Chapter 15 The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O ( n log n ) Time
17. Altmetric Badge
    Chapter 16 Parallel Algorithms for Encoding and Decoding Blob Code
18. Altmetric Badge
    Chapter 17 A Rooted-Forest Partition with Uniform Vertex Demand
19. Altmetric Badge
    Chapter 18 A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
20. Altmetric Badge
    Chapter 19 On Some Simple Widths
21. Altmetric Badge
    Chapter 20 A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques
22. Altmetric Badge
    Chapter 21 The Covert Set-Cover Problem with Application to Network Discovery
23. Altmetric Badge
    Chapter 22 Variants of Spreading Messages
24. Altmetric Badge
    Chapter 23 On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost
25. Altmetric Badge
    Chapter 24 Real Root Isolation of Multi-Exponential Polynomials with Application
26. Altmetric Badge
    Chapter 25 FPT Algorithms for Connected Feedback Vertex Set
27. Altmetric Badge
    Chapter 26 A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs
28. Altmetric Badge
    Chapter 27 Pathwidth and Searching in Parameterized Threshold Graphs