default search action
3rd WEA 2004: Angra dos Reis, Brazil
- Celso C. Ribeiro
, Simone L. Martins:
Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings. Lecture Notes in Computer Science 3059, Springer 2004, ISBN 3-540-22067-4 - Adriana C. F. Alvim
A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling. 1-13 - Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli:
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. 14-29 - Roberto Aringhieri
Solving Chance-Constrained Programs Combining Tabu Search and Simulation. 30-41 - Pedro J. Ballester
An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation. 42-56 - Paul Bartodziej, Ulrich Derigs:
On an Experimental Algorithm for Revenue Management for Cargo Airlines. 57-71 - Matthieu Basseur, Julien Lemesre, Clarisse Dhaenens
Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem. 72-86 - Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier:
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. 87-99 - Maria C. Boeres, Celso C. Ribeiro
A Randomized Heuristic for Scene Recognition by Graph Matching. 100-113 - Endre Boros, Khaled M. Elbassioni
An Efficient Implementation of a Joint Generation Algorithm. 114-128 - John M. Boyer
Lempel, Even, and Cederbaum Planarity Method. 129-144 - Evandro C. Bracht
A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique. 145-158 - Ioannis Chatzigiannakis, Michael Markou, Sotiris E. Nikoletseas:
Distributed Circle Formation for Anonymous Oblivious Robots. 159-174 - Glauber Cintra, Yoshiko Wakabayashi:
Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems. 175-190 - Camil Demetrescu, Giuseppe F. Italiano:
Engineering Shortest Path Algorithms. 191-198 - Tassos Dimitriou, Paul G. Spirakis:
How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas. 199-212 - Jingde Du, Stavros G. Kolliopoulos:
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem. 213-227 - Amalia Duch, Conrado Martínez:
Fingered Multidimensional Search Trees. 228-242 - Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad:
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. 243-252 - Erik J. Hanashiro, Henrique Mongelli, Siang W. Song:
Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm. 253-268 - Martin Holzer, Frank Schulz, Thomas Willhalm:
Combining Speed-Up Techniques for Shortest-Path Computations. 269-284 - Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro:
Increased Bit-Parallelism for Approximate String Matching. 285-298 - Richard M. Karp:
The Role of Experimental Algorithms in Genomics. 299-300 - Dong Kyue Kim, Junha Jo, Heejin Park:
A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets. 301-314 - Corinne Lucet, Florence Mendes, Aziz Moukrim:
Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem. 315-325 - Conrado Martínez, Xavier Molinero:
An Experimental Study of Unranking Algorithms. 326-340 - Carlos A. J. Martinhon, Fábio Protti:
An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem. 341-355 - Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende:
GRASP with Path-Relinking for the Quadratic Assignment Problem. 356-368 - Francisco Javier Ovalle-Martínez, Ivan Stojmenovic, Fabián García Nocetti, Julio Solano-González
Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks. 369-382 - David J. Pearce, Paul H. J. Kelly:
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs. 383-398 - Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman:
Approximating Interval Coloring and Max-Coloring in Chordal Graphs. 399-416 - Joaquín Pérez Ortega, Rodolfo A. Pazos, Juan Frausto Solís
A Statistical Approach for Algorithm Selection. 417-431 - Vinhthuy T. Phan, Steven Skiena
An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization. 432-445 - Paulo Eustáquio Duarte Pinto, Fábio Protti
A Huffman-Based Error Detecting Code. 446-457 - Andréa C. dos Santos, Abilio Lucena
Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs. 458-467 - Haroldo G. Santos, Luiz Satoru Ochi, Marcone J. F. Souza
An Efficient Tabu Search Heuristic for the School Timetabling Problem. 468-481 - Daniel Sawitzki:
Experimental Studies of Symbolic Shortest-Path Algorithms. 482-497 - Geiza Cristina da Silva
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem. 498-512 - Ranjan Sinha:
Using Compact Tries for Cache-Efficient Sorting of Integers. 513-528 - Ranjan Sinha, Justin Zobel:
Using Random Sampling to Build Approximate Tries for Efficient String Sorting. 529-544 - Cid C. de Souza, André M. Lima, Nahri Moreano, Guido Araujo:
The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation. 545-558 - Claude Tadonki, José D. P. Rolim:
An Analytical Model for Energy Minimization. 559-569 - Alexandre Tarassov, Nikola S. Nikolov, Jürgen Branke
A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes. 570-583
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-14 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: