Algorithms and Complexity

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Reliable and Efficient Geometric Computing
3. Altmetric Badge
   Chapter 2 Beware of the Model: Reflections on Algorithmic Research
4. Altmetric Badge
   Chapter 3 On Search Problems in Complexity Theory and in Logic (Abstract)
5. Altmetric Badge
   Chapter 4 Covering a Set of Points with a Minimum Number of Lines
6. Altmetric Badge
   Chapter 5 Approximation Algorithms for Capacitated Rectangle Stabbing
7. Altmetric Badge
   Chapter 6 In-Place Randomized Slope Selection
8. Altmetric Badge
   Chapter 7 Quadratic Programming and Combinatorial Minimum Weight Product Problems
9. Altmetric Badge
   Chapter 8 Counting All Solutions of Minimum Weight Exact Satisfiability
10. Altmetric Badge
    Chapter 9 Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
11. Altmetric Badge
    Chapter 10 Network Discovery and Verification with Distance Queries
12. Altmetric Badge
    Chapter 11 Deciding the FIFO Stability of Networks in Polynomial Time
13. Altmetric Badge
    Chapter 12 Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates
14. Altmetric Badge
    Chapter 13 Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
15. Altmetric Badge
    Chapter 14 Gathering Algorithms on Paths Under Interference Constraints
16. Altmetric Badge
    Chapter 15 On the Hardness of Range Assignment Problems
17. Altmetric Badge
    Chapter 16 Black Hole Search in Asynchronous Rings Using Tokens
18. Altmetric Badge
    Chapter 17 On Broadcast Scheduling with Limited Energy
19. Altmetric Badge
    Chapter 18 A Near Optimal Scheduler for On-Demand Data Broadcasts
20. Altmetric Badge
    Chapter 19 Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
21. Altmetric Badge
    Chapter 20 Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
22. Altmetric Badge
    Chapter 21 Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
23. Altmetric Badge
    Chapter 22 Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems
24. Altmetric Badge
    Chapter 23 An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
25. Altmetric Badge
    Chapter 24 On the Minimum Common Integer Partition Problem
26. Altmetric Badge
    Chapter 25 Matching Subsequences in Trees
27. Altmetric Badge
    Chapter 26 Distance Approximating Trees: Complexity and Algorithms
28. Altmetric Badge
    Chapter 27 How to Pack Directed Acyclic Graphs into Small Blocks
29. Altmetric Badge
    Chapter 28 On-Line Coloring of H-Free Bipartite Graphs
30. Altmetric Badge
    Chapter 29 Distributed Approximation Algorithms for Planar Graphs
31. Altmetric Badge
    Chapter 30 A New NC-Algorithm for Finding a Perfect Matching in d -Regular Bipartite Graphs When d Is Small
32. Altmetric Badge
    Chapter 31 Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
33. Altmetric Badge
    Chapter 32 Parameterized Algorithms for Hitting Set : The Weighted Case
34. Altmetric Badge
    Chapter 33 Fixed-Parameter Tractable Generalizations of Cluster Editing
35. Altmetric Badge
    Chapter 34 The Linear Arrangement Problem Parameterized Above Guaranteed Value
36. Altmetric Badge
    Chapter 35 Universal Relations and #P-Completeness
37. Altmetric Badge
    Chapter 36 Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes