Algorithm Theory -- SWAT 2014

1. Front Matter

   PDF

2. I/O-Efficient Range Minima Queries

   • Peyman Afshani, Nodari Sitchinava

   Pages 1-12

3. Online Makespan Minimization with Parallel Schedules

   • Susanne Albers, Matthias Hellwig

   Pages 13-25

4. Expected Linear Time Sorting for Word Size Ω(log² n loglogn)

   • Djamal Belazzougui, Gerth Stølting Brodal, Jesper Sindahl Nielsen

   Pages 26-37

5. Amortized Analysis of Smooth Quadtrees in All Dimensions

   • Huck Bennett, Chee Yap

   Pages 38-49

6. New Approximability Results for the Robust k-Median Problem

   • Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann

   Pages 50-61

7. Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs

   • Therese Biedl

   Pages 62-73

8. Approximating the Revenue Maximization Problem with Sharp Demands

   • Vittorio Bilò, Michele Flammini, Gianpiero Monaco

   Pages 74-85

9. Reconfiguring Independent Sets in Claw-Free Graphs

   • Paul Bonsma, Marcin Kamiński, Marcin Wrochna

   Pages 86-97

10. Competitive Online Routing on Delaunay Triangulations

    • Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian

    Pages 98-109

11. Optimal Planar Orthogonal Skyline Counting Queries

    • Gerth Stølting Brodal, Kasper Green Larsen

    Pages 110-121

12. B-slack Trees: Space Efficient B-Trees

    • Trevor Brown

    Pages 122-133

13. Approximately Minwise Independence with Twisted Tabulation

    • Søren Dahlgaard, Mikkel Thorup

    Pages 134-145

14. Separability of Imprecise Points

    • Mark de Berg, Ali D. Mehrabi, Farnaz Sheikhi

    Pages 146-157

15. Line-Distortion, Bandwidth and Path-Length of a Graph

    • Feodor F. Dragan, Ekkehard Köhler, Arne Leitert

    Pages 158-169

16. Colorful Bin Packing

    • György Dósa, Leah Epstein

    Pages 170-181

17. Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques

    • Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca

    Pages 182-193

18. Win-Win Kernelization for Degree Sequence Completion Problems

    • Vincent Froese, André Nichterlein, Rolf Niedermeier

    Pages 194-205

19. On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem

    • Toshihiro Fujito

    Pages 206-216

20. Covering Problems in Edge- and Node-Weighted Graphs

    • Takuro Fukunaga

    Pages 217-228

This book constitutes the refereed proceedings of the 14th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014, held in Copenhagen, Denmark, in July 2014. The 33 papers were carefully reviewed and selected from a total of 134 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures including but not limited to approximation algorithms, parameterized algorithms, computational biology, computational geometry and topology, distributed algorithms, external-memory algorithms, exponential algorithms, graph algorithms, online algorithms, optimization algorithms, randomized algorithms, streaming algorithms, string algorithms, sublinear algorithms and algorithmic game theory.

• algorithmic game theory
• aproximation algorithms
• aproximation algorithms
• computational biology
• computational biology
• concurrent tree
• data structures
• distributed algorithms
• distributed algorithms
• graph algorithms analysis
• optimization algorithms
• parameterized complexity and exact algorithms
• parameterized complexity and exact algorithms
• pattern matching
• pattern matching
• algorithm analysis and problem complexity

“All texts are of very great quality. … an important work not only for the quality and quantity of the knowledge available, but also for the aid to the development of schemes and methodologies of disciplined and organized work, very important in the field of algorithm theory. … imperative for professionals, academics and simple practitioners who wish to be aware of the current knowledge and state-of-the-art results in algorithm theory.” (Prof. Dr. Manuel Alberto M. Ferreira, Acta Scientiae et Intellectus, Vol. 3, 2017)

• Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA

  R. Ravi

• DTU Informatics, Kongens Lyngby, Denmark

  Inge Li Gørtz

Policies and ethics