Volume 45,
Number 1,
June 2006
- Susanne Albers, Tomasz Radzik:
Foreword.
1-2
Electronic Edition (link) BibTeX
- Marcin Mucha, Piotr Sankowski:
Maximum Matchings in Planar Graphs via Gaussian Elimination.
3-20
Electronic Edition (link) BibTeX
- Joseph Cheriyan, Mohammad R. Salavatipour:
Hardness and Approximation Results for Packing Steiner Trees.
21-43
Electronic Edition (link) BibTeX
- Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis:
Direct Routing: Algorithms and Complexity.
45-68
Electronic Edition (link) BibTeX
- Yossi Azar, Arik Litichevskey:
Maximizing Throughput in Multi-Queue Switches.
69-90
Electronic Edition (link) BibTeX
- Marc J. van Kreveld, A. Frank van der Stappen:
Approximate Unions of Lines and Minkowski Sums.
91-107
Electronic Edition (link) BibTeX
- Amihood Amir, Estrella Eisenberg, Ely Porat:
Swap and Mismatch Edit Distance.
109-120
Electronic Edition (link) BibTeX
- René Beier, Berthold Vöcking:
An Experimental Study of Random Knapsack Problems.
121-136
Electronic Edition (link) BibTeX
- Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan:
Data Migration on Parallel Disks: Algorithms and Evaluation.
137-158
Electronic Edition (link) BibTeX
Volume 45,
Number 2,
June 2006
- Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
A Fixed-Parameter Approach to 2-Layer Planarization.
159-182
Electronic Edition (link) BibTeX
- Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir:
General Perfectly Periodic Scheduling.
183-208
Electronic Edition (link) BibTeX
- Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints.
209-226
Electronic Edition (link) BibTeX
- Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Recognizing Hole-Free 4-Map Graphs in Cubic Time.
227-262
Electronic Edition (link) BibTeX
Volume 45,
Number 3,
July 2006
- Frank K. H. A. Dehne:
Guest Editor's Introduction.
263-267
Electronic Edition (link) BibTeX
- Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons:
Scalable Parallel Algorithms for FPT Problems.
269-284
Electronic Edition (link) BibTeX
- Thomas M. Keane, Andrew J. Page, Thomas J. Naughton, Simon A. A. Travers, James O. McInerney:
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines.
285-300
Electronic Edition (link) BibTeX
- Carlos E. R. Alves, Edson Cáceres, Siang Wun Song:
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem.
301-335
Electronic Edition (link) BibTeX
- Adrian Driga, Paul Lu, Jonathan Schaeffer, Duane Szafron, Kevin Charter, Ian Parsons:
FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment.
337-375
Electronic Edition (link) BibTeX
- Jie Chi, Mehmet Koyutürk, Ananth Grama:
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets.
377-401
Electronic Edition (link) BibTeX
- James Chilson, Raymond T. Ng, Alan Wagner, Ruben H. Zamar:
Parallel Computation of High-Dimensional Robust Correlation and Covariance Matrices.
403-431
Electronic Edition (link) BibTeX
- Jerffeson Teixeira de Souza, Stan Matwin, Nathalie Japkowicz:
Parallelizing Feature Selection.
433-456
Electronic Edition (link) BibTeX
- Mehul Bhatt, Andrew Flahive, Carlo Wouters, J. Wenny Rahayu, David Taniar:
MOVE: A Distributed Framework for Materialized Ontology View Extraction.
457-481
Electronic Edition (link) BibTeX
- Geeta Chaudhry, Thomas H. Cormen:
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters.
483-508
Electronic Edition (link) BibTeX
- Daniel J. Harvey, Sajal K. Das, Rupak Biswas:
Design and Performance of a Heterogeneous Grid Partitioner.
509-530
Electronic Edition (link) BibTeX
Volume 45,
Number 4,
August 2006
Copyright © Tue May 27 18:19:29 2008
by Michael Ley (ley@uni-trier.de)
