↓ Skip to main content

Graph-Theoretic Concepts in Computer Science

Overview of attention for book
Cover of 'Graph-Theoretic Concepts in Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On Dispersable Book Embeddings
  3. Altmetric Badge
    Chapter 2 Characterising AT-free Graphs with BFS
  4. Altmetric Badge
    Chapter 3 Edge Partitions of Optimal 2-plane and 3-plane Graphs
  5. Altmetric Badge
    Chapter 4 On Minimum Connecting Transition Sets in Graphs
  6. Altmetric Badge
    Chapter 5 Recognizing Hyperelliptic Graphs in Polynomial Time
  7. Altmetric Badge
    Chapter 6 On Directed Feedback Vertex Set Parameterized by Treewidth
  8. Altmetric Badge
    Chapter 7 Optimality Program in Segment and String Graphs
  9. Altmetric Badge
    Chapter 8 Anagram-Free Chromatic Number Is Not Pathwidth-Bounded
  10. Altmetric Badge
    Chapter 9 Tight Lower Bounds for the Number of Inclusion-Minimal st -Cuts
  11. Altmetric Badge
    Chapter 10 Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
  12. Altmetric Badge
    Chapter 11 Computing Small Pivot-Minors
  13. Altmetric Badge
    Chapter 12 Saving Probe Bits by Cube Domination
  14. Altmetric Badge
    Chapter 13 Graph Amalgamation Under Logical Constraints
  15. Altmetric Badge
    Chapter 14 $$\forall \exists \mathbb {R}$$ ∀ ∃ R -Completeness and Area-Universality
  16. Altmetric Badge
    Chapter 15 Optimal General Matchings
  17. Altmetric Badge
    Chapter 16 Quasimonotone Graphs
  18. Altmetric Badge
    Chapter 17 Equiangular Polygon Contact Representations
  19. Altmetric Badge
    Chapter 18 Temporal Graph Classes: A View Through Temporal Separators
  20. Altmetric Badge
    Chapter 19 Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization
  21. Altmetric Badge
    Chapter 20 On the Relation of Strong Triadic Closure and Cluster Deletion
  22. Altmetric Badge
    Chapter 21 On Perfect Linegraph Squares
  23. Altmetric Badge
    Chapter 22 On Weak Isomorphism of Rooted Vertex-Colored Graphs
  24. Altmetric Badge
    Chapter 23 Connected Vertex Cover for  $$(sP_1+P_5)$$ ( s P 1 + P 5 ) -Free Graphs
  25. Altmetric Badge
    Chapter 24 Structurally Parameterized d -Scattered Set
  26. Altmetric Badge
    Chapter 25 Popular Matchings of Desired Size
  27. Altmetric Badge
    Chapter 26 Convexity-Increasing Morphs of Planar Graphs
  28. Altmetric Badge
    Chapter 27 Treedepth Bounds in Linear Colorings
  29. Altmetric Badge
    Chapter 28 An Improved FPT Algorithm for Independent Feedback Vertex Set
  30. Altmetric Badge
    Chapter 29 Construction and Local Routing for Angle-Monotone Graphs
  31. Altmetric Badge
    Chapter 30 Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three
Attention for Chapter 24: Structurally Parameterized d -Scattered Set
Altmetric Badge

Citations

dimensions_citation
1 Dimensions
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Structurally Parameterized d -Scattered Set
Chapter number 24
Book title
Graph-Theoretic Concepts in Computer Science
Published by
Springer, Cham, June 2018
DOI 10.1007/978-3-030-00256-5_24
Book ISBNs
978-3-03-000255-8, 978-3-03-000256-5
Authors

Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos, Katsikarelis, Ioannis, Lampis, Michael, Paschos, Vangelis Th., Th. Paschos, Vangelis