↓ 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 Account on Intervals
  3. Altmetric Badge
    Chapter 2 Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance
  4. Altmetric Badge
    Chapter 3 Alternating Reachability and Integer Sum of Closed Alternating Trails
  5. Altmetric Badge
    Chapter 4 Student Poster Session
  6. Altmetric Badge
    Chapter 5 Triangulation and Clique Separator Decomposition of Claw-Free Graphs
  7. Altmetric Badge
    Chapter 6 Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs
  8. Altmetric Badge
    Chapter 7 Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs
  9. Altmetric Badge
    Chapter 8 Optimization Problems in Dotted Interval Graphs
  10. Altmetric Badge
    Chapter 9 The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)
  11. Altmetric Badge
    Chapter 10 Solutions for the Stable Roommates Problem with Payments
  12. Altmetric Badge
    Chapter 11 Which Multi-peg Tower of Hanoi Problems Are Exponential?
  13. Altmetric Badge
    Chapter 12 h -Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
  14. Altmetric Badge
    Chapter 13 The Duals of Upward Planar Graphs on Cylinders
  15. Altmetric Badge
    Chapter 14 The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
  16. Altmetric Badge
    Chapter 15 Determining the L (2,1)-Span in Polynomial Space
  17. Altmetric Badge
    Chapter 16 On the Minimum Degree Up to Local Complementation: Bounds and Complexity
  18. Altmetric Badge
    Chapter 17 On the Stable Degree of Graphs
  19. Altmetric Badge
    Chapter 18 A 9 k Kernel for Nonseparating Independent Set in Planar Graphs
  20. Altmetric Badge
    Chapter 19 Parameterized Algorithms for Even Cycle Transversal
  21. Altmetric Badge
    Chapter 20 Bisections above Tight Lower Bounds
  22. Altmetric Badge
    Chapter 21 On Group Feedback Vertex Set Parameterized by the Size of the Cutset
  23. Altmetric Badge
    Chapter 22 Fault Tolerant Additive Spanners
  24. Altmetric Badge
    Chapter 23 Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications
  25. Altmetric Badge
    Chapter 24 Approximating Infeasible 2VPI-Systems
  26. Altmetric Badge
    Chapter 25 Hydras: Directed Hypergraphs and Horn Formulas
  27. Altmetric Badge
    Chapter 26 Minimum Weight Dynamo and Fast Opinion Spreading
  28. Altmetric Badge
    Chapter 27 Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3 -Convexity
  29. Altmetric Badge
    Chapter 28 Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
  30. Altmetric Badge
    Chapter 29 On the Recognition of k -Equistable Graphs
  31. Altmetric Badge
    Chapter 30 Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs
  32. Altmetric Badge
    Chapter 31 Parameterized Domination in Circle Graphs
  33. Altmetric Badge
    Chapter 32 How to Eliminate a Graph
  34. Altmetric Badge
    Chapter 33 On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

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, October 2012
DOI 10.1007/978-3-642-34611-8
ISBNs
978-3-64-234610-1, 978-3-64-234611-8
Editors

Golumbic, Martin Charles, Stern, Michal, Levy, Avivit, Morgenstern, Gila

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 %
United States 3 4%
Brazil 2 3%
Portugal 1 1%
Italy 1 1%
France 1 1%
Switzerland 1 1%
Japan 1 1%
Ukraine 1 1%
Hong Kong 1 1%
Other 1 1%
Unknown 62 83%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 28 37%
Student > Master 12 16%
Researcher 11 15%
Professor 5 7%
Student > Doctoral Student 4 5%
Other 15 20%
Readers by discipline Count As %
Computer Science 43 57%
Mathematics 15 20%
Engineering 6 8%
Physics and Astronomy 3 4%
Agricultural and Biological Sciences 2 3%
Other 6 8%