Volume 7, 2002

• 
  Werner Backes, Susanne Wetzel: Heuristics on Lattice Basis Reduction in Practice. 1
• 
  Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto: Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. 2
• 
  Susanne Albers, Bianca Schröder: An Experimental Study of Online Scheduling Algorithms. 3
• 
  Kurt Mehlhorn, Guido Schäfer: Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. 4
• 
  Stefan Edelkamp, Patrick Stiegeler: Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons. 5
• 
  Thomas Erlebach, Klaus Jansen: Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. 6
• 
  Isabelle Guérin Lassous, Jens Gustedt: Portable List Ranking: An Experimental Study. 7
• 
  Jan Vahrenhold, Klaus Hinrichs: Planar Point Location For Large Data Sets: To Seek Or Not To Seek. 8
• 
  Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter: Efficient Sorting Using Registers and Caches. 9

• 
  Francine Herrmann, Alain Hertz: Finding the Chromatic Number by Means of Critical Graphs. 10
• 
  Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze: Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. 11
• 
  Filippo Neri: Relational Concept Learning by Cooperative Evolution. 12

last updated on Sat May 18 06:22:28 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page