Algorithm Theory – SWAT 2012

13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings

  • Fedor V. Fomin
  • Petteri Kaski

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7357)

Table of contents

  1. Front Matter
  2. Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
    Pages 1-12
  3. Jessica Sherette, Carola Wenk
    Pages 13-23
  4. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno et al.
    Pages 24-35
  5. Adrian Dumitrescu, Joseph S. B. Mitchell, Paweł Żyliński
    Pages 36-47
  6. Mohammad Ali Abam, Zahed Rahmati, Alireza Zarei
    Pages 48-58
  7. Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner
    Pages 59-70
  8. Babak Behsaz, Mohammad R. Salavatipour
    Pages 71-82
  9. Tomas Hruz, Marcel Schöngens
    Pages 83-94
  10. Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai et al.
    Pages 107-118
  11. Eun Jung Kim, Christophe Paul, Geevarghese Philip
    Pages 119-130
  12. Aistis Atminas, Vadim V. Lozin, Igor Razgon
    Pages 142-152
  13. Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
    Pages 153-164
  14. Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
    Pages 165-176
  15. Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang
    Pages 189-200
  16. Rom Aschner, Matthew J. Katz, Gila Morgenstern
    Pages 201-212
  17. Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth
    Pages 213-224

About these proceedings


This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. The 34 papers were carefully reviewed and selected from a total of 127 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.


approximation algorithms complexity graph algorithms pattern matching string algorithms

Editors and affiliations

  • Fedor V. Fomin
    • 1
  • Petteri Kaski
    • 2
  1. 1.Institute of InformaticsUniversity of BergenBergenNorway
  2. 2.Department of Information and Computer ScienceAalto UniversityAaltoFinland

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-31154-3
  • Online ISBN 978-3-642-31155-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Energy, Utilities & Environment