


default search action
Discrete Mathematics, Volume 136
Volume 136, Numbers 1-3, December 1994
- Walter A. Deuber, Hans Jürgen Prömel, Bernd Voigt:

Preface. 1 - Martin Aigner, Eberhard Triesch:

Realizability and uniqueness in graphs. 3-20 - Hans-Jürgen Bandelt, Andreas W. M. Dress:

An order theoretic framework for overlapping clustering. 21-37 - Claude A. Christen:

Search problems: One, two or many rounds. 39-51 - Paul Erdös:

Problems and results in discrete mathematics. 53-73 - Paul Erdös, András Sárközy

, Vera T. Sós:
On additive properties of general sequences. 75-99 - Stefan Felsner, William T. Trotter:

On the fractional dimension of partially ordered sets. 101-117 - Ronald L. Graham:

Recent trends in Euclidean Ramsey theory. 119-127 - Peter Gritzmann, Victor Klee:

On the complexity of some basic problems in computational convexity: I. Containment problems. 129-174 - Stefan Hougardy, Hans Jürgen Prömel, Angelika Steger:

Probabilistically checkable proofs and their consequences for approximation algorithms. 175-223 - Tomasz Luczak

:
Phase transition phenomena in random discrete structures. 225-242 - E. C. Milner:

The use of elementary substructures in combinatorics. 243-252 - Pavel Pudlák, Vojtech Rödl:

Some combinatorial-algebraic problems from complexity theory. 253-279 - J. J. Seidel:

Isometric embeddings and geometric designs. 281-293 - Joel Spencer:

From Erdös to algorithms. 295-307 - Volker Strehl:

Binomial identities - combinatorial and algorithmic aspects. 309-346 - Ingo Wegener:

Efficient data structures for Boolean functions. 347-372 - D. J. A. Welsh:

The random cluster process. 373-390

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














