Combinatorial Algorithms

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
3. Altmetric Badge
   Chapter 2 On the Maximal Sum of Exponents of Runsin a String
4. Altmetric Badge
   Chapter 3 Path-Based Supports for Hypergraphs
5. Altmetric Badge
   Chapter 4 On Improved Exact Algorithms for L (2,1)-Labeling of Graphs
6. Altmetric Badge
   Chapter 5 Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
7. Altmetric Badge
   Chapter 6 Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three
8. Altmetric Badge
   Chapter 7 Shortest Paths between Shortest Paths and Independent Sets
9. Altmetric Badge
   Chapter 8 Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism
10. Altmetric Badge
    Chapter 9 Dichotomy for Coloring of Dart Graphs
11. Altmetric Badge
    Chapter 10 Worst Case Efficient Single and Multiple String Matching in the RAM Model
12. Altmetric Badge
    Chapter 11 The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2
13. Altmetric Badge
    Chapter 12 Upper and Lower I/O Bounds for Pebbling r-Pyramids
14. Altmetric Badge
    Chapter 13 Combinatorial Algorithms
15. Altmetric Badge
    Chapter 14 The Complexity Status of Problems Related to Sparsest Cuts
16. Altmetric Badge
    Chapter 15 On Approximation Complexity of Metric Dimension Problem
17. Altmetric Badge
    Chapter 16 Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates
18. Altmetric Badge
    Chapter 17 Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
19. Altmetric Badge
    Chapter 18 Computing Role Assignments of Proper Interval Graphs in Polynomial Time
20. Altmetric Badge
    Chapter 19 Efficient Connectivity Testing of Hypercubic Networks with Faults
21. Altmetric Badge
    Chapter 20 Reductions of Matrices Associated with Nowhere-Zero Flows
22. Altmetric Badge
    Chapter 21 Combinatorial Algorithms
23. Altmetric Badge
    Chapter 22 Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree
24. Altmetric Badge
    Chapter 23 Skip Lift: A Probabilistic Alternative to Red-Black Trees
25. Altmetric Badge
    Chapter 24 On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
26. Altmetric Badge
    Chapter 25 Parameterized Complexity of k -Anonymity: Hardness and Tractability
27. Altmetric Badge
    Chapter 26 On Fast Enumeration of Pseudo Bicliques
28. Altmetric Badge
    Chapter 27 Efficient Chaining of Seeds in Ordered Trees
29. Altmetric Badge
    Chapter 28 On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
30. Altmetric Badge
    Chapter 29 Recognition of Probe Ptolemaic Graphs
31. Altmetric Badge
    Chapter 30 Graphs of Separability at Most Two: Structural Characterizations and Their Consequences
32. Altmetric Badge
    Chapter 31 On Antimagic Labeling for Generalized Web and Flower Graphs
33. Altmetric Badge
    Chapter 32 Chains-into-Bins Processes
34. Altmetric Badge
    Chapter 33 Complexity of Locally Injective Homomorphism to the Theta Graphs
35. Altmetric Badge
    Chapter 34 Ranking and Drawing in Subexponential Time
36. Altmetric Badge
    Chapter 35 Efficient Reconstruction of RC-Equivalent Strings
37. Altmetric Badge
    Chapter 36 Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures
38. Altmetric Badge
    Chapter 37 The Cover Time of Cartesian Product Graphs
39. Altmetric Badge
    Chapter 38 Dictionary-Symbolwise Flexible Parsing
40. Altmetric Badge
    Chapter 39 Regular Language Constrained Sequence Alignment Revisited