SEA 2014 Conference

Contributions solicited cover a variety of topics including but not limited to:

• Algorithm Engineering
• Algorithmic Libraries
• Algorithmic Mechanism Design
• Analysis of Algorithms
• Algorithms for Memory Hierarchies
• Approximation Techniques
• Bioinformatics
• Branch-and-Bound Algorithms
• Combinatorial and Irregular Problems
• Combinatorial Structures and Graphs
• Communication Networks
• Complex Networks
• Computational Geometry
• Computational Learning Theory
• Computational Optimization
• Computer Systems
• Cryptography and Security
• Data Streams
• Data Structures
• Distributed and Parallel Algorithms
• Evaluation of Algorithms for Realistic Environments
• Experimental Techniques and Statistics
• Graph Drawing
• Heuristics for Combinatorial Optimization
• Implementation, Testing, Evaluation and Fine-tuning
• Information Retrieval
• Integer Programming
• Logistics and Operations Management
• Machine Learning and Data Mining
• Mathematical Programming
• Metaheuristic Methodologies
• Multiple Criteria Decision Making
• Network Analysis
• Novel Applications of Algorithms in Other Disciplines
• Online Problems
• Parallel Algorithms and Computing
• Railway Optimization using Algorithmic Methods
• Randomized Techniques
• Robotics
• Semidefinite Programming
• Simulation
• Software Repositories and Platforms for using Algorithms
• Telecommunications and Networking
• World-Wide-Web Algorithms

• Jon Bentley, Avaya Labs Research
  Keywords: k-d tree, line-segment intersections, Programming Pearls
• Robert Bixby, Rice University
  Keywords: CPLEX, optimization, The Travelling Salesman Problem: A Computational Study
• Rasmus Pagh, IT University of Copenhagen
  Keywords: cuckoo hashing, randomization, big data

The list of accepted papers:

Luca Allulli, Giuseppe F. Italiano, and Federico Santaroni. Exploiting GPS Data in Public Transport Journey Planners

Lukas Barth, Stephen Kobourov, and Sergey Pupyrev. Experimental Comparison of Semantic Word Clouds

Martin Bergner, Marco Lübbecke, and Jonas Witt. A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs

Attila Bernath, Krzysztof Ciebiera, Piotr Godlewski, and Piotr Sankowski. Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem

Tamanna Chhabra and Jorma Tarhio. Order-Preserving Matching with Filtration

David Coudert, Dorian Mazauric, and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth

Livio De La Cruz, Stephen Kobourov, Sergey Pupyrev, Paul S. Shen, and Sankar Veeramoni. Computing Consensus Curves

Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci and Guido Proietti. Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches

Daniel Delling, Andrew Goldberg, Ruslan Savchenko, and Renato Werneck. Hub Labels: Theory and Practice

Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-Ichi Minato, and Kunihiko Sadakane. DenseZDD: A Compact and Fast Index for Families of Sets

Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Customizable Contraction Hierarchies

David Eppstein, Michael Goodrich, Michael Mitzenmacher, and Paweł Pszona. Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket

Stephan Erb, Moritz Kobitzsch, and Peter Sanders. Parallel Bi-Objective Shortest Paths using Weight-Balanced B-Trees with Bulk Updates

Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, and Christopher Thraves. Dynamic Windows Scheduling with Reallocations

Donatella Firmani, Giuseppe F. Italiano, and Marco Querini. Engineering Color Barcode Algorithms for Mobile Applications

Jose Fuentes-Sepúlveda, Erick Elejalde, Leo Ferres, and Diego Seco. Efficient Wavelet Tree Construction and Querying for Multicore Architectures

Andreas Gemsa, Martin Nöllenburg, and Ignaz Rutter. Evaluation of Labeling Strategies for Rotating Maps

Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, and Robert Tarjan. Loop Nesting Forests, Dominators, and Applications

Roland Glantz, Henning Meyerhenke, and Christian Schulz. Tree-based Coarsening and Partitioning of Complex Networks

Simon Gog, Timo Beller, Alistair Moffat, and Matthias Petri. From Theory to Practice: Plug and Play with Succinct Data Structures

Simon Gog and Gonzalo Navarro. Improved and Extended Locating Functionality on Compressed Suffix Arrays

