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

This program is currently subject to modifications, please visit regularly this page before preparing your trip.

June 5 (Wednesday)

9:00-9:30 Opening

9:30-10:30 Invited Talk:

Martin Skutella. Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines.

10:30-11:00 Coffee break

11:00-12:40 Session 1: Scheduling and Local Search

Evripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli and Ioannis Milis. Energy Minimization via a Primal-dual Algorithm for a Convex Program.

Benjamin Hiller, Torsten Klug and Jakob Witzig. Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control.

Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou and Yiannis Tasoulas. Cluster-based Heuristics for the Team Orienteering Problem with Time Windows.

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.

12:40-14.00 Lunch

14:00-15:40 Session 2: Geometry and Optimization

Andreas Karrenbauer and Dominik Wöll. Blinking Molecule Tracking.

Davi Tozoni, Pedro de Rezende and Cid de Souza. The Quest for Optimal Solutions for the Art Gallery Problem: a Practical Iterative Algorithm.

Mathias Weller. An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number.

Artur Pessoa, Ruslan Sadykov, Eduardo Uchoa and Francois Vanderbeck. In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.

15:40-16:10 Coffee break

16:10-17:50 Session 3: Network Partitioning and Bioinformatics

Peter Sanders and Christian Schulz. Think Locally, Act Globally: Highly Balanced Graph Partitioning.

Sharon Bruckner, Falk Hüffner, Christian Komusiewicz and Rolf Niedermeier. Evaluation of ILP-based Approaches for Partitioning into Colorful Components.

Sharon Bruckner, Bastian Kayser and Tim Conrad. Finding Modules in Networks with Non-modular Regions.

Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Paulo Milreu and Marie-France Sagot. Telling Stories Fast Via Linear-Time Delay Pitch Enumeration.

June 6 (Thursday)

9:30-10:30 Invited Talk

Andrew Goldberg. The Hub Labeling Algorithm.

10:30-11:00 Coffee break

11:00-12:40 Session 4: Transportation Networks and Graph Algorithms I

Daniel Delling, Andrew Goldberg and Renato Werneck. Hub Label Compression.

Daniel Delling and Renato Werneck. Faster Customization of Road Networks.

Julian Dibbelt, Thomas Pajor, Ben Strasser and Dorothea Wagner. Intriguingly Simple and Fast Transit Routing.

Julian Arz, Dennis Luxen and Peter Sanders. Transit Node Routing Reconsidered.

12:40-14.00 Lunch

14:00-15:40 Session 5: Mathematical Programming

Ambros Gleixner and Timo Berthold. Undercover Branching.

Long Trieu and Christoph Buchheim. Quadratic Outer Approximation for Convex Integer Programming.

Christoph Buchheim and Emiliano Traversi. Separable Non-Convex Underestimators for Binary Quadratic Programming.

Emiliano Traversi and Fabio Furini. Hybrid SDP Bounding Procedure.

15:40-16:10 Coffee break

16:10-17:50 Session 6: Combinatorics and Enumeration

Lasse Kliemann, Ole Kliemann, C. Patvardhan, Volkmar Sauerland and Anand Srivastav. A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.

Roland Glück, Dominik Köppl and Günther Wirsching. Computational Aspects of Ordered Integer Partition with Upper Bounds.

Takahisa Toda. Hypergraph Transversal Computation with Binary Decision Diagrams.

Fredrik Manne and Sadia Sharmin. Efficient Counting of Maximal Independent Sets in Sparse Graphs.

20:00: Social Dinner at Restaurant Enoteca Regionale Palatium - via Frattina, 94

June 7 (Friday)

9:30-10:30 Invited Talk

Roberto Grossi. Design of Practical Succinct Data Structures for Large Data Collections.

10:30-11:00 Coffee break

11:00-12:40 Session 7: Data Structures and Compression

Herman Haverkort, Mark McGranaghan and Laura Toma. An Edge Quadtree for External Memory.

Amr Elmasry and Jyrki Katajainen. Branchless Search Programs.

Juha Kärkkäinen, Dominik Kempa and Simon Puglisi. Lightweight Lempel-Ziv Parsing.

Dong Zhou, David Andersen and Michael Kaminsky. Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences.

12:40-14.00 Lunch

14:00-15:40 Session 8: Transportation Networks and Graph Algorithms II

Loukas Georgiadis, Luigi Laura, Nikos Parotsidis and Robert Tarjan. Dominator Certification and Independent Spanning Trees: An Experimental Study.

José Luis López-Presa, Luis Nuñez Chiroque and Antonio Fernandez Anta. Novel Techniques for Automorphism Group Computation.

Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner and Renato Werneck. Computing Multimodal Journeys in Practice.

Andreas Gemsa, Thomas Pajor, Dorothea Wagner and Tobias Zündorf. Efficient Computation of Jogging Routes.

15:40 End of Conference

Important Dates

Submission

Jan 23rd, 2013

Extended to

Feb 1st, 2013

23:59:59 UTC-12

Notification

March 8th, 2013

Camera Ready

March 28th, 2013

Early Registration

April 4th, 2013

Conference

June 5-7, 2013

Call for Papers

TXT iconPlain text

Click to see photos of Rome