↓ Skip to main content
What is this page? Embed badge

Graph-Theoretic Concepts in Computer Science

Overview of attention for book
Graph-Theoretic Concepts in Computer Science
Springer Nature

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Minimal Roman Dominating Functions: Extensions and Enumeration
  3. Altmetric Badge
    Chapter 2 Disjoint Compatibility via Graph Classes
  4. Altmetric Badge
    Chapter 3 Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)
  5. Altmetric Badge
    Chapter 4 Twin-Width and Transductions of Proper k-Mixed-Thin Graphs
  6. Altmetric Badge
    Chapter 5 Token Sliding on Graphs of Girth Five
  7. Altmetric Badge
    Chapter 6 Recognition of Linear and Star Variants of Leaf Powers is in P
  8. Altmetric Badge
    Chapter 7 Problems Hard for Treewidth but Easy for Stable Gonality
  9. Altmetric Badge
    Chapter 8 Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
  10. Altmetric Badge
    Chapter 9 An Algorithmic Framework for Locally Constrained Homomorphisms
  11. Altmetric Badge
    Chapter 10 s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
  12. Altmetric Badge
    Chapter 11 Polychromatic Colorings of Unions of Geometric Hypergraphs
  13. Altmetric Badge
    Chapter 12 Kernelization for Feedback Vertex Set via Elimination Distance to a Forest
  14. Altmetric Badge
    Chapter 13 Finding k -Secluded Trees Faster
  15. Altmetric Badge
    Chapter 14 On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy
  16. Altmetric Badge
    Chapter 15 On the Lossy Kernelization for Connected Treedepth Deletion Set
  17. Altmetric Badge
    Chapter 16 Generalized $$k$$ -Center: Distinguishing Doubling and Highway Dimension
  18. Altmetric Badge
    Chapter 17 Extending Partial Representations of Circular-Arc Graphs
  19. Altmetric Badge
    Chapter 18 Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates
  20. Altmetric Badge
    Chapter 19 Parameterized Complexity of Weighted Multicut in Trees
  21. Altmetric Badge
    Chapter 20 The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
  22. Altmetric Badge
    Chapter 21 Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs
  23. Altmetric Badge
    Chapter 22 On Anti-stochastic Properties of Unlabeled Graphs
  24. Altmetric Badge
    Chapter 23 Computing List Homomorphisms in Geometric Intersection Graphs
  25. Altmetric Badge
    Chapter 24 On Fully Diverse Sets of Geometric Objects and Graphs
  26. Altmetric Badge
    Chapter 25 Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings
  27. Altmetric Badge
    Chapter 26 The Complexity of Contracting Bipartite Graphs into Small Cycles
  28. Altmetric Badge
    Chapter 27 Algorithmic Aspects of Small Quasi-Kernels
  29. Altmetric Badge
    Chapter 28 Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders
  30. Altmetric Badge
    Chapter 29 Induced Disjoint Paths and Connected Subgraphs for  H -Free Graphs
  31. Altmetric Badge
    Chapter 30 Classifying Subset Feedback Vertex Set for H-Free Graphs
  32. Altmetric Badge
    Chapter 31 Linearizing Partial Search Orders
  33. Altmetric Badge
    Chapter 32 Minimum Weight Euclidean $$(1+\varepsilon )$$-Spanners
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
wikipedia
2 Wikipedia pages
Summary X Wikipedia
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.
Title
Graph-Theoretic Concepts in Computer Science
Published by
Springer Nature, September 2022
DOI 10.1007/978-3-031-15914-5
ISBNs
978-3-03-115914-5, 978-3-03-115913-8
Editors

Bekos, Michael A., Kaufmann, Michael

View on publisher site Google Preview
Timeline

Login to access the full chart related to this output.

If you don’t have an account, click here to discover Explorer

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
As of 1 July 2024, you may notice a temporary increase in the numbers of X profiles with Unknown location. Click here to learn more.

This page is provided by Altmetric.