Sepp Hartung, Clemens Hoffmann, and André Nichterlein. Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks

Tommi Hirvola and Jorma Tarhio. Approximate Online Matching of Circular Strings

Juha Kärkkäinen and Dominik Kempa. LCP Array Construction in External Memory

Yasuaki Kobayashi, Keita Komuro, and Hisao Tamaki. Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study

Sven O. Krumke, Alain Quilliot, Annegret Wagler, and Jan-Thierry Wegener. Relocation in Carsharing Systems using Flows in Time-Expanded Networks

Aapo Kyrola, Julian Shun, and Guy Blelloch. Beyond Synchronous Computation: New Techniques for External Memory Graph Algorithms

Jesper Larsson, Kasper Fuglsang, and Kenneth Karlsson. Efficient Representation for Online Suffix Tree Construction

Iain McBride, David F. Manlove, and Peter Biro. The Hospitals/Residents Problem with Couples: Complexity and Integer Programming Models

Henning Meyerhenke, Peter Sanders, and Christian Schulz. Partitioning Complex Networks via Size-constrained Clustering

Ingo Müller, Peter Sanders, Robert Schulze, and Wei Zhou. Retrieval and Perfect Hashing using Fingerprinting

Gonzalo Navarro and Alberto Ordóñez Pereira. Faster Compressed Suffix Trees for Repetitive Text Collections

Samuel Rosat, Issmail Elhallaoui, François Soumis, and Andrea Lodi. Integral Simplex Using Decomposition with Primal Cuts

Noy Rotbart, Marcos Vaz Salles, and Iasonas Zotos. An Evaluation of Dynamic Labeling Schemes for Tree Networks

Yoshimasa Takabatake, Yasuo Tabei, and Hiroshi Sakamoto. Improved ESP-Index: A Practical Self-Index for Highly Repetitive Texts

Maurício J. O. Zambon, Pedro J. de Rezende, and Cid C. de Souza. An Exact Algorithm for the Chromatic Art Gallery Problem

Program committee

• Benjamin Doerr, Max-Planck Institut fur Informatik
• Camil Denetrescu, Sapienza University of Rome
• David G Andersen, Carnegie Mellon University
• David Mount, University of Maryland
• Erwin Pesch, University of Siegen
• Gerhard J. Woeginger, Technical University of Eindhoven
• Joachim Gudmundsson, University of Sydney and NICTA (chair)
• Jyrki Katajainen, University of Copenhagen
• Maike Buchin, Ruhr-University of Bochum
• Martin Skutella, Technical University of Berlin
• Matt Stallmann, North Carolina State University
• Petra Mutzel, Technical University of Dortmund
• Philippas Tsigas, Chalmers University of Technology
• Rolf Niedermeier, Technical University of Berlin
• Simon Puglisi, University of Helsinki
• Suresh Venkatasubramanian, University of Utah
• Toby Walsh, NICTA and University of New South Wales
• Yusu Wang, Ohio State University

Steering committee

• Edoard Amaldi 
• David A. Bader
• Josep Diaz
• Giuseppe F.Italiano
• David Johnson
• Klaus Jansen
• Kurt Mehlhorn
• Ian Munro
• Sotiris Nikoletseas
• Jose Rolim (chair)
• Pavlos Spirakis

Organizing committe

• Susan Nasirumbi Ipsen, University of Copenhagen
• Inge Hviid Jensen, University of Copenhagen
• Jyrki Katajainen, University of Copenhagen (conference chair)

SEA (Symposium on Experimental Algorithms), previously known as WEA (Workshop on Experimental Algorithms), is an international forum for researchers in the area of design, analysis, and experimental
evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. 

Previous symposia and their venues:

• SEA 2013, Rome Italy
• SEA 2012, Bordeaux, France
• SEA 2011, Crete, Greece
• SEA 2010, Ischia Island, Italy
• SEA 2009, Dortmund, Germany
• WEA 2008, Cape Cod, USA
• WEA 2007, Rome, Italy
• WEA 2006, Menorca Island, Spain
• WEA 2005, Santorini, Greece
• WEA 2004, Angra dos Reis, Rio de Janeiro, Brazil
• WEA 2003, Monte Verità, Ascona, Switzerland
• WEA 2001, Riga, Latvia