Journals in DBLP

Discrete Mathematics
1994, volume: 136, number: 1-3

1. Walter A. Deuber, Hans Jürgen Prömel, Bernd Voigt
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1994, v:136, n:1-3, pp:1- [Journal]
   
2. Martin Aigner, Eberhard Triesch
   Realizability and uniqueness in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1994, v:136, n:1-3, pp:3-20 [Journal]
   
3. Hans-Jürgen Bandelt, Andreas W. M. Dress
   An order theoretic framework for overlapping clustering. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1994, v:136, n:1-3, pp:21-37 [Journal]
   
4. Claude A. Christen
   Search problems: One, two or many rounds. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1994, v:136, n:1-3, pp:39-51 [Journal]
   
5. Paul Erdös
   Problems and results in discrete mathematics. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1994, v:136, n:1-3, pp:53-73 [Journal]
   
6. Paul Erdös, András Sárközy, Vera T. Sós
   On additive properties of general sequences. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1994, v:136, n:1-3, pp:75-99 [Journal]
   
7. Stefan Felsner, William T. Trotter
   On the fractional dimension of partially ordered sets. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1994, v:136, n:1-3, pp:101-117 [Journal]
   
8. R. L. Graham
   Recent trends in Euclidean Ramsey theory. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1994, v:136, n:1-3, pp:119-127 [Journal]
   
9. Peter Gritzmann, Victor Klee
   On the complexity of some basic problems in computational convexity: I. Containment problems. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1994, v:136, n:1-3, pp:129-174 [Journal]
   
10. Stefan Hougardy, Hans Jürgen Prömel, Angelika Steger
    Probabilistically checkable proofs and their consequences for approximation algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:175-223 [Journal]
    
11. Tomasz Luczak
    Phase transition phenomena in random discrete structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:225-242 [Journal]
    
12. E. C. Milner
    The use of elementary substructures in combinatorics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:243-252 [Journal]
    
13. Pavel Pudlák, Vojtech Rödl
    Some combinatorial-algebraic problems from complexity theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:253-279 [Journal]
    
14. J. J. Seidel
    Isometric embeddings and geometric designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:281-293 [Journal]
    
15. Joel Spencer
    From Erdös to algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:295-307 [Journal]
    
16. Volker Strehl
    Binomial identities - combinatorial and algorithmic aspects. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:309-346 [Journal]
    
17. Ingo Wegener
    Efficient data structures for Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:347-372 [Journal]
    
18. D. J. A. Welsh
    The random cluster process. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:373-390 [Journal]