Journals in DBLP

J. Graph Algorithms Appl.
2001, volume: 5, number: 5

1. Takao Nishizeki, Roberto Tamassia, Dorothea Wagner
   Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
   J. Graph Algorithms Appl., 2001, v:5, n:5, pp:1- [Journal]
   
2. Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa
   Carrying Umbrellas: an Online Relocation Game on a Graph. [Citation Graph (0, 0)][DBLP]
   J. Graph Algorithms Appl., 2001, v:5, n:5, pp:3-16 [Journal]
   
3. Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
   New Bounds for Oblivious Mesh Routing. [Citation Graph (0, 0)][DBLP]
   J. Graph Algorithms Appl., 2001, v:5, n:5, pp:17-38 [Journal]
   
4. Enrico Nardelli, Guido Proietti, Peter Widmayer
   Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures. [Citation Graph (0, 0)][DBLP]
   J. Graph Algorithms Appl., 2001, v:5, n:5, pp:39-57 [Journal]
   
5. Matthias Müller-Hannemann
   Shelling Hexahedral Complexes for Mesh Generation. [Citation Graph (0, 0)][DBLP]
   J. Graph Algorithms Appl., 2001, v:5, n:5, pp:59-91 [Journal]
   
6. Hubert de Fraysseix, Patrice Ossona de Mendez
   Connectivity of Planar Graphs. [Citation Graph (0, 0)][DBLP]
   J. Graph Algorithms Appl., 2001, v:5, n:5, pp:93-105 [Journal]