Abstract is missing.
- A Hybrid Bin-Packing Heuristic to Multiprocessor SchedulingAdriana C. F. Alvim, Celso C. Ribeiro. 1-13 [doi]
- Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle BasesEdoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli. 14-29 [doi]
- Solving Chance-Constrained Programs Combining Tabu Search and SimulationRoberto Aringhieri. 30-41 [doi]
- An Algorithm to Identify Clusters of Solutions in Multimodal OptimisationPedro J. Ballester, Jonathan N. Carter. 42-56 [doi]
- On an Experimental Algorithm for Revenue Management for Cargo AirlinesPaul Bartodziej, Ulrich Derigs. 57-71 [doi]
- Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop ProblemMatthieu Basseur, Julien Lemesre, Clarisse Dhaenens, El-Ghazali Talbi. 72-86 [doi]
- Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P::4:: sHans Leo Bodlaender, Celina M. Herrera de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier. 87-99 [doi]
- A Randomized Heuristic for Scene Recognition by Graph MatchingMaria C. Boeres, Celso C. Ribeiro, Isabelle Bloch. 100-113 [doi]
- An Efficient Implementation of a Joint Generation AlgorithmEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan. 114-128 [doi]
- Lempel, Even, and Cederbaum Planarity MethodJohn M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina. 129-144 [doi]
- A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual TechniqueEvandro C. Bracht, Luis A. A. Meira, Flavio Keidi Miyazawa. 145-158 [doi]
- Distributed Circle Formation for Anonymous Oblivious RobotsIoannis Chatzigiannakis, Michael Markou, Sotiris E. Nikoletseas. 159-174 [doi]
- Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting ProblemsGlauber Cintra, Yoshiko Wakabayashi. 175-190 [doi]
- Engineering Shortest Path AlgorithmsCamil Demetrescu, Giuseppe F. Italiano. 191-198 [doi]
- How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean FormulasTassos Dimitriou, Paul G. Spirakis. 199-212 [doi]
- Implementing Approximation Algorithms for the Single-Source Unsplittable Flow ProblemJingde Du, Stavros G. Kolliopoulos. 213-227 [doi]
- Fingered Multidimensional Search TreesAmalia Duch, Conrado Martínez. 228-242 [doi]
- Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich ProblemCelina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad. 243-252 [doi]
- Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT AlgorithmErik J. Hanashiro, Henrique Mongelli, Siang W. Song. 253-268 [doi]
- Combining Speed-Up Techniques for Shortest-Path ComputationsMartin Holzer, Frank Schulz, Thomas Willhalm. 269-284 [doi]
- Increased Bit-Parallelism for Approximate String MatchingHeikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro. 285-298 [doi]
- The Role of Experimental Algorithms in GenomicsRichard M. Karp. 299-300 [doi]
- A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size AlphabetsDong Kyue Kim, Junha Jo, Heejin Park. 301-314 [doi]
- Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability ProblemCorinne Lucet, Florence Mendes, Aziz Moukrim. 315-325 [doi]
- An Experimental Study of Unranking AlgorithmsConrado Martinez, Xavier Molinero. 326-340 [doi]
- An Improved Derandomized Approximation Algorithm for the Max-Controlled Set ProblemCarlos A. J. Martinhon, Fábio Protti. 341-355 [doi]
- GRASP with Path-Relinking for the Quadratic Assignment ProblemCarlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende. 356-368 [doi]
- Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor NetworksFrancisco Javier Ovalle-Martínez, Ivan Stojmenovic, Fabian Garcia Nocetti, Julio Solano-González. 369-382 [doi]
- A Dynamic Algorithm for Topologically Sorting Directed Acyclic GraphsDavid J. Pearce, Paul H. J. Kelly. 383-398 [doi]
- Approximating Interval Coloring and Max-Coloring in Chordal GraphsSriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman. 399-416 [doi]
- A Statistical Approach for Algorithm SelectionJoaquín Pérez, Rodolfo A. Pazos, Juan Frausto Solís, Guillermo Rodríguez, David Romero, Laura Cruz. 417-431 [doi]
- An Improved Time-Sensitive Metaheuristic Framework for Combinatorial OptimizationVinhthuy T. Phan, Steven Skiena. 432-445 [doi]
- A Huffman-Based Error Detecting CodePaulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter. 446-457 [doi]
- Solving Diameter Constrained Minimum Spanning Tree Problems in Dense GraphsAndréa C. dos Santos, Abilio Lucena, Celso C. Ribeiro. 458-467 [doi]
- An Efficient Tabu Search Heuristic for the School Timetabling ProblemHaroldo G. Santos, Luiz Satoru Ochi, Marcone J. F. Souza. 468-481 [doi]
- Experimental Studies of Symbolic Shortest-Path AlgorithmsDaniel Sawitzki. 482-497 [doi]
- Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity ProblemGeiza C. Silva, Luiz Satoru Ochi, Simone L. Martins. 498-512 [doi]
- Using Compact Tries for Cache-Efficient Sorting of IntegersRanjan Sinha. 513-528 [doi]
- Using Random Sampling to Build Approximate Tries for Efficient String SortingRanjan Sinha, Justin Zobel. 529-544 [doi]
- The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic EvaluationCid C. de Souza, André M. Lima, Nahri Moreano, Guido Araujo. 545-558 [doi]
- An Analytical Model for Energy MinimizationClaude Tadonki, José D. P. Rolim. 559-569 [doi]
- A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy NodesAlexandre Tarassov, Nikola S. Nikolov, Jürgen Branke. 570-583 [doi]