Hans Jürgen Prömel

  • Präsident der Technischen Universität Darmstadt

According to our database1, Hans Jürgen Prömel authored at least 64 papers between 1981 and 2007.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


<i>K</i> <sub>4</sub>-free subgraphs of random graphs revisited.
Comb., 2007

Complete Disorder is Impossible: The Mathematical Work of Walter Deuber.
Comb. Probab. Comput., 2005

Special Issue in Memory of Walter Deuber.
Comb. Probab. Comput., 2005

Ordered binary decision diagrams and the Shannon effect.
Discret. Appl. Math., 2004

On random planar graphs, the number of planar graphs and their triangulations.
J. Comb. Theory B, 2003

Independent Deuber sets in graphs on the natural numbers.
J. Comb. Theory A, 2003

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
Comb., 2003

Large numbers, Knuth's arrow notation, and Ramsey theory.
Synth., 2002

Steiner trees in uniformly quasi-bipartite graphs.
Inf. Process. Lett., 2002

A note on triangle-free and bipartite graphs.
Discret. Math., 2002

On the structure of clique-free graphs.
Random Struct. Algorithms, 2001

Almost all graphs with high girth and suitable density have high chromatic number.
J. Graph Theory, 2001

Phase Transitions in the Evolution of Partial Orders.
J. Comb. Theory A, 2001

Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers.
J. Comb. Theory A, 2001

On the evolution of the worst-case OBDD size.
Inf. Process. Lett., 2001

Asymptotic enumeration, global structure, and constrained evolution.
Discret. Math., 2001

Counting Partial Orders With A Fixed Number Of Comparable Pairs.
Comb. Probab. Comput., 2001

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders.
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3.
J. Algorithms, 2000

Obituary Walter Deuber (1942-1999).
Eur. J. Comb., 2000

Non-Ramsey Graphs Are c log n-Universal.
J. Comb. Theory A, 1999

Forbidden induced partial orders.
Discret. Math., 1999

A 1.598 Approximation Algorithm for the Steiner Problem in Graphs.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Induced Ramsey Numbers.
Comb., 1998

Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract).
Proceedings of the STACS 98, 1998

RNC-Approximation Algorithms for the Steiner Problem.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

On the asymptotic structure of sparse triangle free graphs.
J. Graph Theory, 1996

The Average Number of Linear Extensions of a Partial Order.
J. Comb. Theory A, 1996

Counting H-free graphs.
Discret. Math., 1996

Random I-Cororable Graphs.
Random Struct. Algorithms, 1995

Probabilistically checkable proofs and their consequences for approximation algorithms.
Discret. Math., 1994

Discret. Math., 1994

Excluding Induced Subgraphs II: Extremal Graphs.
Discret. Appl. Math., 1993

Extremal Graph Problems for Graphs with a Color-Critical Vertex.
Comb. Probab. Comput., 1993

Coloring Clique-free Graphs in Linear Expected Time.
Random Struct. Algorithms, 1992

From wqo to bqo, via Ellentuck's theorem.
Discret. Math., 1992

Almost all Berge Graphs are Perfect.
Comb. Probab. Comput., 1992

The asymptotic number of graphs not containing a fixed color-critical subgraph.
Comb., 1992

Excluding Induced Subgraphs: Quadrilaterals.
Random Struct. Algorithms, 1991

Fast growing functions based on Ramsey theorems.
Discret. Math., 1991

Graham-Rothschild parameter words and measurable partitions.
Comb., 1991

The asymptotic structure of H-free graphs.
Proceedings of the Graph Structure Theory, 1991

Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design.
Inform. Forsch. Entwickl., 1990

Finding Clusters in VLSI Circuits.
Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 1990

VLSI: placement based on routing and timing information.
Proceedings of the European Design Automation Conference, 1990

A short proof of the restricted Ramsey theorem for finite set systems.
J. Comb. Theory A, 1989

Some remarks on natural orders for combinatorial cubes.
Discret. Math., 1989

Combining partitioning and global routing in sea-of-cells design.
Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, 1989

Counting unlabeled structures.
J. Comb. Theory A, 1987

A canonical restricted version of van der Waerden's theorem.
Comb., 1987

A dual form of Erdös-Rado's canonization theorem.
J. Comb. Theory A, 1986

An elementary proof of the canonizing version of Gallai-Witt's theorem.
J. Comb. Theory A, 1986

Partition properties of <i>q</i>-hypergraphs.
J. Comb. Theory B, 1986

Hereditary attributes of surjections and parameter sets.
Eur. J. Comb., 1986

Canonical Forms of Borel-Measurable Mappings Delta: [omega]<sup>omega</sup> -> R.
J. Comb. Theory A, 1985

Induced Partition Properties of Combinatorial Cubes.
J. Comb. Theory A, 1985

Canonizing Ordering Theorems for Hales Jewett Structures.
J. Comb. Theory A, 1985

Canonizing Ramsey theorems for finite graphs and hypergraphs.
Discret. Math., 1985

On the sum of the reciprocals of cycle lengths in sparse graphs.
Comb., 1985

Canonical Partition Theorems for Parameter Sets.
J. Comb. Theory A, 1983

A Canonical Partition Theorem for Equivalence Relations on Z<sup>t</sup>.
J. Comb. Theory A, 1983

Partition theorems for parameter systems and graphs.
Discret. Math., 1981

Recent results in partition (Ramsey) theory for finite lattices.
Discret. Math., 1981