Journals in DBLP

Discrete Applied Mathematics
1991, volume: 30, number: 1

1. 
   A convoy scheduling problem. [Citation Graph (, )][DBLP]
   
   
2. 
   NP-completeness of edge-colouring some restricted graphs. [Citation Graph (, )][DBLP]
   
   
3. 
   Approximation algorithms for hitting objects with straight lines. [Citation Graph (, )][DBLP]
   
   
4. 
   On an edge ranking problem of trees and graphs. [Citation Graph (, )][DBLP]
   
   
5. 
   Parallel machines scheduling with nonsimultaneous machine available time. [Citation Graph (, )][DBLP]
   
   
6. 
   When each hexagon of a hexagonal system covers it. [Citation Graph (, )][DBLP]
   
   
7. 
   A note on isomorphic simulation of automata by networks of two-state automata. [Citation Graph (, )][DBLP]
   
   
8. 
   Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones. [Citation Graph (, )][DBLP]
   
   
9. 
   A difficulty in particular Shannon-like games. [Citation Graph (, )][DBLP]
   
   
10. 
    Corrigendum. [Citation Graph (, )][DBLP]