Skip to main content
Springer Nature Link
Log in

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

Subscribe and save

Springer+ Basic
$34.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 USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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 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.

Similar content being viewed by others

Keywords

Table of contents (38 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Presentation

    1. Selecting Data for Experiments: Past, Present and Future

      • Jon Bentley
      Pages 1-9

  3. Combinatorial Optimization

    1. The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models

      • Péter Biró, David F. Manlove, Iain McBride
      Pages 10-21

    2. Integral Simplex Using Decomposition with Primal Cuts

      • Samuel Rosat, Issmail Elhallaoui, François Soumis, Andrea Lodi
      Pages 22-33

    3. A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs

      • Martin Bergner, Marco E. Lübbecke, Jonas T. Witt
      Pages 34-45

    4. Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth

      • David Coudert, Dorian Mazauric, Nicolas Nisse
      Pages 46-58

    5. An Exact Algorithm for the Discrete Chromatic Art Gallery Problem

      • Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza
      Pages 59-73

    6. Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem

      • Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski
      Pages 74-86

    7. Relocation in Carsharing Systems Using Flows in Time-Expanded Networks

      • Sven O. Krumke, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener
      Pages 87-98

    8. Dynamic Windows Scheduling with Reallocation

      • Martín Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves
      Pages 99-110

  4. Data Structures

    1. Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates

      • Stephan Erb, Moritz Kobitzsch, Peter Sanders
      Pages 111-122

    2. Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest

      • Aapo Kyrola, Julian Shun, Guy Blelloch
      Pages 123-137

    3. Retrieval and Perfect Hashing Using Fingerprinting

      • Ingo Müller, Peter Sanders, Robert Schulze, Wei Zhou
      Pages 138-149

    4. Efficient Wavelet Tree Construction and Querying for Multicore Architectures

      • José Fuentes-Sepúlveda, Erick Elejalde, Leo Ferres, Diego Seco
      Pages 150-161

    5. Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket

      • David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Paweł Pszona
      Pages 162-173

    6. Loop Nesting Forests, Dominators, and Applications

      • Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert E. Tarjan
      Pages 174-186

    7. DenseZDD: A Compact and Fast Index for Families of Sets

      • Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
      Pages 187-198

    8. An Evaluation of Dynamic Labeling Schemes for Tree Networks

      • Noy Rotbart, Marcos Vaz Salles, Iasonas Zotos
      Pages 199-210

  5. Graph Drawing

    1. Engineering Color Barcode Algorithms for Mobile Applications

      • Donatella Firmani, Giuseppe F. Italiano, Marco Querini
      Pages 211-222

    2. Computing Consensus Curves

      • Livio De La Cruz, Stephen Kobourov, Sergey Pupyrev, Paul S. Shen, Sankar Veeramoni
      Pages 223-234
Back to top

Other volumes

  1. Experimental Algorithms

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