Front matter
1-13
A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling
Adriana C. F. Alvim and Celso C. Ribeiro
14-29
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases
Edoardo Amaldi, Leo Liberti, Nelson Maculan and Francesco Maffioli
30-41
Solving Chance-Constrained Programs Combining Tabu Search and Simulation
Roberto Aringhieri
42-56
An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation
Pedro J. Ballester and Jonathan N. Carter
57-71
On an Experimental Algorithm for Revenue Management for Cargo Airlines
Paul Bartodziej and Ulrich Derigs
72-86
Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem
Matthieu Basseur, Julien Lemesre, Clarisse Dhaenens and El-Ghazali Talbi
87-99
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4’s
Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks and Rolf Niedermeier
100-113
A Randomized Heuristic for Scene Recognition by Graph Matching
Maria C. Boeres, Celso C. Ribeiro and Isabelle Bloch
114-128
An Efficient Implementation of a Joint Generation Algorithm
Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan
129-144
Lempel, Even, and Cederbaum Planarity Method
John M. Boyer, Cristina G. Fernandes, Alexandre Noma and José C. de Pina
145-158
A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique
Evandro C. Bracht, Luis A. A. Meira and Flávio K. Miyazawa
159-174
Distributed Circle Formation for Anonymous Oblivious Robots
Ioannis Chatzigiannakis, Michael Markou and Sotiris Nikoletseas
175-190
Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems
Glauber Cintra and Yoshiko Wakabayashi
191-198
Engineering Shortest Path Algorithms
Camil Demetrescu and Giuseppe F. Italiano
199-212
How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas
Tassos Dimitriou and Paul Spirakis
213-227
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem
Jingde Du and Stavros G. Kolliopoulos
228-242
Fingered Multidimensional Search Trees
Amalia Duch and Conrado Martínez
243-252
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Vinícius G. P. de Sá and Jeremy Spinrad
253-268
Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm
Erik J. Hanashiro, Henrique Mongelli and Siang W. Song
269-284
Combining Speed-Up Techniques for Shortest-Path Computations
Martin Holzer, Frank Schulz and Thomas Willhalm
285-298
Increased Bit-Parallelism for Approximate String Matching
Heikki Hyyrö, Kimmo Fredriksson and Gonzalo Navarro
299-300
The Role of Experimental Algorithms in Genomics
Richard M. Karp
301-314
A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets
Dong K. Kim, Junha Jo and Heejin Park
315-325
Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem
Corinne Lucet, Florence Mendes and Aziz Moukrim
326-340
An Experimental Study of Unranking Algorithms
Conrado Martínez and Xavier Molinero
341-355
An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem
Carlos A. Martinhon and Fábio Protti
356-368
GRASP with Path-Relinking for the Quadratic Assignment Problem
Carlos A. S. Oliveira, Panos M. Pardalos and Mauricio G. C. Resende
369-382
Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks
Francisco Javier Ovalle-Martínez, Ivan Stojmenovic, Fabián García-Nocetti and Julio Solano-González
383-398
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
David J. Pearce and Paul H. J. Kelly
399-416
Approximating Interval Coloring and Max-Coloring in Chordal Graphs
Sriram V. Pemmaraju, Sriram Penumatcha and Rajiv Raman
417-431
A Statistical Approach for Algorithm Selection
Joaquín Pérez, Rodolfo A. Pazos, Juan Frausto, Guillermo Rodríguez and David Romero, et al.
432-445
An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization
Vinhthuy Phan and Steven Skiena
446-457
A Huffman-Based Error Detecting Code
Paulo E. D. Pinto, Fábio Protti and Jayme L. Szwarcfiter
458-467
Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs
Andréa C. dos Santos, Abílio Lucena and Celso C. Ribeiro
468-481
An Efficient Tabu Search Heuristic for the School Timetabling Problem
Haroldo G. Santos, Luiz S. Ochi and Marcone J. F. Souza
482-497
Experimental Studies of Symbolic Shortest-Path Algorithms
Daniel Sawitzki
498-512
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Geiza C. Silva, Luiz S. Ochi and Simone L. Martins
513-528
Using Compact Tries for Cache-Efficient Sorting of Integers
Ranjan Sinha
529-544
Using Random Sampling to Build Approximate Tries for Efficient String Sorting
Ranjan Sinha and Justin Zobel
545-558
The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation
Cid C. de Souza, André M. Lima, Nahri Moreano and Guido Araujo
559-569
An Analytical Model for Energy Minimization
Claude Tadonki and Jose Rolim
570-583
A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes
Alexandre Tarassov, Nikola S. Nikolov and Jürgen Branke
Back matter