Hans Jürgen Prömel

Publication Activity (10 Years)

Years Active: 1981-2007
Publications (10 Years): 0

Publications

Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz
-free subgraphs of random graphs revisited. Comb. 27 (3) (2007)
Hans Jürgen Prömel
Special Issue in Memory of Walter Deuber. Comb. Probab. Comput. 14 (1-2) (2005)
Hans Jürgen Prömel
Complete Disorder is Impossible: The Mathematical Work of Walter Deuber. Comb. Probab. Comput. 14 (1-2) (2005)
Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
Ordered binary decision diagrams and the Shannon effect. Discret. Appl. Math. 142 (1-3) (2004)
Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? Comb. 23 (1) (2003)
David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl
Independent Deuber sets in graphs on the natural numbers. J. Comb. Theory, Ser. A 103 (2) (2003)
Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
On random planar graphs, the number of planar graphs and their triangulations. J. Comb. Theory, Ser. B 88 (1) (2003)
Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger
A note on triangle-free and bipartite graphs. Discret. Math. 257 (2-3) (2002)
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
Steiner trees in uniformly quasi-bipartite graphs. Inf. Process. Lett. 83 (4) (2002)
Hans Jürgen Prömel
Large numbers, Knuth's arrow notation, and Ramsey theory. Synth. 133 (1-2) (2002)
Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
Phase Transitions in the Evolution of Partial Orders. J. Comb. Theory, Ser. A 94 (2) (2001)
Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger
On the structure of clique-free graphs. Random Struct. Algorithms 19 (1) (2001)
Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
On the evolution of the worst-case OBDD size. Inf. Process. Lett. 77 (1) (2001)
Hans Jürgen Prömel, Anusch Taraz
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. Computational Discrete Mathematics (2001)
Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
Counting Partial Orders With A Fixed Number Of Comparable Pairs. Comb. Probab. Comput. 10 (2) (2001)
David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl
Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers. J. Comb. Theory, Ser. A 93 (1) (2001)
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. WG (2001)
Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
Almost all graphs with high girth and suitable density have high chromatic number. J. Graph Theory 37 (4) (2001)
Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
Asymptotic enumeration, global structure, and constrained evolution. Discret. Math. 229 (1-3) (2001)
Hans Jürgen Prömel
Obituary Walter Deuber (1942-1999). Eur. J. Comb. 21 (6) (2000)
Hans Jürgen Prömel, Angelika Steger
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3. J. Algorithms 36 (1) (2000)
Graham R. Brightwell, David A. Grable, Hans Jürgen Prömel
Forbidden induced partial orders. Discret. Math. 201 (1-3) (1999)
Hans Jürgen Prömel, Vojtech Rödl
Non-Ramsey Graphs Are c log n-Universal. J. Comb. Theory, Ser. A 88 (2) (1999)
Stefan Hougardy, Hans Jürgen Prömel
A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. SODA (1999)
Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl
Induced Ramsey Numbers. Comb. 18 (3) (1998)
Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). STACS (1998)
Hans Jürgen Prömel, Angelika Steger
RNC-Approximation Algorithms for the Steiner Problem. STACS (1997)
Hans Jürgen Prömel, Angelika Steger
Counting H-free graphs. Discret. Math. 154 (1-3) (1996)
Graham R. Brightwell, Hans Jürgen Prömel, Angelika Steger
The Average Number of Linear Extensions of a Partial Order. J. Comb. Theory, Ser. A 73 (2) (1996)
Hans Jürgen Prömel, Angelika Steger
On the asymptotic structure of sparse triangle free graphs. J. Graph Theory 21 (2) (1996)
Hans Jürgen Prömel, Angelika Steger
Random I-Cororable Graphs. Random Struct. Algorithms 6 (1) (1995)
Walter A. Deuber, Hans Jürgen Prömel, Bernd Voigt
Preface. Discret. Math. 136 (1-3) (1994)
Stefan Hougardy, Hans Jürgen Prömel, Angelika Steger
Probabilistically checkable proofs and their consequences for approximation algorithms. Discret. Math. 136 (1-3) (1994)
Christoph Hundack, Hans Jürgen Prömel, Angelika Steger
Extremal Graph Problems for Graphs with a Color-Critical Vertex. Comb. Probab. Comput. 2 (1993)
Hans Jürgen Prömel, Angelika Steger
Excluding Induced Subgraphs II: Extremal Graphs. Discret. Appl. Math. 44 (1-3) (1993)
Hans Jürgen Prömel, Angelika Steger
The asymptotic number of graphs not containing a fixed color-critical subgraph. Comb. 12 (4) (1992)
Hans Jürgen Prömel, Angelika Steger
Almost all Berge Graphs are Perfect. Comb. Probab. Comput. 1 (1992)
Hans Jürgen Prömel, Angelika Steger
Coloring Clique-free Graphs in Linear Expected Time. Random Struct. Algorithms 3 (4) (1992)
Hans Jürgen Prömel, Bernd Voigt
From wqo to bqo, via Ellentuck's theorem. Discret. Math. 108 (1-3) (1992)
Hans Jürgen Prömel, Angelika Steger
The asymptotic structure of H-free graphs. Graph Structure Theory (1991)
Hans Jürgen Prömel, Angelika Steger
Excluding Induced Subgraphs: Quadrilaterals. Random Struct. Algorithms 2 (1) (1991)
Hans Jürgen Prömel, Bernd Voigt
Graham-Rothschild parameter words and measurable partitions. Comb. 11 (3) (1991)
Hans Jürgen Prömel, Wolfgang Thumser
Fast growing functions based on Ramsey theorems. Discret. Math. 95 (1-3) (1991)
Jörn Garbers, Bernhard Korte, Hans Jürgen Prömel, E. Schwietzke, Angelika Steger
VLSI: placement based on routing and timing information. EURO-DAC (1990)
Jörn Garbers, Hans Jürgen Prömel, Angelika Steger
Finding Clusters in VLSI Circuits. ICCAD (1990)
Asmus Hetzel, Bernhard Korte, Roland Krieger, Hans Jürgen Prömel, Ulf-Dietmar Radicke, Angelika Steger
Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design. Inform. Forsch. Entwickl. 5 (1) (1990)
Bernhard Korte, Hans Jürgen Prömel, Angelika Steger
Combining partitioning and global routing in sea-of-cells design. ICCAD (1989)
Hans Jürgen Prömel
Some remarks on natural orders for combinatorial cubes. Discret. Math. 73 (1-2) (1989)
Hans Jürgen Prömel, Bernd Voigt
A short proof of the restricted Ramsey theorem for finite set systems. J. Comb. Theory, Ser. A 52 (2) (1989)
Hans Jürgen Prömel, B. L. Rothschild
A canonical restricted version of van der Waerden's theorem. Comb. 7 (1) (1987)
Hans Jürgen Prömel
Counting unlabeled structures. J. Comb. Theory, Ser. A 44 (1) (1987)
Hans Jürgen Prömel, Bernd Voigt
Hereditary attributes of surjections and parameter sets. Eur. J. Comb. 7 (2) (1986)
Hans Jürgen Prömel
-hypergraphs. J. Comb. Theory, Ser. B 41 (3) (1986)
Hans Jürgen Prömel, Stephen G. Simpson, Bernd Voigt
A dual form of Erdös-Rado's canonization theorem. J. Comb. Theory, Ser. A 42 (2) (1986)
Hans Jürgen Prömel, Vojtech Rödl
An elementary proof of the canonizing version of Gallai-Witt's theorem. J. Comb. Theory, Ser. A 42 (1) (1986)
Jaroslav Nesetril, Hans Jürgen Prömel, Vojtech Rödl, Bernd Voigt
Canonizing Ordering Theorems for Hales Jewett Structures. J. Comb. Theory, Ser. A 40 (2) (1985)
Hans Jürgen Prömel, Bernd Voigt
Canonizing Ramsey theorems for finite graphs and hypergraphs. Discret. Math. 54 (1) (1985)
Hans Jürgen Prömel
Induced Partition Properties of Combinatorial Cubes. J. Comb. Theory, Ser. A 39 (2) (1985)
Hans Jürgen Prömel, Bernd Voigt
-> R. J. Comb. Theory, Ser. A 40 (2) (1985)
András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt
On the sum of the reciprocals of cycle lengths in sparse graphs. Comb. 5 (1) (1985)
Walter A. Deuber, Ronald L. Graham, Hans Jürgen Prömel, Bernd Voigt
. J. Comb. Theory, Ser. A 34 (3) (1983)
Hans Jürgen Prömel, Bernd Voigt
Canonical Partition Theorems for Parameter Sets. J. Comb. Theory, Ser. A 35 (3) (1983)
Hans Jürgen Prömel, Bernd Voigt
Partition theorems for parameter systems and graphs. Discret. Math. 36 (1) (1981)
Hans Jürgen Prömel, Bernd Voigt
Recent results in partition (Ramsey) theory for finite lattices. Discret. Math. 35 (1-3) (1981)