Journals in DBLP

Discrete Applied Mathematics
2001, volume: 113, number: 1

1. Ronny Hadany, David Harel
   A multi-scale algorithm for drawing graphs nicely. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:1, pp:3-21 [Journal]
   
2. Paola Flocchini, Frédéric Geurts, Nicola Santoro
   Optimal irreversible dynamos in chordal rings. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:1, pp:23-42 [Journal]
   
3. Olivier Baudon, Guillaume Fertin, Ivan Havel
   Routing permutations and 2-1 routing requests in the hypercube. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:1, pp:43-58 [Journal]
   
4. Jirí Fiala, Ton Kloks, Jan Kratochvíl
   Fixed-parameter complexity of lambda-labelings. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:1, pp:59-72 [Journal]
   
5. Hans-Christoph Wirth, Jan Steffan
   Reload cost problems: minimum diameter spanning tree. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:1, pp:73-85 [Journal]
   
6. Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth
   Euler is standing in line dial-a-ride problems with precedence-constraints. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:1, pp:87-107 [Journal]
   
7. Assaf Natanzon, Ron Shamir, Roded Sharan
   Complexity classification of some edge modification problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:1, pp:109-128 [Journal]