9. SEA 2010:
Ischia Island,
Naples,
Italy
Paola Festa (Ed.):
Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings.
Lecture Notes in Computer Science 6049 Springer 2010, ISBN 978-3-642-13192-9 
Invited Papers
Contributed Regular Papers
- Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Alternative Routes in Road Networks.
23-34
- Annabell Berger, Martin Grimmer, Matthias Müller-Hannemann:
Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks.
35-46
- Edith Brunel, Daniel Delling, Andreas Gemsa, Dorothea Wagner:
Space-Efficient SHARC-Routing.
47-58
- Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio:
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation.
59-70
- Robert Geisberger:
Contraction of Timetable Networks with Realistic Transfers.
71-82
- Tim Kieritz, Dennis Luxen, Peter Sanders, Christian Vetter:
Distributed Time-Dependent Contraction Hierarchies.
83-93
- Rodrigo Cánovas, Gonzalo Navarro:
Practical Compressed Suffix Trees.
94-105
- Noël Malod-Dognin, Rumen Andonov, Nicola Yanev:
Maximum Cliques in Protein Structure Comparison.
106-117
- Frank Baumann, Christoph Buchheim, Frauke Liers:
Exact Bipartite Crossing Minimization under Tree Constraints.
118-128
- Branislav Durian, Hannu Peltola, Leena Salmela, Jorma Tarhio:
Bit-Parallel Search Algorithms for Long Patterns.
129-140
- Chris Whidden, Robert G. Beiko, Norbert Zeh:
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments.
141-153
- Alain Hauser, Jens Maue:
Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars.
154-165
- Gernot Veit Batz, Robert Geisberger, Sabine Neubauer, Peter Sanders:
Time-Dependent Contraction Hierarchies and Approximation.
166-177
- Joan Boyar, René Peralta:
A New Combinational Logic Minimization Technique with Applications to Cryptology.
178-189
- Benjamin Doerr, Marvin Künnemann, Magnus Wahlström:
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements.
190-201
- Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa:
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm.
202-213
- Lucio Grandinetti, Francesca Guerriero, Demetrio Laganà, Ornella Pisacane:
An Approximate epsilon-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem.
214-225
- Eamonn T. Coughlan, Marco E. Lübbecke, Jens Schulz:
A Branch-and-Price Algorithm for Multi-mode Resource Leveling.
226-238
- Gerald Gamrath, Marco E. Lübbecke:
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs.
239-252
- Charles Delort, Olivier Spanjaard:
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem.
253-265
- Edoardo Amaldi, Stefano Coniglio, Stefano Gualandi:
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation.
266-275
- Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi:
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.
276-287
- Maurizio Boccia, Teodor Gabriel Crainic, Antonio Sforza, Claudio Sterle:
A Metaheuristic for a Two Echelon Location-Routing Problem.
288-301
- Minh Hoang Ha, François Clautiaux, Saïd Hanafi, Christophe Wilbaut:
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint.
302-313
- Daniela Ambrosino, Davide Anghinolfi, Massimo Paolucci, Anna Sciomachen:
An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem.
314-325
- Marco Chiarandini, Thomas Stützle:
An Analysis of Heuristics for Vertex Colouring.
326-337
- Paola Festa, José Fernando Gonçalves, Mauricio G. C. Resende, Ricardo M. A. Silva:
Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm.
338-349
- Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs.
350-360
- Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng:
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems.
361-372
- Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty:
Realtime Classification for Encrypted Traffic.
373-385
- Hakob Aslanyan, Pierre Leone, José D. P. Rolim:
Data Propagation with Guaranteed Delivery for Mobile Networks.
386-397
- Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano:
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries.
398-410
- Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik Manne:
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure.
411-423
- Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, Jens Rasmussen:
Policy-Based Benchmarking of Weak Heaps and Their Relatives, .
424-435
- Robert Görke, Pascal Maillard, Christian Staudt, Dorothea Wagner:
Modularity-Driven Clustering of Dynamic Graphs.
436-448
- Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting, Dorothea Wagner:
Gateway Decompositions for Constrained Reachability Problems.
449-461
- Manuel Caroli, Pedro Machado Manhães de Castro, Sébastien Loriot, Olivier Rouiller, Monique Teillaud, Camille Wormser:
Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere.
462-473
- Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
Fault Recovery in Wireless Networks: The Geometric Recolouring Approach.
474-485
- Samidh Chatterjee, Michael Connor, Piyush Kumar:
Geometric Minimum Spanning Trees with GeoFilterKruskal.
486-500
- Michael Connor, Piyush Kumar:
Practical Nearest Neighbor Search in the Plane.
501-512
Last update Fri May 25 08:48:14 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
