| 2005 |
|---|
| 59 | EE | Hans Jürgen Prömel:
Special Issue in Memory of Walter Deuber.
Combinatorics, Probability & Computing 14(1-2): 1 (2005) |
| 58 | EE | Hans Jürgen Prömel:
Complete Disorder is Impossible: The Mathematical Work of Walter Deuber.
Combinatorics, Probability & Computing 14(1-2): 3-16 (2005) |
| 2004 |
|---|
| 57 | EE | Clemens Gröpl,
Hans Jürgen Prömel,
Anand Srivastav:
Ordered binary decision diagrams and the Shannon effect.
Discrete Applied Mathematics 142(1-3): 67-85 (2004) |
| 2003 |
|---|
| 56 | EE | Deryk Osthus,
Hans Jürgen Prömel,
Anusch Taraz:
For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
Combinatorica 23(1): 105-150 (2003) |
| 55 | EE | 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): 305-322 (2003) |
| 54 | EE | 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): 119-134 (2003) |
| 2002 |
|---|
| 53 | EE | Hans Jürgen Prömel,
Thomas Schickinger,
Angelika Steger:
A note on triangle-free and bipartite graphs.
Discrete Mathematics 257(2-3): 531-540 (2002) |
| 52 | EE | Clemens Gröpl,
Stefan Hougardy,
Till Nierhoff,
Hans Jürgen Prömel:
Steiner trees in uniformly quasi-bipartite graphs.
Inf. Process. Lett. 83(4): 195-200 (2002) |
| 2001 |
|---|
| 51 | EE | Hans Jürgen Prömel,
Anusch Taraz:
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders.
Computational Discrete Mathematics 2001: 98-118 |
| 50 | EE | Clemens Gröpl,
Stefan Hougardy,
Till Nierhoff,
Hans Jürgen Prömel:
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.
WG 2001: 217-228 |
| 49 | | Hans Jürgen Prömel,
Angelika Steger,
Anusch Taraz:
Counting Partial Orders With A Fixed Number Of Comparable Pairs.
Combinatorics, Probability & Computing 10(2): (2001) |
| 48 | EE | Hans Jürgen Prömel,
Angelika Steger,
Anusch Taraz:
Asymptotic enumeration, global structure, and constrained evolution.
Discrete Mathematics 229(1-3): 213-233 (2001) |
| 47 | EE | Clemens Gröpl,
Hans Jürgen Prömel,
Anand Srivastav:
On the evolution of the worst-case OBDD size.
Inf. Process. Lett. 77(1): 1-7 (2001) |
| 46 | EE | 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): 1-17 (2001) |
| 45 | EE | Hans Jürgen Prömel,
Angelika Steger,
Anusch Taraz:
Phase Transitions in the Evolution of Partial Orders.
J. Comb. Theory, Ser. A 94(2): 230-275 (2001) |
| 44 | | Hans Jürgen Prömel,
Thomas Schickinger,
Angelika Steger:
On the structure of clique-free graphs.
Random Struct. Algorithms 19(1): 37-53 (2001) |
| 2000 |
|---|
| 43 | EE | Hans Jürgen Prömel:
Obituary Walter Deuber (1942-1999).
Eur. J. Comb. 21(6): 697-699 (2000) |
| 42 | | 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): 89-101 (2000) |
| 1999 |
|---|
| 41 | EE | Stefan Hougardy,
Hans Jürgen Prömel:
A 1.598 Approximation Algorithm for the Steiner Problem in Graphs.
SODA 1999: 448-453 |
| 40 | EE | Graham Brightwell,
David A. Grable,
Hans Jürgen Prömel:
Forbidden induced partial orders.
Discrete Mathematics 201(1-3): 53-80 (1999) |
| 39 | EE | Hans Jürgen Prömel,
Vojtech Rödl:
Non-Ramsey Graphs Are c log n-Universal.
J. Comb. Theory, Ser. A 88(2): 379-384 (1999) |
| 1998 |
|---|
| 38 | | Ernst W. Mayr,
Hans Jürgen Prömel,
Angelika Steger:
Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997)
Springer 1998 |
| 37 | | Clemens Gröpl,
Hans Jürgen Prömel,
Anand Srivastav:
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract).
STACS 1998: 238-248 |
| 36 | EE | Yoshiharu Kohayakawa,
Hans Jürgen Prömel,
Vojtech Rödl:
Induced Ramsey Numbers.
Combinatorica 18(3): 373-404 (1998) |
| 1997 |
|---|
| 35 | | Hans Jürgen Prömel,
Angelika Steger:
RNC-Approximation Algorithms for the Steiner Problem.
STACS 1997: 559-570 |
| 1996 |
|---|
| 34 | EE | Hans Jürgen Prömel,
Angelika Steger:
Counting H-free graphs.
Discrete Mathematics 154(1-3): 311-315 (1996) |
| 33 | EE | Graham 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): 193-206 (1996) |
| 1995 |
|---|
| 32 | | Hans Jürgen Prömel,
Angelika Steger:
Random I-Cororable Graphs.
Random Struct. Algorithms 6(1): 21-38 (1995) |
| 1994 |
|---|
| 31 | EE | Walter A. Deuber,
Hans Jürgen Prömel,
Bernd Voigt:
Preface.
Discrete Mathematics 136(1-3): 1 (1994) |
| 30 | EE | Stefan Hougardy,
Hans Jürgen Prömel,
Angelika Steger:
Probabilistically checkable proofs and their consequences for approximation algorithms.
Discrete Mathematics 136(1-3): 175-223 (1994) |
| 1993 |
|---|
| 29 | | Christofh Hundack,
Hans Jürgen Prömel,
Angelika Steger:
Extremal Graph Problems for Graphs with a Color-Critical Vertex.
Combinatorics, Probability & Computing 2: 465-477 (1993) |
| 28 | EE | Hans Jürgen Prömel,
Angelika Steger:
Excluding Induced Subgraphs II: Extremal Graphs.
Discrete Applied Mathematics 44(1-3): 283-294 (1993) |
| 1992 |
|---|
| 27 | | Hans Jürgen Prömel,
Angelika Steger:
The asymptotic number of graphs not containing a fixed color-critical subgraph.
Combinatorica 12(4): 463-473 (1992) |
| 26 | | Hans Jürgen Prömel,
Angelika Steger:
Almost all Berge Graphs are Perfect.
Combinatorics, Probability & Computing 1: 53-79 (1992) |
| 25 | EE | Hans Jürgen Prömel,
Bernd Voigt:
From wqo to bqo, via Ellentuck's theorem.
Discrete Mathematics 108(1-3): 83-106 (1992) |
| 24 | | Hans Jürgen Prömel,
Angelika Steger:
Coloring Clique-free Graphs in Linear Expected Time.
Random Struct. Algorithms 3(4): 375-402 (1992) |
| 1991 |
|---|
| 23 | | Hans Jürgen Prömel,
Angelika Steger:
The asymptotic structure of H-free graphs.
Graph Structure Theory 1991: 167-178 |
| 22 | | Hans Jürgen Prömel,
Bernd Voigt:
Graham-Rothschild parameter words and measurable partitions.
Combinatorica 11(3): 253-260 (1991) |
| 21 | EE | Hans Jürgen Prömel,
Wolfgang Thumser:
Fast growing functions based on Ramsey theorems.
Discrete Mathematics 95(1-3): 341-358 (1991) |
| 20 | | Hans Jürgen Prömel,
Angelika Steger:
Excluding Induced Subgraphs: Quadrilaterals.
Random Struct. Algorithms 2(1): 55-72 (1991) |
| 1990 |
|---|
| 19 | EE | 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: 317-321 |
| 18 | | Jörn Garbers,
Hans Jürgen Prömel,
Angelika Steger:
Finding Clusters in VLSI Circuits.
ICCAD 1990: 520-523 |
| 17 | | 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): 2-19 (1990) |
| 1989 |
|---|
| 16 | EE | Hans Jürgen Prömel:
Some remarks on natural orders for combinatorial cubes.
Discrete Mathematics 73(1-2): 189-198 (1989) |
| 15 | EE | 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): 313-320 (1989) |
| 1987 |
|---|
| 14 | | Hans Jürgen Prömel,
B. L. Rothschild:
A canonical restricted version of van der Waerden's theorem.
Combinatorica 7(1): 115-119 (1987) |
| 13 | EE | Hans Jürgen Prömel:
Counting unlabeled structures.
J. Comb. Theory, Ser. A 44(1): 83-93 (1987) |
| 1986 |
|---|
| 12 | EE | 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): 144-149 (1986) |
| 11 | EE | Hans Jürgen Prömel,
S. G. Simpson,
Bernd Voigt:
A dual form of Erdös-Rado's canonization theorem.
J. Comb. Theory, Ser. A 42(2): 159-178 (1986) |
| 10 | EE | Hans Jürgen Prömel:
Partition properties of q-hypergraphs.
J. Comb. Theory, Ser. B 41(3): 356-385 (1986) |
| 1985 |
|---|
| 9 | | 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.
Combinatorica 5(1): 41-52 (1985) |
| 8 | EE | Hans Jürgen Prömel,
Bernd Voigt:
Canonizing Ramsey theorems for finite graphs and hypergraphs.
Discrete Mathematics 54(1): 49-59 (1985) |
| 7 | | Hans Jürgen Prömel:
Induced Partition Properties of Combinatorial Cubes.
J. Comb. Theory, Ser. A 39(2): 177-208 (1985) |
| 6 | | 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): 394-408 (1985) |
| 5 | | Hans Jürgen Prömel,
Bernd Voigt:
Canonical Forms of Borel-Measurable Mappings Delta: [omega]omega -> R.
J. Comb. Theory, Ser. A 40(2): 409-417 (1985) |
| 1983 |
|---|
| 4 | | Walter A. Deuber,
Ronald L. Graham,
Hans Jürgen Prömel,
Bernd Voigt:
A Canonical Partition Theorem for Equivalence Relations on Zt.
J. Comb. Theory, Ser. A 34(3): 331-339 (1983) |
| 3 | | Hans Jürgen Prömel,
Bernd Voigt:
Canonical Partition Theorems for Parameter Sets.
J. Comb. Theory, Ser. A 35(3): 309-327 (1983) |
| 1981 |
|---|
| 2 | EE | Hans Jürgen Prömel,
Bernd Voigt:
Recent results in partition (Ramsey) theory for finite lattices.
Discrete Mathematics 35(1-3): 185-198 (1981) |
| 1 | EE | Hans Jürgen Prömel,
Bernd Voigt:
Partition theorems for parameter systems and graphs.
Discrete Mathematics 36(1): 83-96 (1981) |
