Algorithm Theory - SWAT 2004

9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004. Proceedings

Editors:

ISBN: 978-3-540-22339-9 (Print) 978-3-540-27810-8 (Online)

Table of contents (42 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Contributions

    1. No Access

      Book Chapter

      Pages 1-2

      Design and Analysis of Dynamic Multithreaded Algorithms

    2. No Access

      Book Chapter

      Pages 3-13

      Cache-Oblivious Algorithms and Data Structures

  3. Refereed Contributions

    1. No Access

      Book Chapter

      Pages 14-25

      Getting the Best Response for Your Erg

    2. No Access

      Book Chapter

      Pages 26-38

      Auctions with Budget Constraints

    3. No Access

      Book Chapter

      Pages 39-50

      Tight Approximability Results for Test Set Problems in Bioinformatics

    4. No Access

      Book Chapter

      Pages 51-63

      Robust Subgraphs for Trees and Paths

    5. No Access

      Book Chapter

      Pages 64-76

      Collective Tree Spanners of Graphs

    6. No Access

      Book Chapter

      Pages 77-89

      Optimally Competitive List Batching

    7. No Access

      Book Chapter

      Pages 90-101

      The Relative Worst Order Ratio Applied to Seat Reservation

    8. No Access

      Book Chapter

      Pages 102-113

      Online Maintenance of k-Medians and k-Covers on a Line

    9. No Access

      Book Chapter

      Pages 114-126

      Matching Polyhedral Terrains Using Overlays of Envelopes

    10. No Access

      Book Chapter

      Pages 127-137

      Independent Set of Intersection Graphs of Convex Objects in 2D

    11. No Access

      Book Chapter

      Pages 138-149

      Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion

    12. No Access

      Book Chapter

      Pages 150-160

      Construction of the Nearest Neighbor Embracing Graph of a Point Set

    13. No Access

      Book Chapter

      Pages 161-173

      Connectivity of Graphs Under Edge Flips

    14. No Access

      Book Chapter

      Pages 174-186

      Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity

    15. No Access

      Book Chapter

      Pages 187-198

      A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension

    16. No Access

      Book Chapter

      Pages 199-211

      Railway Delay Management: Exploring Its Algorithmic Complexity

    17. No Access

      Book Chapter

      Pages 212-222

      Layered Heaps

    18. No Access

      Book Chapter

      Pages 223-235

      Melding Priority Queues

previous Page of 3