Skip to main content
SpringerLink
Log in
Book cover

Experimental Algorithms

13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 -- July 1, 2014, Proceedings

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Joachim Gudmundsson

    1. School of IT, University of Sydney, Sydney, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jyrki Katajainen

    1. Department of Computer Science, University of Copenhagen, Copenhagen East, Denmark

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: SEA 2014.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • 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

Table of contents (38 papers)

  1. Graph Drawing

    1. Evaluation of Labeling Strategies for Rotating Maps

      • Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
      Pages 235-246

    2. Experimental Comparison of Semantic Word Clouds

      • Lukas Barth, Stephen G. Kobourov, Sergey Pupyrev
      Pages 247-258

  2. Shortest Path

    1. Hub Labels: Theory and Practice

      • Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck
      Pages 259-270

    2. Customizable Contraction Hierarchies

      • Julian Dibbelt, Ben Strasser, Dorothea Wagner
      Pages 271-282

    3. Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches

      • Annalisa D’Andrea, Mattia D’Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
      Pages 283-294

    4. Exploiting GPS Data in Public Transport Journey Planners

      • Luca Allulli, Giuseppe F. Italiano, Federico Santaroni
      Pages 295-306

  3. Strings

    1. Order-Preserving Matching with Filtration

      • Tamanna Chhabra, Jorma Tarhio
      Pages 307-314

    2. Approximate Online Matching of Circular Strings

      • Tommi Hirvola, Jorma Tarhio
      Pages 315-325

    3. From Theory to Practice: Plug and Play with Succinct Data Structures

      • Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri
      Pages 326-337

    4. Improved ESP-index: A Practical Self-index for Highly Repetitive Texts

      • Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto
      Pages 338-350

  4. Graph Algorithms

    1. Partitioning Complex Networks via Size-Constrained Clustering

      • Henning Meyerhenke, Peter Sanders, Christian Schulz
      Pages 351-363

    2. Tree-Based Coarsening and Partitioning of Complex Networks

      • Roland Glantz, Henning Meyerhenke, Christian Schulz
      Pages 364-375

    3. Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks

      • Sepp Hartung, Clemens Hoffmann, André Nichterlein
      Pages 376-387

    4. Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study

      • Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki
      Pages 388-399

  5. Suffix Structures

    1. Efficient Representation for Online Suffix Tree Construction

      • N. Jesper Larsson, Kasper Fuglsang, Kenneth Karlsson
      Pages 400-411

    2. LCP Array Construction in External Memory

      • Juha Kärkkäinen, Dominik Kempa
      Pages 412-423

    3. Faster Compressed Suffix Trees for Repetitive Text Collections

      • Gonzalo Navarro, Alberto Ordóñez
      Pages 424-435

    4. Improved and Extended Locating Functionality on Compressed Suffix Arrays

      • Simon Gog, Gonzalo Navarro
      Pages 436-447

    5. Erratum: Customizable Contraction Hierarchies

      • Julian Dibbelt, Ben Strasser, Dorothea Wagner
      Pages E1-E1

  6. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Experimental Algorithms

Keywords

About this book

This book constitutes the refereed proceedings of the 13th International Symposium on Experimental Algorithms, SEA 2014, held in Copenhagen, Denmark, in June/July 2014.

The 36 revised full papers presented together with 3 invited presentations were carefully reviewed and selected from 81 submissions. The papers are organized in topical sections on combinatorial optimization, data structures, graph drawing, shortest path, strings, graph algorithms and suffix structures.

Editors and Affiliations

  • School of IT, University of Sydney, Sydney, Australia

    Joachim Gudmundsson

  • Department of Computer Science, University of Copenhagen, Copenhagen East, Denmark

    Jyrki Katajainen

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation