SEA 2013 - 12th International Symposium on Experimental Algorithms
June 5-7, 2013
Rome, Italy

SEA 2013

12th International Symposium on Experimental Algorithms

June 5-7, 2013 — Rome, Italy

List of Accepted Papers

  • Davi Tozoni, Pedro de Rezende and Cid de Souza.
    The Quest for Optimal Solutions for the Art Gallery Problem: a Practical Iterative Algorithm
  • Benjamin Hiller, Torsten Klug and Jakob Witzig.
    Reoptimization in branch-and-bound algorithms with an application to elevator control
  • José Luis López-Presa, Luis Nuñez Chiroque and Antonio Fernandez Anta.
    Novel Techniques for Automorphism Group Computation
  • Roland Glück, Dominik Köppl and Günther Wirsching.
    Computational Aspects of Ordered Integer Partition with Upper Bounds
  • Dong Zhou, David Andersen and Michael Kaminsky.
    Space-Efficient, High-Performance Rank & Select Structures
  • Mathias Weller.
    An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number
  • Sharon Bruckner, Bastian Kayser and Tim Conrad.
    FInding Modules in Networks with Non-modular Regions
  • Daniel Delling, Andrew Goldberg and Renato Werneck.
    Hub Label Compression
  • Long Trieu and Christoph Buchheim.
    Quadratic Outer Approximation for Convex Integer Programming
  • Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou and Yiannis Tasoulas.
    Cluster-based Heuristics for the Team Orienteering Problem with Time Windows
  • Emiliano Traversi and Fabio Furini.
    Hybrid SDP Bounding Procedure
  • Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner and Renato Werneck.
    Computing Multimodal Journeys in Practice
  • Daniel Delling and Renato Werneck.
    Faster Customization of Road Networks
  • Christoph Buchheim and Emiliano Traversi.
    Separable non-convex underestimators for binary quadratic programming
  • Peter Sanders and Christian Schulz.
    Think Locally, Act Globally: Highly Balanced Graph Partitioning
  • Artur Pessoa, Ruslan Sadykov, Eduardo Uchoa and Francois Vanderbeck.
    In-Out Separation and Column Generation Stabilization by Dual Price Smoothing
  • Lasse Kliemann, Ole Kliemann, C. Patvardhan, Volkmar Sauerland and Anand Srivastav.
    A New Quantum-Inspired Evolutionary Algorithm Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions (Extended Abstract)
  • Sharon Bruckner, Falk Hüffner, Christian Komusiewicz and Rolf Niedermeier.
    Evaluation of ILP-based Approaches for Partitioning into Colorful Components
  • Ambros Gleixner and Timo Berthold.
    Undercover Branching
  • Marjan Van Den Akker, Kevin van Blokland and Han Hoogeveen.
    Finding robust solutions for the stochastic job shop scheduling problem by including simulation in local search
  • Loukas Georgiadis, Luigi Laura, Nikos Parotsidis and Robert Tarjan.
    Dominator Certification and Independent Spanning Trees: An Experimental Study
  • Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Paulo Milreu and Marie-France Sagot.
    Telling Stories Fast Via Linear-Time Delay Pitch Enumeration
  • Julian Arz, Dennis Luxen and Peter Sanders.
    Transit Node Routing Reconsidered
  • Andreas Karrenbauer and Dominik Wöll.
    Blinking Molecule Tracking
  • Juha Kärkkäinen, Dominik Kempa and Simon Puglisi.
    Lightweight Lempel-Ziv Parsing
  • Andreas Gemsa, Thomas Pajor, Dorothea Wagner and Tobias Zündorf.
    Efficient Computation of Jogging Routes
  • Amr Elmasry and Jyrki Katajainen.
    Branchless Search Programs
  • Julian Dibbelt, Thomas Pajor, Ben Strasser and Dorothea Wagner.
    Intriguingly Simple and Fast Transit Routing
  • Herman Haverkort, Mark McGranaghan and Laura Toma.
    An edge quadtree for external memory
  • Takahisa Toda.
    Hypergraph Dualization Algorithm Based on Binary Decision Diagrams
  • Evripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli and Ioannis Milis.
    Energy Minimization via a Primal-dual Algorithm for a Convex Program
  • Fredrik Manne and Sadia Sharmin.
    Efficient Counting of Maximal Independent Sets in Sparse Graphs
Important Dates


Jan 23rd, 2013

Extended to

Feb 1st, 2013

23:59:59 UTC-12


March 8th, 2013

Camera Ready

March 28th, 2013

Early Registration

April 4th, 2013


June 5-7, 2013

Call for Papers

TXT iconPlain text

Click to see photos of Rome