Skip to main content
  • Conference proceedings
  • © 2014

Experimental Algorithms

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

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)

Conference series link(s): SEA: International Symposium on Experimental Algorithms

Conference proceedings info: SEA 2014.

Buy it now

Buying options

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

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

Table of contents (38 papers)

  1. Front Matter

  2. Invited Presentation

  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. Retrieval and Perfect Hashing Using Fingerprinting

      • Ingo Müller, Peter Sanders, Robert Schulze, Wei Zhou
      Pages 138-149
    3. Efficient Wavelet Tree Construction and Querying for Multicore Architectures

      • José Fuentes-Sepúlveda, Erick Elejalde, Leo Ferres, Diego Seco
      Pages 150-161
    4. 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
    5. Loop Nesting Forests, Dominators, and Applications

      • Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert E. Tarjan
      Pages 174-186
    6. 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
    7. 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

Other Volumes

  1. Experimental Algorithms

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

Buy it now

Buying options

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