Combinatorial Algorithms

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 A Note on Handicap Incomplete Tournaments
3. Altmetric Badge
   Chapter 2 Computing the k -Crossing Visibility Region of a Point in a Polygon
4. Altmetric Badge
   Chapter 3 An Improved Scheme in the Two Query Adaptive Bitprobe Model
5. Altmetric Badge
   Chapter 4 On Erdős–Szekeres-Type Problems for k -convex Point Sets
6. Altmetric Badge
   Chapter 5 Algorithm and Hardness Results on Liar’s Dominating Set and $$\varvec{k}$$ -tuple Dominating Set
7. Altmetric Badge
   Chapter 6 Fixed-Parameter Tractability of $$(n-k)$$ List Coloring
8. Altmetric Badge
   Chapter 7 Finding Periods in Cartesian Tree Matching
9. Altmetric Badge
   Chapter 8 Parameterized Complexity of Min-Power Asymmetric Connectivity
10. Altmetric Badge
    Chapter 9 Solving Group Interval Scheduling Efficiently
11. Altmetric Badge
    Chapter 10 Call Admission Problems on Trees with Advice
12. Altmetric Badge
    Chapter 11 Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs
13. Altmetric Badge
    Chapter 12 Towards a Complexity Dichotomy for Colourful Components Problems on k -caterpillars and Small-Degree Planar Graphs
14. Altmetric Badge
    Chapter 13 Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs
15. Altmetric Badge
    Chapter 14 Dual Domination
16. Altmetric Badge
    Chapter 15 Reaching 3-Connectivity via Edge-Edge Additions
17. Altmetric Badge
    Chapter 16 Cops and Robber on Some Families of Oriented Graphs
18. Altmetric Badge
    Chapter 17 Disjoint Clustering in Combinatorial Circuits
19. Altmetric Badge
    Chapter 18 The Hull Number in the Convexity of Induced Paths of Order 3
20. Altmetric Badge
    Chapter 19 Supermagic Graphs with Many Odd Degrees
21. Altmetric Badge
    Chapter 20 Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph
22. Altmetric Badge
    Chapter 21 A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications
23. Altmetric Badge
    Chapter 22 Shortest-Path-Preserving Rounding
24. Altmetric Badge
    Chapter 23 Complexity and Algorithms for Semipaired Domination in Graphs
25. Altmetric Badge
    Chapter 24 Computing the Rooted Triplet Distance Between Phylogenetic Networks
26. Altmetric Badge
    Chapter 25 Parameterized Algorithms for Graph Burning Problem
27. Altmetric Badge
    Chapter 26 Extension and Its Price for the Connected Vertex Cover Problem
28. Altmetric Badge
    Chapter 27 An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number
29. Altmetric Badge
    Chapter 28 An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs
30. Altmetric Badge
    Chapter 29 Complexity of Fall Coloring for Restricted Graph Classes
31. Altmetric Badge
    Chapter 30 Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints
32. Altmetric Badge
    Chapter 31 Maximum Clique Exhaustive Search in Circulant k -Hypergraphs
33. Altmetric Badge
    Chapter 32 Burrows-Wheeler Transform of Words Defined by Morphisms
34. Altmetric Badge
    Chapter 33 Stable Noncrossing Matchings
35. Altmetric Badge
    Chapter 34 On the Average Case of MergeInsertion
36. Altmetric Badge
    Chapter 35 Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings
37. Altmetric Badge
    Chapter 36 A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber