Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
3. Altmetric Badge
   Chapter 2 Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation
4. Altmetric Badge
   Chapter 3 Block Elimination Distance
5. Altmetric Badge
   Chapter 4 On Fair Covering and Hitting Problems
6. Altmetric Badge
   Chapter 5 On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem
7. Altmetric Badge
   Chapter 6 FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More
8. Altmetric Badge
   Chapter 7 Disjoint Stable Matchings in Linear Time
9. Altmetric Badge
   Chapter 8 Complementation in T-perfect Graphs
10. Altmetric Badge
    Chapter 9 On Subgraph Complementation to H -free Graphs
11. Altmetric Badge
    Chapter 10 Odd Cycle Transversal in Mixed Graphs
12. Altmetric Badge
    Chapter 11 Preventing Small $$\mathbf {(s,t)}$$ ( s , t ) -Cuts by Protecting Edges
13. Altmetric Badge
    Chapter 12 Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel
14. Altmetric Badge
    Chapter 13 A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs
15. Altmetric Badge
    Chapter 14 The Perfect Matching Cut Problem Revisited
16. Altmetric Badge
    Chapter 15 The Complexity of Gerrymandering over Graphs: Paths and Trees
17. Altmetric Badge
    Chapter 16 Feedback Vertex Set on Hamiltonian Graphs
18. Altmetric Badge
    Chapter 17 Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
19. Altmetric Badge
    Chapter 18 The Dynamic Complexity of Acyclic Hypergraph Homomorphisms
20. Altmetric Badge
    Chapter 19 Linearizable Special Cases of the Quadratic Shortest Path Problem
21. Altmetric Badge
    Chapter 20 A Linear-Time Parameterized Algorithm for Computing the Width of a DAG
22. Altmetric Badge
    Chapter 21 On Morphing 1-Planar Drawings
23. Altmetric Badge
    Chapter 22 Bears with Hats and Independence Polynomials
24. Altmetric Badge
    Chapter 23 The Largest Connected Subgraph Game
25. Altmetric Badge
    Chapter 24 Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs
26. Altmetric Badge
    Chapter 25 Beyond Helly Graphs: The Diameter Problem on Absolute Retracts
27. Altmetric Badge
    Chapter 27 The Graphs of Stably Matchable Pairs
28. Altmetric Badge
    Chapter 28 On Additive Spanners in Weighted Graphs with Local Error
29. Altmetric Badge
    Chapter 29 Labeling Schemes for Deterministic Radio Multi-broadcast
30. Altmetric Badge
    Chapter 30 On 3-Coloring of $$(2P_4,C_5)$$ ( 2 P 4 , C 5 ) -Free Graphs
31. Altmetric Badge
    Chapter 31 Correction to: Bears with Hats and Independence Polynomials