↓ 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 Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions
  3. Altmetric Badge
    Chapter 2 On Bubble Generators in Directed Graphs
  4. Altmetric Badge
    Chapter 3 Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard
  5. Altmetric Badge
    Chapter 4 Hierarchical Partial Planarity
  6. Altmetric Badge
    Chapter 5 On the Relationship Between k -Planar and k -Quasi-Planar Graphs
  7. Altmetric Badge
    Chapter 6 Extension Complexity of Stable Set Polytopes of Bipartite Graphs
  8. Altmetric Badge
    Chapter 7 On the Number of Labeled Graphs of Bounded Treewidth
  9. Altmetric Badge
    Chapter 8 Uniquely Restricted Matchings and Edge Colorings
  10. Altmetric Badge
    Chapter 9 Defective Coloring on Classes of Perfect Graphs
  11. Altmetric Badge
    Chapter 10 Token Sliding on Chordal Graphs
  12. Altmetric Badge
    Chapter 11 Computing Maximum Cliques in $$B_2$$ -EPG Graphs
  13. Altmetric Badge
    Chapter 12 Intersection Graphs of Rays and Grounded Segments
  14. Altmetric Badge
    Chapter 13 On H -Topological Intersection Graphs
  15. Altmetric Badge
    Chapter 14 The Hardness of Embedding Grids and Walls
  16. Altmetric Badge
    Chapter 15 Approximately Coloring Graphs Without Long Induced Paths
  17. Altmetric Badge
    Chapter 16 New and Simple Algorithms for Stable Flow Problems
  18. Altmetric Badge
    Chapter 17 Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes
  19. Altmetric Badge
    Chapter 18 Finding Cut-Vertices in the Square Roots of a Graph
  20. Altmetric Badge
    Chapter 19 The Minimum Shared Edges Problem on Grid-Like Graphs
  21. Altmetric Badge
    Chapter 20 Linearly $$\chi $$ χ -Bounding $$(P_6,C_4)$$ ( P 6 , C 4 ) -Free Graphs
  22. Altmetric Badge
    Chapter 21 Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2
  23. Altmetric Badge
    Chapter 22 Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs
  24. Altmetric Badge
    Chapter 23 The Minimum Conflict-Free Row Split Problem Revisited
  25. Altmetric Badge
    Chapter 24 Drawing Planar Graphs with Few Geometric Primitives
  26. Altmetric Badge
    Chapter 25 M ixed D ominating S et : A Parameterized Perspective
  27. Altmetric Badge
    Chapter 26 Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
  28. Altmetric Badge
    Chapter 27 Extending Partial Representations of Trapezoid Graphs
  29. Altmetric Badge
    Chapter 28 On Low Rank-Width Colorings
  30. Altmetric Badge
    Chapter 29 On Strongly Chordal Graphs That Are Not Leaf Powers
  31. Altmetric Badge
    Chapter 30 New Results on Weighted Independent Domination
  32. Altmetric Badge
    Chapter 31 The Parameterized Complexity of the Equidomination Problem
  33. Altmetric Badge
    Chapter 32 Homothetic Triangle Contact Representations
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
2 tweeters
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 International Publishing, November 2017
DOI 10.1007/978-3-319-68705-6
ISBNs
978-3-31-968704-9, 978-3-31-968705-6
Editors

Bodlaender, Hans L., Woeginger, Gerhard J.

Twitter Demographics

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