Journals in DBLP

Discrete Applied Mathematics
1991, volume: 30, number: 2-3

1. 
   Acknowledgement. [Citation Graph (, )][DBLP]
   
   
2. 
   Some recent results on niche graphs. [Citation Graph (, )][DBLP]
   
   
3. 
   The basic cyclic scheduling problem with deadlines. [Citation Graph (, )][DBLP]
   
   
4. 
   The relationship between the threshold dimension of split graphs and various dimensional parameters. [Citation Graph (, )][DBLP]
   
   
5. 
   On the use of augmenting chains in chain packings. [Citation Graph (, )][DBLP]
   
   
6. 
   Lopsided Lovász Local Lemma and Latin transversals. [Citation Graph (, )][DBLP]
   
   
7. 
   A deletion game on hypergraphs. [Citation Graph (, )][DBLP]
   
   
8. 
   Cut-threshold graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   The continuous center set of a network. [Citation Graph (, )][DBLP]
   
   
10. 
    Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems. [Citation Graph (, )][DBLP]
    
    
11. 
    Holes in random graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    Lattice bandwidth of random graphs. [Citation Graph (, )][DBLP]
    
    
13. 
    Connectivity of generalized prisms over G. [Citation Graph (, )][DBLP]
    
    
14. 
    Threshold spectra via the Ehrenfeucht game. [Citation Graph (, )][DBLP]
    
    
15. 
    A note on compact graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    A generalization of the zero-one principle for sorting algorithms. [Citation Graph (, )][DBLP]