Journals in DBLP
Algorithmica 2001, volume: 31, number: 4
Peter A. Beling Exact Algorithms for Linear Programming over Algebraic Extensions. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2001, v:31, n:4, pp:459-478 [Journal ] Guoliang Xue , Guo-Hui Lin , Ding-Zhu Du Grade of Service Steiner Minimum Trees in the Euclidean Plane. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2001, v:31, n:4, pp:479-500 [Journal ] Kim S. Larsen , Eljas Soisalon-Soininen , Peter Widmayer Relaxed Balance Using Standard Rotations. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2001, v:31, n:4, pp:501-512 [Journal ] Ruy Luiz Milidiú , Eduardo Sany Laber Bounding the Inefficiency of Length-Restricted Prefix Codes. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2001, v:31, n:4, pp:513-529 [Journal ] B. Das , Michael C. Loui Reconstructing a Minimum Spanning Tree after Deletion of Any Node. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2001, v:31, n:4, pp:530-547 [Journal ]