↓ Skip to main content

Combinatorial Algorithms

Overview of attention for book
Cover of 'Combinatorial Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
  3. Altmetric Badge
    Chapter 2 On the Maximal Sum of Exponents of Runsin a String
  4. Altmetric Badge
    Chapter 3 Path-Based Supports for Hypergraphs
  5. Altmetric Badge
    Chapter 4 On Improved Exact Algorithms for L (2,1)-Labeling of Graphs
  6. Altmetric Badge
    Chapter 5 Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
  7. Altmetric Badge
    Chapter 6 Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three
  8. Altmetric Badge
    Chapter 7 Shortest Paths between Shortest Paths and Independent Sets
  9. Altmetric Badge
    Chapter 8 Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism
  10. Altmetric Badge
    Chapter 9 Dichotomy for Coloring of Dart Graphs
  11. Altmetric Badge
    Chapter 10 Worst Case Efficient Single and Multiple String Matching in the RAM Model
  12. Altmetric Badge
    Chapter 11 The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2
  13. Altmetric Badge
    Chapter 12 Upper and Lower I/O Bounds for Pebbling r-Pyramids
  14. Altmetric Badge
    Chapter 13 Combinatorial Algorithms
  15. Altmetric Badge
    Chapter 14 The Complexity Status of Problems Related to Sparsest Cuts
  16. Altmetric Badge
    Chapter 15 On Approximation Complexity of Metric Dimension Problem
  17. Altmetric Badge
    Chapter 16 Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates
  18. Altmetric Badge
    Chapter 17 Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
  19. Altmetric Badge
    Chapter 18 Computing Role Assignments of Proper Interval Graphs in Polynomial Time
  20. Altmetric Badge
    Chapter 19 Efficient Connectivity Testing of Hypercubic Networks with Faults
  21. Altmetric Badge
    Chapter 20 Reductions of Matrices Associated with Nowhere-Zero Flows
  22. Altmetric Badge
    Chapter 21 Combinatorial Algorithms
  23. Altmetric Badge
    Chapter 22 Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree
  24. Altmetric Badge
    Chapter 23 Skip Lift: A Probabilistic Alternative to Red-Black Trees
  25. Altmetric Badge
    Chapter 24 On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
  26. Altmetric Badge
    Chapter 25 Parameterized Complexity of k -Anonymity: Hardness and Tractability
  27. Altmetric Badge
    Chapter 26 On Fast Enumeration of Pseudo Bicliques
  28. Altmetric Badge
    Chapter 27 Efficient Chaining of Seeds in Ordered Trees
  29. Altmetric Badge
    Chapter 28 On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
  30. Altmetric Badge
    Chapter 29 Recognition of Probe Ptolemaic Graphs
  31. Altmetric Badge
    Chapter 30 Graphs of Separability at Most Two: Structural Characterizations and Their Consequences
  32. Altmetric Badge
    Chapter 31 On Antimagic Labeling for Generalized Web and Flower Graphs
  33. Altmetric Badge
    Chapter 32 Chains-into-Bins Processes
  34. Altmetric Badge
    Chapter 33 Complexity of Locally Injective Homomorphism to the Theta Graphs
  35. Altmetric Badge
    Chapter 34 Ranking and Drawing in Subexponential Time
  36. Altmetric Badge
    Chapter 35 Efficient Reconstruction of RC-Equivalent Strings
  37. Altmetric Badge
    Chapter 36 Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures
  38. Altmetric Badge
    Chapter 37 The Cover Time of Cartesian Product Graphs
  39. Altmetric Badge
    Chapter 38 Dictionary-Symbolwise Flexible Parsing
  40. Altmetric Badge
    Chapter 39 Regular Language Constrained Sequence Alignment Revisited
Attention for Chapter 28: On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
5 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.
Chapter title
On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
Chapter number 28
Book title
Combinatorial Algorithms
Published in
ADS, July 2010
DOI 10.1007/978-3-642-19222-7_28
Book ISBNs
978-3-64-219221-0, 978-3-64-219222-7
Authors

Boris Horvat, Jan Kratochvíl, Tomaž Pisanski, Horvat, Boris, Kratochvíl, Jan, Pisanski, Tomaž

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
France 1 20%
Unknown 4 80%

Demographic breakdown

Readers by professional status Count As %
Researcher 2 40%
Professor > Associate Professor 1 20%
Lecturer 1 20%
Other 1 20%
Readers by discipline Count As %
Computer Science 2 40%
Mathematics 1 20%
Agricultural and Biological Sciences 1 20%
Earth and Planetary Sciences 1 20%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 25 May 2015.
All research outputs
#7,554,098
of 23,043,346 outputs
Outputs from ADS
#9,313
of 37,451 outputs
Outputs of similar age
#33,769
of 94,604 outputs
Outputs of similar age from ADS
#118
of 386 outputs
Altmetric has tracked 23,043,346 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 37,451 research outputs from this source. They receive a mean Attention Score of 4.6. This one is in the 29th percentile – i.e., 29% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 94,604 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 23rd percentile – i.e., 23% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 386 others from the same source and published within six weeks on either side of this one. This one is in the 22nd percentile – i.e., 22% of its contemporaries scored the same or lower than it.