↓ Skip to main content

Algorithms and Complexity

Overview of attention for book
Cover of 'Algorithms and Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Quadratic Vertex Kernel for Split Vertex Deletion
  3. Altmetric Badge
    Chapter 2 The Temporal Explorer Who Returns to the Base
  4. Altmetric Badge
    Chapter 3 Minimum Convex Partition of Point Sets
  5. Altmetric Badge
    Chapter 4 Parameterized Complexity of Safe Set
  6. Altmetric Badge
    Chapter 5 Parameterized Complexity of Diameter
  7. Altmetric Badge
    Chapter 6 Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints
  8. Altmetric Badge
    Chapter 7 Project Games
  9. Altmetric Badge
    Chapter 8 Subgraph Isomorphism on Graph Classes that Exclude a Substructure
  10. Altmetric Badge
    Chapter 9 Your Rugby Mates Don’t Need to Know Your Colleagues: Triadic Closure with Edge Colors
  11. Altmetric Badge
    Chapter 10 $$k$$ -cuts on a Path
  12. Altmetric Badge
    Chapter 11 Extension of Vertex Cover and Independent Set in Some Classes of Graphs
  13. Altmetric Badge
    Chapter 12 On Hedonic Games with Common Ranking Property
  14. Altmetric Badge
    Chapter 13 Complexity of Scheduling for DARP with Soft Ride Times
  15. Altmetric Badge
    Chapter 14 Vertex Deletion on Split Graphs: Beyond 4-Hitting Set
  16. Altmetric Badge
    Chapter 15 Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements
  17. Altmetric Badge
    Chapter 16 Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability (Extended Abstract)
  18. Altmetric Badge
    Chapter 17 Searching by Heterogeneous Agents
  19. Altmetric Badge
    Chapter 18 Finding a Mediocre Player
  20. Altmetric Badge
    Chapter 19 Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation
  21. Altmetric Badge
    Chapter 20 The Parameterized Position Heap of a Trie
  22. Altmetric Badge
    Chapter 21 Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set
  23. Altmetric Badge
    Chapter 22 Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
  24. Altmetric Badge
    Chapter 23 Turing Tumble Is P ( SPACE )-Complete
  25. Altmetric Badge
    Chapter 24 Linear-Time In-Place DFS and BFS on the Word RAM
  26. Altmetric Badge
    Chapter 25 A Faster Algorithm for the Strongly Stable b -Matching Problem
  27. Altmetric Badge
    Chapter 26 Eternal Domination in Grids
  28. Altmetric Badge
    Chapter 27 On the Necessary Memory to Compute the Plurality in Multi-agent Systems
  29. Altmetric Badge
    Chapter 28 Complexity of Vertex Switching on Edge-Bicolored Graphs
  30. Altmetric Badge
    Chapter 29 Independent Lazy Better-Response Dynamics on Network Games
  31. Altmetric Badge
    Chapter 30 Subset Feedback Vertex Set in Chordal and Split Graphs
Attention for Chapter 22: Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Good Attention Score compared to outputs of the same age and source (73rd percentile)

Mentioned by

twitter
6 X users

Citations

dimensions_citation
1 Dimensions

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
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
Chapter number 22
Book title
Algorithms and Complexity
Published in
arXiv, May 2019
DOI 10.1007/978-3-030-17402-6_22
Book ISBNs
978-3-03-017401-9, 978-3-03-017402-6
Authors

Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara

X Demographics

X Demographics

The data shown below were collected from the profiles of 6 X users 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 %
Student > Bachelor 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 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 31 January 2019.
All research outputs
#14,206,318
of 24,002,307 outputs
Outputs from arXiv
#240,732
of 1,011,770 outputs
Outputs of similar age
#176,843
of 353,332 outputs
Outputs of similar age from arXiv
#7,282
of 27,980 outputs
Altmetric has tracked 24,002,307 research outputs across all sources so far. This one is in the 40th percentile – i.e., 40% of other outputs scored the same or lower than it.
So far Altmetric has tracked 1,011,770 research outputs from this source. They receive a mean Attention Score of 4.0. This one has done well, scoring higher than 75% 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 353,332 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 49th percentile – i.e., 49% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 27,980 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 73% of its contemporaries.