
Journals in DBLP
Algorithmica 2004, volume: 41, number: 2
 Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. [Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:41, n:2, pp:7387 [Journal]
 Gonzalo Navarro, Mathieu Raffinot
New Techniques for Regular Expression Searching. [Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:41, n:2, pp:89116 [Journal]
 Jochen Könemann, Asaf Levin, Amitabh Sinha
Approximating the DegreeBounded Minimum Diameter Spanning Tree Problem. [Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:41, n:2, pp:117129 [Journal]
 Cees Duin
A BranchChecking Algorithm for AllPairs Shortest Paths. [Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:41, n:2, pp:131145 [Journal]
