↓ 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 Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)
  3. Altmetric Badge
    Chapter 2 Distributedly Testing Cycle-Freeness
  4. Altmetric Badge
    Chapter 3 DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
  5. Altmetric Badge
    Chapter 4 Linear Rank-Width of Distance-Hereditary Graphs
  6. Altmetric Badge
    Chapter 5 Vertex Contact Graphs of Paths on a Grid
  7. Altmetric Badge
    Chapter 6 Deciding the Bell Number for Hereditary Graph Properties
  8. Altmetric Badge
    Chapter 7 Boxicity and Separation Dimension
  9. Altmetric Badge
    Chapter 8 Maximal Induced Matchings in Triangle-Free Graphs
  10. Altmetric Badge
    Chapter 9 Independent Set Reconfiguration in Cographs
  11. Altmetric Badge
    Chapter 10 Structural Parameterizations for Boxicity
  12. Altmetric Badge
    Chapter 11 A New Characterization of $$P_k$$ -free Graphs
  13. Altmetric Badge
    Chapter 12 Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
  14. Altmetric Badge
    Chapter 13 The Maximum Labeled Path Problem
  15. Altmetric Badge
    Chapter 14 Minimum Spanning Tree Verification Under Uncertainty
  16. Altmetric Badge
    Chapter 15 Towards the Hanani-Tutte Theorem for Clustered Graphs
  17. Altmetric Badge
    Chapter 16 On Set Expansion Problems and the Small Set Expansion Conjecture
  18. Altmetric Badge
    Chapter 17 Hadwiger Number of Graphs with Small Chordality
  19. Altmetric Badge
    Chapter 18 Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time
  20. Altmetric Badge
    Chapter 19 Induced Disjoint Paths in Circular-Arc Graphs in Linear Time
  21. Altmetric Badge
    Chapter 20 Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs
  22. Altmetric Badge
    Chapter 21 Parameterized Directed $$k$$ -Chinese Postman Problem and $$k$$ Arc-Disjoint Cycles Problem on Euler Digraphs
  23. Altmetric Badge
    Chapter 22 Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs
  24. Altmetric Badge
    Chapter 23 Edge Elimination in TSP Instances
  25. Altmetric Badge
    Chapter 24 The Parameterized Complexity of the Rainbow Subgraph Problem
  26. Altmetric Badge
    Chapter 25 Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees
  27. Altmetric Badge
    Chapter 26 Graph-TSP from Steiner Cycles
  28. Altmetric Badge
    Chapter 27 A Characterization of Mixed Unit Interval Graphs
  29. Altmetric Badge
    Chapter 28 On the Number of Connected Sets in Bounded Degree Graphs
  30. Altmetric Badge
    Chapter 29 Parameterized Edge Hamiltonicity
  31. Altmetric Badge
    Chapter 30 Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs
  32. Altmetric Badge
    Chapter 31 The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
  33. Altmetric Badge
    Chapter 32 Parameterized Algorithms for Graph Partitioning Problems
  34. Altmetric Badge
    Chapter 33 Between Treewidth and Clique-Width
  35. Altmetric Badge
    Chapter 34 A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 tweeter

Readers on

mendeley
4 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, Cham, January 2014
DOI 10.1007/978-3-319-12340-0
ISBNs
978-3-31-912339-4, 978-3-31-912340-0
Editors

Dieter Kratsch, Ioan Todinca

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 75%
Student > Master 1 25%
Readers by discipline Count As %
Mathematics 3 75%
Engineering 1 25%