↓ Skip to main content

Algorithms and Discrete Applied Mathematics

Overview of attention for book
Algorithms and Discrete Applied Mathematics
Springer International Publishing

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Complexity of Restricted Variant of Star Colouring
  3. Altmetric Badge
    Chapter 2 Partitioning Cographs into Two Forests and One Independent Set
  4. Altmetric Badge
    Chapter 3 Monitoring the Edges of a Graph Using Distances
  5. Altmetric Badge
    Chapter 4 The Lexicographic Method for the Threshold Cover Problem
  6. Altmetric Badge
    Chapter 5 Approximating Modular Decomposition Is Hard
  7. Altmetric Badge
    Chapter 6 Vertex-Edge Domination in Unit Disk Graphs
  8. Altmetric Badge
    Chapter 7 Geometric Planar Networks on Bichromatic Points
  9. Altmetric Badge
    Chapter 8 Hardness Results of Global Total k-Domination Problem in Graphs
  10. Altmetric Badge
    Chapter 9 Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes
  11. Altmetric Badge
    Chapter 10 Maximum Weighted Edge Biclique Problem on Bipartite Graphs
  12. Altmetric Badge
    Chapter 11 Determining Number of Generalized and Double Generalized Petersen Graph
  13. Altmetric Badge
    Chapter 12 Self-centeredness of Generalized Petersen Graphs
  14. Altmetric Badge
    Chapter 13 Weak Roman Bondage Number of a Graph
  15. Altmetric Badge
    Chapter 14 On the Geodetic and Hull Numbers of Shadow Graphs
  16. Altmetric Badge
    Chapter 15 Indicated Coloring of Complete Expansion and Lexicographic Product of Graphs
  17. Altmetric Badge
    Chapter 16 Smallest $$C_{2l+1}$$-Critical Graphs of Odd-Girth $$2k+1$$
  18. Altmetric Badge
    Chapter 17 Ramsey Numbers for Line Graphs
  19. Altmetric Badge
    Chapter 18 $$\varDelta $$-Convexity Number and $$\varDelta $$-Number of Graphs and Graph Products
  20. Altmetric Badge
    Chapter 19 On Cartesian Products of Signed Graphs
  21. Altmetric Badge
    Chapter 20 List Distinguishing Number of $$p^{\text {th}}$$ Power of Hypercube and Cartesian Powers of a Graph
  22. Altmetric Badge
    Chapter 21 On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs
  23. Altmetric Badge
    Chapter 22 The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10
  24. Altmetric Badge
    Chapter 23 On the Minimum Satisfiability Problem
  25. Altmetric Badge
    Chapter 24 Waiting for Trains: Complexity Results
  26. Altmetric Badge
    Chapter 25 Oriented Diameter of Star Graphs
  27. Altmetric Badge
    Chapter 26 Gathering over Meeting Nodes in Infinite Grid
  28. Altmetric Badge
    Chapter 27 0-1 Timed Matching in Bipartite Temporal Graphs
  29. Altmetric Badge
    Chapter 28 Arbitrary Pattern Formation by Opaque Fat Robots with Lights
  30. Altmetric Badge
    Chapter 29 Greedy Universal Cycle Constructions for Weak Orders
  31. Altmetric Badge
    Chapter 30 A New Model in Firefighting Theory
  32. Altmetric Badge
    Chapter 31 An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties
  33. Altmetric Badge
    Chapter 32 Overlaying a Hypergraph with a Graph with Bounded Maximum Degree
  34. Altmetric Badge
    Chapter 33 Parameterized Algorithms for Directed Modular Width
  35. Altmetric Badge
    Chapter 34 On the Parameterized Complexity of Spanning Trees with Small Vertex Covers
  36. Altmetric Badge
    Chapter 35 Minimum Conflict Free Colouring Parameterized by Treewidth
  37. Altmetric Badge
    Chapter 36 Planar Projections of Graphs
  38. Altmetric Badge
    Chapter 37 New Algorithms and Bounds for Halving Pseudolines
  39. Altmetric Badge
    Chapter 38 Algorithms for Radon Partitions with Tolerance
Attention for Chapter 36: Planar Projections of Graphs
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
1 Dimensions
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
Planar Projections of Graphs
Chapter number 36
Book title
Algorithms and Discrete Applied Mathematics
Published in
arXiv, January 2020
DOI 10.1007/978-3-030-39219-2_36
Book ISBNs
978-3-03-039218-5, 978-3-03-039219-2
Authors

N. R. Aravind, Udit Maniyar, Aravind, N. R., Maniyar, Udit

X Demographics

X Demographics

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

Attention Score in Context

This research output has an Altmetric Attention Score of 1. 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 06 October 2020.
All research outputs
#20,601,627
of 23,189,371 outputs
Outputs from arXiv
#682,013
of 954,780 outputs
Outputs of similar age
#377,616
of 452,022 outputs
Outputs of similar age from arXiv
#18,805
of 27,774 outputs
Altmetric has tracked 23,189,371 research outputs across all sources so far. This one is in the 1st percentile – i.e., 1% of other outputs scored the same or lower than it.
So far Altmetric has tracked 954,780 research outputs from this source. They receive a mean Attention Score of 3.9. This one is in the 1st percentile – i.e., 1% 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 452,022 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 27,774 others from the same source and published within six weeks on either side of this one. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.