| [Ta] [Paidia] [Paizei] the interaction between algorithms and game theory | p. 1 |
| Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization | p. 4 |
| High-performance algorithm engineering for large-scale graph problems and computational biology | p. 16 |
| The "real" approximation factor of the MST heuristic for the minimum energy broadcasting | p. 22 |
| Implementing minimum cycle basis algorithms | p. 32 |
| Rounding to an integral program | p. 44 |
| Rectangle covers revisited computationally | p. 55 |
| Don't compare averages | p. 67 |
| Experimental results for Stackelberg scheduling strategies | p. 77 |
| An improved branch-and-bound algorithm for the test cover problem | p. 89 |
| Degree-based treewidth lower bounds | p. 101 |
| Inferring AS relationships : dead end or lively beginning? | p. 113 |
| Acceleration of shortest path and constrained shortest path computation | p. 126 |
| A general buffer scheme for the Windows scheduling problem | p. 139 |
| Implementation of approximation algorithms for the multicast congestion problem | p. 152 |
| Frequency assignment and multicoloring powers of square and triangular meshes | p. 165 |
| From static code distribution to more shrinkage for the multiterminal cut | p. 177 |
| Partitioning graphs to speed up Dijkstra's algorithm | p. 189 |
| Efficient convergence to pure nash equilibria in weighted network congestion games | p. 203 |
| New upper bound heuristics for treewidth | p. 216 |
| Accelerating Vickrey payment computation in combinatorial auctions for an airline alliance | p. 228 |
| Algorithm engineering for optimal graph bipartization | p. 240 |
| Empirical analysis of the connectivity threshold of mobile agents on the grid | p. 253 |
| Multiple-winners randomized tournaments with consensus for optimization problems in generic metric spaces | p. 265 |
| On symbolic scheduling independent tasks with restricted execution times | p. 277 |
| A simple randomized k-local election algorithm for local computations | p. 290 |
| Generating and radiocoloring families of perfect graphs | p. 302 |
| Efficient implementation of rank and select functions for succinct representation | p. 315 |
| Comparative experiments with GRASP and constraint programming for the oil well drilling problem | p. 328 |
| A framework for probabilistic numerical evaluation of sensor networks : a case study of a localization protocol | p. 341 |
| A cut-based heuristic to produce almost feasible periodic railway timetables | p. 354 |
| GRASP with path-relinking for the weighted maximum satisfiability problem | p. 367 |
| New bit-parallel indel-distance algorithm | p. 380 |
| Dynamic application placement under service and memory constraints | p. 391 |
| Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers | p. 403 |
| Synchronization fault cryptanalysis for breaking A5/1 | p. 415 |
| An efficient algorithm for [delta]-approximate matching with [alpha]-bounded gaps in musical sequences | p. 428 |
| The necessity of timekeeping in adversarial queueing | p. 440 |
| BDDs in a branch and cut framework | p. 452 |
| Parallel Smith-Waterman algorithm for local DNA comparison in a cluster of workstations | p. 464 |
| Fast algorithms for weighted bipartite matching | p. 476 |
| A practical minimal perfect hashing method | p. 488 |
| Efficient and experimental meta-heuristics for MAX-SAT problems | p. 501 |
| Experimental evaluation of the greedy and random algorithms for finding independent sets in random graphs | p. 513 |
| Local clustering of large graphs by approximate Fiedler vectors | p. 524 |
| Almost FPRAS for lattice models of protein folding | p. 534 |
| Vertex cover approximations : experiments and observations | p. 545 |
| GRASP with path-relinking for the maximum diversity problem | p. 558 |
| How to splay for loglogN-competitiveness | p. 570 |
| Distilling router data analysis for faster and simpler dynamic IP lookup algorithms | p. 580 |
| Optimal competitive online ray search with an error-prone robot | p. 593 |
| An empirical study for inversions-sensitive sorting algorithms | p. 597 |
| Approximation algorithm for chromatic index and edge-coloring of multigraphs | p. 602 |
| Finding, counting and listing all triangles in large graphs, an experimental study | p. 606 |
| Selecting the roots of a small system of polynomial equations by tolerance based matching | p. 610 |
| Developing novel statistical bandwidths for communication networks with incomplete information | p. 614 |
| Dynamic quality of service support in virtual private networks | p. 618 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
