↓ Skip to main content

WALCOM: Algorithms and Computation

Overview of attention for book
Cover of 'WALCOM: Algorithms and Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Graph Profile Realizations and Applications to Social Networks
  3. Altmetric Badge
    Chapter 2 Parameterized Computational Geometry via Decomposition Theorems
  4. Altmetric Badge
    Chapter 3 r-Gatherings on a Star
  5. Altmetric Badge
    Chapter 4 Topological Stability of Kinetic k-centers
  6. Altmetric Badge
    Chapter 5 A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract)
  7. Altmetric Badge
    Chapter 6 Elastic Properties of Carbon-Based Nanoscopic Structures
  8. Altmetric Badge
    Chapter 6 Maximum-Width Empty Square and Rectangular Annulus
  9. Altmetric Badge
    Chapter 6 Creative Placemaking: Leading Social Change with the Arts
  10. Altmetric Badge
    Chapter 7 Hard and Easy Instances of L-Tromino Tilings
  11. Altmetric Badge
    Chapter 8 The Prefix Fréchet Similarity
  12. Altmetric Badge
    Chapter 9 Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics
  13. Altmetric Badge
    Chapter 10 Optimal Partition of a Tree with Social Distance
  14. Altmetric Badge
    Chapter 11 Flat-Foldability for 1 × n Maps with Square/Diagonal Grid Patterns
  15. Altmetric Badge
    Chapter 12 (k, p)-Planarity: A Relaxation of Hybrid Planarity
  16. Altmetric Badge
    Chapter 13 Drawing Clustered Graphs on Disk Arrangements
  17. Altmetric Badge
    Chapter 14 Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components
  18. Altmetric Badge
    Chapter 15 On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs
  19. Altmetric Badge
    Chapter 16 The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver
  20. Altmetric Badge
    Chapter 17 A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition
  21. Altmetric Badge
    Chapter 18 Multilevel Planarity
  22. Altmetric Badge
    Chapter 19 Weighted Upper Edge Cover: Complexity and Approximability
  23. Altmetric Badge
    Chapter 20 Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem
  24. Altmetric Badge
    Chapter 21 Matching Sets of Line Segments
  25. Altmetric Badge
    Chapter 22 Efficient Algorithm for Box Folding
  26. Altmetric Badge
    Chapter 23 Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems
  27. Altmetric Badge
    Chapter 24 Greedy Consensus Tree and Maximum Greedy Consensus Tree Problems
  28. Altmetric Badge
    Chapter 25 A Two Query Adaptive Bitprobe Scheme Storing Five Elements
  29. Altmetric Badge
    Chapter 26 Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index
  30. Altmetric Badge
    Chapter 27 Towards Work-Efficient Parallel Parameterized Algorithms
  31. Altmetric Badge
    Chapter 28 Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots
  32. Altmetric Badge
    Chapter 29 Packing 2D Disks into a 3D Container
  33. Altmetric Badge
    Chapter 30 Covering and Packing of Rectilinear Subdivision
  34. Altmetric Badge
    Chapter 31 Minimum Membership Covering and Hitting
  35. Altmetric Badge
    Chapter 32 Capacitated Discrete Unit Disk Cover
Attention for Chapter 27: Towards Work-Efficient Parallel Parameterized Algorithms
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (65th percentile)
  • High Attention Score compared to outputs of the same age and source (81st percentile)

Mentioned by

5 tweeters

Readers on

3 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
Towards Work-Efficient Parallel Parameterized Algorithms
Chapter number 27
Book title
WALCOM: Algorithms and Computation
Published in
arXiv, December 2018
DOI 10.1007/978-3-030-10564-8_27
Book ISBNs
978-3-03-010563-1, 978-3-03-010564-8

Max Bannach, Malte Skambath, Till Tantau, Bannach, Max, Skambath, Malte, Tantau, Till

Twitter Demographics

The data shown below were collected from the profiles of 5 tweeters who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 33%
Student > Ph. D. Student 1 33%
Researcher 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Engineering 1 33%

Attention Score in Context

This research output has an Altmetric Attention Score of 4. 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 21 February 2019.
All research outputs
of 23,577,654 outputs
Outputs from arXiv
of 973,463 outputs
Outputs of similar age
of 438,659 outputs
Outputs of similar age from arXiv
of 24,903 outputs
Altmetric has tracked 23,577,654 research outputs across all sources so far. This one has received more attention than most of these and is in the 68th percentile.
So far Altmetric has tracked 973,463 research outputs from this source. They receive a mean Attention Score of 4.0. This one has done well, scoring higher than 83% of its peers.
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 438,659 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 65% of its contemporaries.
We're also able to compare this research output to 24,903 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 81% of its contemporaries.