© 2015

Experimental Algorithms

14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings

  • Evripidis Bampis
Conference proceedings SEA 2015

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9125)

Table of contents

  1. Front Matter
    Pages I-XI
  2. Data structures

    1. Front Matter
      Pages 1-1
    2. Leo Ferres, José Fuentes-Sepúlveda, Meng He, Norbert Zeh
      Pages 3-14
    3. Lorenz Hübschle-Schneider, Rajeev Raman
      Pages 15-27
    4. Timo Bingmann, Thomas Keh, Peter Sanders
      Pages 28-40
  3. Graph Problems I

    1. Front Matter
      Pages 41-41
    2. Pierluigi Crescenzi, Gianlorenzo D’Angelo, Lorenzo Severini, Yllka Velaj
      Pages 43-55
    3. Takuya Akiba, Yoichi Iwata, Yuki Kawata
      Pages 56-67
    4. Sebastian Lamm, Peter Sanders, Christian Schulz
      Pages 68-81
    5. Christian Komusiewicz, Manuel Sorge, Kolja Stahl
      Pages 82-93
  4. Combinatorial Optimization I

    1. Front Matter
      Pages 95-95
    2. Marco E. Lübbecke, Jonas T. Witt
      Pages 110-121
    3. Claudia D’Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
      Pages 122-133
  5. Scheduling and Allocation

    1. Front Matter
      Pages 135-135
    2. Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Emmanouil Zampetakis, Georgios Zois
      Pages 137-150
    3. Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong
      Pages 151-164
    4. Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti
      Pages 165-177
  6. Combinatorial Optimization II

    1. Front Matter
      Pages 179-179
    2. Gerald Gamrath, Benjamin Hiller, Jakob Witzig
      Pages 181-192

About these proceedings


This book constitutes the refereed proceedings of the 14th International Symposium on Experimental Algorithms, SEA 2015, held in Paris, France, in June/July 2015.

The 30 revised full papers presented were carefully reviewed and selected from 76 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. The papers are grouped in topical sections on data structures, graph problems, combinatorial optimization, scheduling and allocation, and transportation networks.


Approximation algorithms Character classes Combinatorial optimization Computational complexity Computational optimization Data streams Data structures Geometry Graph algorithms Graph drawing Information retrieval Mathematical optimization Parallel algorithms Pattern matching Regular-expression matching Shortest path problem Spam filtering Strings Trees XML compression

Editors and affiliations

  • Evripidis Bampis
    • 1
  1. 1.Université Pierre et Marie Curie LIP6ParisFrance

Bibliographic information