Journals in DBLP
Werner Backes , Susanne Wetzel Heuristics on Lattice Basis Reduction in Practice. [Citation Graph (0, 0)][DBLP ] Journal ] Kazuo Iwama , Daisuke Kawai , Shuichi Miyazaki , Yasuo Okabe , Jun Umemoto Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. [Citation Graph (0, 0)][DBLP ] Journal ] Susanne Albers , Bianca Schröder An Experimental Study of Online Scheduling Algorithms. [Citation Graph (0, 0)][DBLP ] Journal ] Kurt Mehlhorn , Guido Schäfer Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. [Citation Graph (0, 0)][DBLP ] Journal ] Stefan Edelkamp , Patrick Stiegeler Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons. [Citation Graph (0, 0)][DBLP ] Journal ] Thomas Erlebach , Klaus Jansen Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. [Citation Graph (0, 0)][DBLP ] Journal ] Isabelle Guérin Lassous , Jens Gustedt Portable List Ranking: An Experimental Study. [Citation Graph (0, 0)][DBLP ] Journal ] Jan Vahrenhold , Klaus Hinrichs Planar Point Location For Large Data Sets: To Seek Or Not To Seek. [Citation Graph (0, 0)][DBLP ] Journal ] Rajiv Wickremesinghe , Lars Arge , Jeffrey S. Chase , Jeffrey Scott Vitter Efficient Sorting Using Registers and Caches. [Citation Graph (0, 0)][DBLP ] Journal ] Francine Herrmann , Alain Hertz Finding the Chromatic Number by Means of Critical Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] 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. [Citation Graph (0, 0)][DBLP ] Journal ] Filippo Neri Relational Concept Learning by Cooperative Evolution. [Citation Graph (0, 0)][DBLP ] Journal ] 