Journals in DBLP

Discrete Applied Mathematics
1992, volume: 40, number: 1

1. Thomas Andreae
   Some Results on Visibility Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1992, v:40, n:1, pp:5-17 [Journal]
   
2. Ulrich Faigle, Rainer Schrader, György Turán
   The Communication Complexity of Interval Orders. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1992, v:40, n:1, pp:19-28 [Journal]
   
3. Prabhakar Raghavan
   Integer Programming in VLSI Design. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1992, v:40, n:1, pp:29-43 [Journal]
   
4. Stefan Voß
   Steiner's Problem in Graphs: Heuristic Methods. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1992, v:40, n:1, pp:45-72 [Journal]
   
5. Dorothea Wagner, Frank Wagner
   An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1992, v:40, n:1, pp:73-81 [Journal]
   
6. Charlotte Wieners-Lummer
   A Manhattan Channel Router with Good Theoretical and Practical Performance. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1992, v:40, n:1, pp:83-104 [Journal]