[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Algorithm Theory -- SWAT 2012

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

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Fedor V. Fomin

    1. Institute of Informatics, University of Bergen, Bergen, Norway

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Petteri Kaski

    1. Department of Information and Computer Science, Aalto University, Aalto, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SWAT 2012.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (34 papers)

  1. Front Matter

    Download chapter PDF

  2. α-Visibility

    • Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
    Pages 1-12

  3. Partial Matching between Surfaces Using Fréchet Distance

    • Jessica Sherette, Carola Wenk
    Pages 13-23

  4. A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares

    • Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno et al.
    Pages 24-35

  5. Watchman Routes for Lines and Segments

    • Adrian Dumitrescu, Joseph S. B. Mitchell, PaweÅ‚ Å»yliÅ„ski
    Pages 36-47

  6. Kinetic Pie Delaunay Graph and Its Applications

    • Mohammad Ali Abam, Zahed Rahmati, Alireza Zarei
    Pages 48-58

  7. Higher Order City Voronoi Diagrams

    • Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner
    Pages 59-70

  8. On Minimum Sum of Radii and Diameters Clustering

    • Babak Behsaz, Mohammad R. Salavatipour
    Pages 71-82

  9. A Simple Framework for the Generalized Nearest Neighbor Problem

    • Tomas Hruz, Marcel Schöngens
    Pages 83-94

  10. Deterministic Parameterized Connected Vertex Cover

    • Marek Cygan
    Pages 95-106

  11. Faster Parameterized Algorithms for Deletion to Split Graphs

    • Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai et al.
    Pages 107-118

  12. A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem

    • Eun Jung Kim, Christophe Paul, Geevarghese Philip
    Pages 119-130

  13. An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths

    • Yijie Han, Tadao Takaoka
    Pages 131-141

  14. Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths

    • Aistis Atminas, Vadim V. Lozin, Igor Razgon
    Pages 142-152

  15. Induced Disjoint Paths in AT-Free Graphs

    • Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
    Pages 153-164

  16. Effective Computation of Immersion Obstructions for Unions of Graph Classes

    • Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
    Pages 165-176

  17. Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain

    • Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang
    Pages 177-188

  18. Annotating Simplices with a Homology Basis and Its Applications

    • Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang
    Pages 189-200

  19. Do Directional Antennas Facilitate in Reducing Interferences?

    • Rom Aschner, Matthew J. Katz, Gila Morgenstern
    Pages 201-212

  20. Minimum Convex Partitions and Maximum Empty Polytopes

    • Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth
    Pages 213-224
Back to top

Other volumes

  1. Algorithm Theory – SWAT 2012

Editors and Affiliations

  • Institute of Informatics, University of Bergen, Bergen, Norway

    Fedor V. Fomin

  • Department of Information and Computer Science, Aalto University, Aalto, Finland

    Petteri Kaski

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation