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

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 (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
  3. Altmetric Badge
    Chapter 2 Memory Efficient Anonymous Graph Exploration
  4. Altmetric Badge
    Chapter 3 Algorithmic Meta Theorems
  5. Altmetric Badge
    Chapter 4 A Most General Edge Elimination Polynomial
  6. Altmetric Badge
    Chapter 5 Approximating the Metric TSP in Linear Time
  7. Altmetric Badge
    Chapter 6 The Valve Location Problem in Simple Network Topologies
  8. Altmetric Badge
    Chapter 7 A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
  9. Altmetric Badge
    Chapter 8 On the Pseudo-achromatic Number Problem
  10. Altmetric Badge
    Chapter 9 Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
  11. Altmetric Badge
    Chapter 10 Faster Exact Bandwidth
  12. Altmetric Badge
    Chapter 11 Additive Spanners for Circle Graphs and Polygonal Graphs
  13. Altmetric Badge
    Chapter 12 Upward Straight-Line Embeddings of Directed Graphs into Point Sets
  14. Altmetric Badge
    Chapter 13 Complexity of the Packing Coloring Problem for Trees
  15. Altmetric Badge
    Chapter 14 Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
  16. Altmetric Badge
    Chapter 15 A Lower Bound on the Area Requirements of Series-Parallel Graphs
  17. Altmetric Badge
    Chapter 16 On Independent Sets and Bicliques in Graphs
  18. Altmetric Badge
    Chapter 17 Evaluations of Graph Polynomials
  19. Altmetric Badge
    Chapter 18 Parameterized Complexity for Domination Problems on Degenerate Graphs
  20. Altmetric Badge
    Chapter 19 An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph
  21. Altmetric Badge
    Chapter 20 Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
  22. Altmetric Badge
    Chapter 21 The Rank-Width of the Square Grid
  23. Altmetric Badge
    Chapter 22 Improved Upper Bounds for Partial Vertex Cover
  24. Altmetric Badge
    Chapter 23 On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
  25. Altmetric Badge
    Chapter 24 Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
  26. Altmetric Badge
    Chapter 25 What Is between Chordal and Weakly Chordal Graphs?
  27. Altmetric Badge
    Chapter 26 Parameterized Graph Cleaning Problems
  28. Altmetric Badge
    Chapter 27 Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
  29. Altmetric Badge
    Chapter 28 Fast Robber in Planar Graphs
  30. Altmetric Badge
    Chapter 29 From a Circular-Arc Model to a Proper Circular-Arc Model
  31. Altmetric Badge
    Chapter 30 Digraph Decompositions and Monotonicity in Digraph Searching
  32. Altmetric Badge
    Chapter 31 Searching for a Visible, Lazy Fugitive
  33. Altmetric Badge
    Chapter 32 A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
  34. Altmetric Badge
    Chapter 33 Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
Attention for Chapter 29: From a Circular-Arc Model to a Proper Circular-Arc Model
Altmetric Badge

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
2 Mendeley
Summary Dimensions citations
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.
Chapter title
From a Circular-Arc Model to a Proper Circular-Arc Model
Chapter number 29
Book title
Graph-Theoretic Concepts in Computer Science
Published by
Springer, Berlin, Heidelberg, June 2008
DOI 10.1007/978-3-540-92248-3_29
Book ISBNs
978-3-54-092247-6, 978-3-54-092248-3
Authors

Yahav Nussbaum, Nussbaum, Yahav

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 50%
Lecturer 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Agricultural and Biological Sciences 1 50%

This page is provided by Altmetric.