Recent results in partition (Ramsey) theory for finite lattices. - Hans Jürgen Prömel; Bernd Voigt (Discret. Math., 1981)

Partition theorems for parameter systems and graphs. - Hans Jürgen Prömel; Bernd Voigt (Discret. Math., 1981)

A Canonical Partition Theorem for Equivalence Relations on Zt. - Walter A. Deuber; Ronald L. Graham; Hans Jürgen Prömel; Bernd Voigt (J. Comb. Theory A, 1983)

Canonical Partition Theorems for Parameter Sets. - Hans Jürgen Prömel; Bernd Voigt (J. Comb. Theory A, 1983)

On the sum of the reciprocals of cycle lengths in sparse graphs. - András Gyárfás; Hans Jürgen Prömel; Endre Szemerédi; Bernd Voigt (Comb., 1985)

Canonizing Ramsey theorems for finite graphs and hypergraphs. - Hans Jürgen Prömel; Bernd Voigt (Discret. Math., 1985)

Canonizing Ordering Theorems for Hales Jewett Structures. - Jaroslav Nesetril; Hans Jürgen Prömel; Vojtech Rödl; Bernd Voigt (J. Comb. Theory A, 1985)

Induced Partition Properties of Combinatorial Cubes. - Hans Jürgen Prömel (J. Comb. Theory A, 1985)

Canonical Forms of Borel-Measurable Mappings Delta: [omega]omega -> R. - Hans Jürgen Prömel; Bernd Voigt (J. Comb. Theory A, 1985)

Hereditary attributes of surjections and parameter sets. - Hans Jürgen Prömel; Bernd Voigt (Eur. J. Comb., 1986)

Partition properties of q-hypergraphs. - Hans Jürgen Prömel (J. Comb. Theory B, 1986)

An elementary proof of the canonizing version of Gallai-Witt's theorem. - Hans Jürgen Prömel; Vojtech Rödl (J. Comb. Theory A, 1986)

A dual form of Erdös-Rado's canonization theorem. - Hans Jürgen Prömel; Stephen G. Simpson; Bernd Voigt (J. Comb. Theory A, 1986)

A canonical restricted version of van der Waerden's theorem. - Hans Jürgen Prömel; B. L. Rothschild (Comb., 1987)

Counting unlabeled structures. - Hans Jürgen Prömel (J. Comb. Theory A, 1987)

Combining partitioning and global routing in sea-of-cells design. - Bernhard Korte; Hans Jürgen Prömel; Angelika Steger (ICCAD, 1989)

Some remarks on natural orders for combinatorial cubes. - Hans Jürgen Prömel (Discret. Math., 1989)

A short proof of the restricted Ramsey theorem for finite set systems. - Hans Jürgen Prömel; Bernd Voigt (J. Comb. Theory A, 1989)

VLSI: placement based on routing and timing information. - Jörn Garbers; Bernhard Korte; Hans Jürgen Prömel; E. Schwietzke; Angelika Steger (EURO-DAC, 1990)

Finding Clusters in VLSI Circuits. - Jörn Garbers; Hans Jürgen Prömel; Angelika Steger (ICCAD, 1990)

Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design. - Asmus Hetzel; Bernhard Korte; Roland Krieger; Hans Jürgen Prömel; Ulf-Dietmar Radicke; Angelika Steger (Inform. Forsch. Entwickl., 1990)

The asymptotic structure of H-free graphs. - Hans Jürgen Prömel; Angelika Steger (Graph Structure Theory, 1991)

Graham-Rothschild parameter words and measurable partitions. - Hans Jürgen Prömel; Bernd Voigt (Comb., 1991)

Fast growing functions based on Ramsey theorems. - Hans Jürgen Prömel; Wolfgang Thumser (Discret. Math., 1991)

Excluding Induced Subgraphs: Quadrilaterals. - Hans Jürgen Prömel; Angelika Steger (Random Struct. Algorithms, 1991)

The asymptotic number of graphs not containing a fixed color-critical subgraph. - Hans Jürgen Prömel; Angelika Steger (Comb., 1992)

Almost all Berge Graphs are Perfect. - Hans Jürgen Prömel; Angelika Steger (Comb. Probab. Comput., 1992)

From wqo to bqo, via Ellentuck's theorem. - Hans Jürgen Prömel; Bernd Voigt (Discret. Math., 1992)

Coloring Clique-free Graphs in Linear Expected Time. - Hans Jürgen Prömel; Angelika Steger (Random Struct. Algorithms, 1992)

Extremal Graph Problems for Graphs with a Color-Critical Vertex. - Christoph Hundack; Hans Jürgen Prömel; Angelika Steger (Comb. Probab. Comput., 1993)

