Journals in DBLP

Discrete Applied Mathematics
1994, volume: 55, number: 3

1. Esther M. Arkin, Refael Hassin
   Approximation Algorithms for the Geometric Covering Salesman Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:55, n:3, pp:197-218 [Journal]
   
2. Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
   Scheduling with Incompatible Jobs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:55, n:3, pp:219-232 [Journal]
   
3. Mao-cheng Cai
   An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:55, n:3, pp:233-239 [Journal]
   
4. Grant A. Cheston, Gerd Fricke
   Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:55, n:3, pp:241-258 [Journal]
   
5. J. A. Hoogeveen, Steef L. van de Velde, Bart Veltman
   Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:55, n:3, pp:259-272 [Journal]
   
6. Gilbert Laffond, Jean-François Laslier, Michel Le Breton
   The Copeland Measure of Condorcet Choice Functions. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:55, n:3, pp:273-279 [Journal]
   
7. Thierry Mautor, Catherine Roucairol
   A New Exact Algorithm for the Solution of Quadratic Assignment Problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:55, n:3, pp:281-293 [Journal]
   
8. Takao Nishizeki, Svatopluk Poljak
   k-Connectivity and Decomposition of Graphs into Forests. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:55, n:3, pp:295-301 [Journal]