↓ 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
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
8 X users
wikipedia
2 Wikipedia pages

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.
Title
Algorithms and Complexity
Published by
Springer International Publishing, June 2019
DOI 10.1007/978-3-030-17402-6
ISBNs
978-3-03-017401-9, 978-3-03-017402-6
Editors

Heggernes, Pinar

X Demographics

X Demographics

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