Hans Jürgen Prömel

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