Journals in DBLP

Discrete Applied Mathematics
1991, volume: 34, number: 1-3

1. 
   Preface. [Citation Graph (, )][DBLP]
   
   
2. 
   Constructive complexity. [Citation Graph (, )][DBLP]
   
   
3. 
   q-functional equations and some partition identities. [Citation Graph (, )][DBLP]
   
   
4. 
   On doing Todd-Coxeter coset enumeration in parallel. [Citation Graph (, )][DBLP]
   
   
5. 
   The Mapmaker's dilemma. [Citation Graph (, )][DBLP]
   
   
6. 
   Computation of the expected number of leaves in a tree having a given automorphism, and related topics. [Citation Graph (, )][DBLP]
   
   
7. 
   Generalized flags in finite Abelian p-groups. [Citation Graph (, )][DBLP]
   
   
8. 
   Threshold functions for local properties of graphs: triangles. [Citation Graph (, )][DBLP]
   
   
9. 
   Brick tabloids and the connection matrices between bases of symmetric functions. [Citation Graph (, )][DBLP]
   
   
10. 
    Matchings and cycle covers in random digraphs. [Citation Graph (, )][DBLP]
    
    
11. 
    Semigroup automaton structure by homomorphism and domain partition. [Citation Graph (, )][DBLP]
    
    
12. 
    Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice. [Citation Graph (, )][DBLP]
    
    
13. 
    On a unique tree representation for P₄-extendible graphs. [Citation Graph (, )][DBLP]
    
    
14. 
    An introduction to randomized algorithms. [Citation Graph (, )][DBLP]
    
    
15. 
    Improved bounds for harmonic-based bin packing algorithms. [Citation Graph (, )][DBLP]
    
    
16. 
    The Riordan group. [Citation Graph (, )][DBLP]
    
    
17. 
    Some applications of algebra to combinatorics. [Citation Graph (, )][DBLP]
    
    
18. 
    The maximum number of winning 2-sets. [Citation Graph (, )][DBLP]