
Journals in DBLP
 Andreas Brandstädt, HeinzJürgen Voss
Short Disjoint Cycles in Graphs with Degree Constraints. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:3, pp:197205 [Journal]
 Michael B. Dillencourt
Finding Hamiltonian Cycles in Delaunay Triangulations Is NPcomplete. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:3, pp:207217 [Journal]
 Alix Munier
The Basic Cyclic Scheduling Problem with Linear Precedence Constraints. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:3, pp:219238 [Journal]
 Carles Padró, Paz Morillo, Eduard Llobet Valero
Diametervulnerability of Large Bipartite Digraphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:3, pp:239248 [Journal]
 G. Sajith, Sanjeev Saxena
Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:3, pp:249265 [Journal]
 Terunao Soneoka, Makoto Imase, Yoshifumi Manabe
Design of a Dconnected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:3, pp:267279 [Journal]
 Rolf H. Möhring
Triangulating Graphs Without Asteroidal Triples. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:3, pp:281287 [Journal]
