↓ Skip to main content

Algorithms and Discrete Applied Mathematics

Overview of attention for book
Cover of 'Algorithms and Discrete Applied Mathematics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Randomization for Efficient Dynamic Graph Algorithms
  3. Altmetric Badge
    Chapter 2 Algorithms for Problems on Maximum Density Segment
  4. Altmetric Badge
    Chapter 3 Distance Spectral Radius of Some k -partitioned Transmission Regular Graphs
  5. Altmetric Badge
    Chapter 4 Color Spanning Objects: Algorithms and Hardness Results
  6. Altmetric Badge
    Chapter 5 Algorithms and Discrete Applied Mathematics
  7. Altmetric Badge
    Chapter 6 On the Complexity Landscape of the Domination Chain
  8. Altmetric Badge
    Chapter 7 On the Probability of Being Synchronizable
  9. Altmetric Badge
    Chapter 8 Linear-Time Fitting of a k -Step Function
  10. Altmetric Badge
    Chapter 9 Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications
  11. Altmetric Badge
    Chapter 10 Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions
  12. Altmetric Badge
    Chapter 11 Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints
  13. Altmetric Badge
    Chapter 12 Lower Bounds on the Dilation of Plane Spanners
  14. Altmetric Badge
    Chapter 13 Lattice Spanners of Low Degree
  15. Altmetric Badge
    Chapter 14 AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables
  16. Altmetric Badge
    Chapter 15 Approximation Algorithms for Cumulative VRP with Stochastic Demands
  17. Altmetric Badge
    Chapter 16 Some Distance Antimagic Labeled Graphs
  18. Altmetric Badge
    Chapter 17 A New Construction of Broadcast Graphs
  19. Altmetric Badge
    Chapter 18 Improved Algorithm for Maximum Independent Set on Unit Disk Graph
  20. Altmetric Badge
    Chapter 19 Independent Sets in Classes Related to Chair-Free Graphs
  21. Altmetric Badge
    Chapter 20 Cyclic Codes over Galois Rings
  22. Altmetric Badge
    Chapter 21 On the Center Sets of Some Graph Classes
  23. Altmetric Badge
    Chapter 22 On Irreducible No-hole L (2, 1)-labelings of Hypercubes and Triangular Lattices
  24. Altmetric Badge
    Chapter 23 Medians of Permutations: Building Constraints
  25. Altmetric Badge
    Chapter 24 b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results
  26. Altmetric Badge
    Chapter 25 m -Gracefulness of Graphs
  27. Altmetric Badge
    Chapter 26 Domination Parameters in Hypertrees
  28. Altmetric Badge
    Chapter 27 Complexity of Steiner Tree in Split Graphs - Dichotomy Results
  29. Altmetric Badge
    Chapter 28 Relative Clique Number of Planar Signed Graphs
  30. Altmetric Badge
    Chapter 29 The cd-Coloring of Graphs
  31. Altmetric Badge
    Chapter 30 Characterizations of H -graphs
  32. Altmetric Badge
    Chapter 31 On the Power Domination Number of Graph Products
Attention for Chapter 5: Algorithms and Discrete Applied Mathematics
Altmetric Badge

Mentioned by

twitter
1 X user

Readers on

mendeley
1 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
Algorithms and Discrete Applied Mathematics
Chapter number 5
Book title
Algorithms and Discrete Applied Mathematics
Published in
Lecture notes in computer science, January 2016
DOI 10.1007/978-3-319-29221-2_5
Book ISBNs
978-3-31-929220-5, 978-3-31-929221-2
Authors

Devsi Bantva

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.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Other 1 100%
Readers by discipline Count As %
Computer Science 1 100%
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 04 October 2016.
All research outputs
#20,344,065
of 22,890,496 outputs
Outputs from Lecture notes in computer science
#6,991
of 8,127 outputs
Outputs of similar age
#330,782
of 393,722 outputs
Outputs of similar age from Lecture notes in computer science
#501
of 581 outputs
Altmetric has tracked 22,890,496 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 8,127 research outputs from this source. They receive a mean Attention Score of 5.0. 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 393,722 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 581 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.