Journals in DBLP

Discrete Applied Mathematics
1996, volume: 64, number: 3

1. Andreas Brandstädt, Heinz-Jürgen Voss
   Short Disjoint Cycles in Graphs with Degree Constraints. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1996, v:64, n:3, pp:197-205 [Journal]
   
2. Michael B. Dillencourt
   Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1996, v:64, n:3, pp:207-217 [Journal]
   
3. 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:219-238 [Journal]
   
4. Carles Padró, Paz Morillo, Eduard Llobet Valero
   Diameter-vulnerability of Large Bipartite Digraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1996, v:64, n:3, pp:239-248 [Journal]
   
5. 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:249-265 [Journal]
   
6. Terunao Soneoka, Makoto Imase, Yoshifumi Manabe
   Design of a D-connected 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:267-279 [Journal]
   
7. Rolf H. Möhring
   Triangulating Graphs Without Asteroidal Triples. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1996, v:64, n:3, pp:281-287 [Journal]