Excluding Induced Subgraphs II: Extremal Graphs. - Hans Jürgen Prömel; Angelika Steger (Discret. Appl. Math., 1993)

Preface. - Walter A. Deuber; Hans Jürgen Prömel; Bernd Voigt (Discret. Math., 1994)

Probabilistically checkable proofs and their consequences for approximation algorithms. - Stefan Hougardy; Hans Jürgen Prömel; Angelika Steger (Discret. Math., 1994)

Random I-Cororable Graphs. - Hans Jürgen Prömel; Angelika Steger (Random Struct. Algorithms, 1995)

Counting H-free graphs. - Hans Jürgen Prömel; Angelika Steger (Discret. Math., 1996)

The Average Number of Linear Extensions of a Partial Order. - Graham R. Brightwell; Hans Jürgen Prömel; Angelika Steger (J. Comb. Theory A, 1996)

On the asymptotic structure of sparse triangle free graphs. - Hans Jürgen Prömel; Angelika Steger (J. Graph Theory, 1996)

RNC-Approximation Algorithms for the Steiner Problem. - Hans Jürgen Prömel; Angelika Steger (STACS, 1997)

Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). - Clemens Gröpl; Hans Jürgen Prömel; Anand Srivastav (STACS, 1998)

Induced Ramsey Numbers. - Yoshiharu Kohayakawa; Hans Jürgen Prömel; Vojtech Rödl (Comb., 1998)

A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. - Stefan Hougardy; Hans Jürgen Prömel (SODA, 1999)

Forbidden induced partial orders. - Graham R. Brightwell; David A. Grable; Hans Jürgen Prömel (Discret. Math., 1999)

Non-Ramsey Graphs Are c log n-Universal. - Hans Jürgen Prömel; Vojtech Rödl (J. Comb. Theory A, 1999)

Obituary Walter Deuber (1942-1999). - Hans Jürgen Prömel (Eur. J. Comb., 2000)

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3. - Hans Jürgen Prömel; Angelika Steger (J. Algorithms, 2000)

Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. - Hans Jürgen Prömel; Anusch Taraz (Computational Discrete Mathematics, 2001)

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. - Clemens Gröpl; Stefan Hougardy; Till Nierhoff; Hans Jürgen Prömel (WG, 2001)

Counting Partial Orders With A Fixed Number Of Comparable Pairs. - Hans Jürgen Prömel; Angelika Steger; Anusch Taraz (Comb. Probab. Comput., 2001)

Asymptotic enumeration, global structure, and constrained evolution. - Hans Jürgen Prömel; Angelika Steger; Anusch Taraz (Discret. Math., 2001)

On the evolution of the worst-case OBDD size. - Clemens Gröpl; Hans Jürgen Prömel; Anand Srivastav (Inf. Process. Lett., 2001)

Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers. - David S. Gunderson; Imre Leader; Hans Jürgen Prömel; Vojtech Rödl (J. Comb. Theory A, 2001)

Phase Transitions in the Evolution of Partial Orders. - Hans Jürgen Prömel; Angelika Steger; Anusch Taraz (J. Comb. Theory A, 2001)

Almost all graphs with high girth and suitable density have high chromatic number. - Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz (J. Graph Theory, 2001)

On the structure of clique-free graphs. - Hans Jürgen Prömel; Thomas Schickinger; Angelika Steger (Random Struct. Algorithms, 2001)

A note on triangle-free and bipartite graphs. - Hans Jürgen Prömel; Thomas Schickinger; Angelika Steger (Discret. Math., 2002)

Steiner trees in uniformly quasi-bipartite graphs. - Clemens Gröpl; Stefan Hougardy; Till Nierhoff; Hans Jürgen Prömel (Inf. Process. Lett., 2002)

Large numbers, Knuth's arrow notation, and Ramsey theory. - Hans Jürgen Prömel (Synth., 2002)

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? - Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz (Comb., 2003)

Independent Deuber sets in graphs on the natural numbers. - David S. Gunderson; Imre Leader; Hans Jürgen Prömel; Vojtech Rödl (J. Comb. Theory A, 2003)

On random planar graphs, the number of planar graphs and their triangulations. - Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz (J. Comb. Theory B, 2003)

Ordered binary decision diagrams and the Shannon effect. - Clemens Gröpl; Hans Jürgen Prömel; Anand Srivastav (Discret. Appl. Math., 2004)

Special Issue in Memory of Walter Deuber. - Hans Jürgen Prömel (Comb. Probab. Comput., 2005)

Complete Disorder is Impossible: The Mathematical Work of Walter Deuber. - Hans Jürgen Prömel (Comb. Probab. Comput., 2005)

K 4-free subgraphs of random graphs revisited. - Stefanie Gerke; Hans Jürgen Prömel; Thomas Schickinger; Angelika Steger; Anusch Taraz (Comb., 2007)