↓ 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 Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
  3. Altmetric Badge
    Chapter 2 Open Problems on Graph Coloring for Special Graph Classes
  4. Altmetric Badge
    Chapter 3 On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks
  5. Altmetric Badge
    Chapter 4 The Stable Fixtures Problem with Payments
  6. Altmetric Badge
    Chapter 5 Complexity of Secure Sets
  7. Altmetric Badge
    Chapter 6 Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time
  8. Altmetric Badge
    Chapter 7 On the Tree Search Problem with Non-uniform Costs
  9. Altmetric Badge
    Chapter 8 An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem
  10. Altmetric Badge
    Chapter 9 On the Number of Minimal Separators in Graphs
  11. Altmetric Badge
    Chapter 10 Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
  12. Altmetric Badge
    Chapter 11 A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
  13. Altmetric Badge
    Chapter 12 Finding Paths in Grids with Forbidden Transitions
  14. Altmetric Badge
    Chapter 13 The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results
  15. Altmetric Badge
    Chapter 14 Minimum Eccentricity Shortest Paths in Some Structured Graph Classes
  16. Altmetric Badge
    Chapter 15 Approximating Source Location and Star Survivable Network Problems
  17. Altmetric Badge
    Chapter 16 On the Complexity of Computing the k-restricted Edge-connectivity of a Graph
  18. Altmetric Badge
    Chapter 17 Weak Unit Disk and Interval Representation of Graphs
  19. Altmetric Badge
    Chapter 18 Simultaneous Visibility Representations of Plane st-graphs Using L-shapes
  20. Altmetric Badge
    Chapter 19 An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes
  21. Altmetric Badge
    Chapter 20 Unsplittable Coverings in the Plane
  22. Altmetric Badge
    Chapter 21 Induced Minor Free Graphs: Isomorphism and Clique-width
  23. Altmetric Badge
    Chapter 22 On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs
  24. Altmetric Badge
    Chapter 23 Colouring and Covering Nowhere Dense Graphs
  25. Altmetric Badge
    Chapter 24 Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs
  26. Altmetric Badge
    Chapter 25 Well-quasi-ordering Does Not Imply Bounded Clique-width
  27. Altmetric Badge
    Chapter 26 A Slice Theoretic Approach for Embedding Problems on Digraphs
  28. Altmetric Badge
    Chapter 27 Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs
  29. Altmetric Badge
    Chapter 28 Saturated Simple and 2-simple Topological Graphs with Few Edges
  30. Altmetric Badge
    Chapter 29 Testing Full Outer-2-planarity in Linear Time
  31. Altmetric Badge
    Chapter 30 Triangulating Planar Graphs While Keeping the Pathwidth Small
  32. Altmetric Badge
    Chapter 31 Polynomial Kernelization for Removing Induced Claws and Diamonds
  33. Altmetric Badge
    Chapter 32 Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
  34. Altmetric Badge
    Chapter 33 On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT
  35. Altmetric Badge
    Chapter 34 Recognizing k-equistable Graphs in FPT Time
  36. Altmetric Badge
    Chapter 35 Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users

Readers on

mendeley
75 Mendeley
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, Berlin, Heidelberg, January 2015
DOI 10.1007/978-3-662-53174-7
ISBNs
978-3-66-253173-0, 978-3-66-253174-7
Editors

Ernst W. Mayr

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.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 75 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Brazil 2 3%
United States 2 3%
Switzerland 1 1%
Italy 1 1%
Ukraine 1 1%
Portugal 1 1%
Hong Kong 1 1%
Czechia 1 1%
Unknown 65 87%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 22 29%
Student > Master 13 17%
Researcher 11 15%
Professor 6 8%
Student > Bachelor 4 5%
Other 19 25%
Readers by discipline Count As %
Computer Science 45 60%
Mathematics 11 15%
Engineering 8 11%
Physics and Astronomy 4 5%
Unspecified 3 4%
Other 4 5%