Journals in DBLP
Ulrik Brandes , Dorothea Wagner Foreword: Special Issue of Journal of Discrete Algorithms on the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '2000) held June 15-17, 2000 in Konstanz, Germany. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2004, v:2, n:4, pp:381- [Journal ] Serafino Cicerone , Gabriele Di Stefano Networks with small stretch number. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2004, v:2, n:4, pp:383-405 [Journal ] Ingo Demgensky , Hartmut Noltemeier , Hans-Christoph Wirth Optimizing cost flows by edge cost and capacity upgrade. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2004, v:2, n:4, pp:407-423 [Journal ] Stefan Dobrev Computing input multiplicity in anonymous synchronous networks with dynamic faults. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2004, v:2, n:4, pp:425-438 [Journal ] Ekkehard Köhler Recognizing graphs without asteroidal triples. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2004, v:2, n:4, pp:439-452 [Journal ] Goran Konjevod , Sven Oliver Krumke , Madhav V. Marathe Budget constrained minimum cost connected medians. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2004, v:2, n:4, pp:453-469 [Journal ] Andreas Jakoby , Maciej Liskiewicz , Rüdiger Reischuk Approximating schedules for dynamic process graphs efficiently. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2004, v:2, n:4, pp:471-500 [Journal ] Luca Becchetti , Miriam Di Ianni , Alberto Marchetti-Spaccamela Approximating call-scheduling makespan in all-optical networks. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2004, v:2, n:4, pp:501-515 [Journal ] Koichi Wada , Wei Chen Optimal fault-tolerant routings with small routing tables for k -connected graphs. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2004, v:2, n:4, pp:517-530 [Journal ]