Algorithmica, Volume 45, 2006

Volume 45, Number 1, June 2006

• Susanne Albers, Tomasz Radzik:
  Foreword. 1-2
  
• Marcin Mucha, Piotr Sankowski:
  Maximum Matchings in Planar Graphs via Gaussian Elimination. 3-20
  
• Joseph Cheriyan, Mohammad R. Salavatipour:
  Hardness and Approximation Results for Packing Steiner Trees. 21-43
  
• Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis:
  Direct Routing: Algorithms and Complexity. 45-68
  
• Yossi Azar, Arik Litichevskey:
  Maximizing Throughput in Multi-Queue Switches. 69-90
  
• Marc J. van Kreveld, A. Frank van der Stappen:
  Approximate Unions of Lines and Minkowski Sums. 91-107
  
• Amihood Amir, Estrella Eisenberg, Ely Porat:
  Swap and Mismatch Edit Distance. 109-120
  
• René Beier, Berthold Vöcking:
  An Experimental Study of Random Knapsack Problems. 121-136
  
• Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan:
  Data Migration on Parallel Disks: Algorithms and Evaluation. 137-158
  

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
  
• Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir:
  General Perfectly Periodic Scheduling. 183-208
  
• Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
  Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. 209-226
  
• Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
  Recognizing Hole-Free 4-Map Graphs in Cubic Time. 227-262
  

Volume 45, Number 3, July 2006

• Frank K. H. A. Dehne:
  Guest Editor's Introduction. 263-267
  
• Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons:
  Scalable Parallel Algorithms for FPT Problems. 269-284
  
• 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
  
• 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
  
• 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
  
• Jie Chi, Mehmet Koyutürk, Ananth Grama:
  CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets. 377-401
  
• James Chilson, Raymond T. Ng, Alan Wagner, Ruben H. Zamar:
  Parallel Computation of High-Dimensional Robust Correlation and Covariance Matrices. 403-431
  
• Jerffeson Teixeira de Souza, Stan Matwin, Nathalie Japkowicz:
  Parallelizing Feature Selection. 433-456
  
• Mehul Bhatt, Andrew Flahive, Carlo Wouters, J. Wenny Rahayu, David Taniar:
  MOVE: A Distributed Framework for Materialized Ontology View Extraction. 457-481
  
• Geeta Chaudhry, Thomas H. Cormen:
  Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters. 483-508
  
• Daniel J. Harvey, Sajal K. Das, Rupak Biswas:
  Design and Performance of a Heterogeneous Grid Partitioner. 509-530
  

Volume 45, Number 4, August 2006

• Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
  Book Embeddability of Series-Parallel Digraphs. 531-547
  
• Rudolf Fleischer, Mordecai J. Golin, Yan Zhang:
  Online Maintenance of k-Medians and k-Covers on a Line. 549-567
  
• Michael Elkin, Guy Kortsarz:
  An Approximation Algorithm for the Directed Telephone Multicast Problem. 569-583
  
• Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
  I/O-Efficient Well-Separated Pair Decomposition and Applications. 585-614
  

Last update Thu May 23 18:14:42 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page