Hans Jürgen Prömel

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.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2007
K 4-free subgraphs of random graphs revisited.
Combinatorica, 2007

2005
Complete Disorder is Impossible: The Mathematical Work of Walter Deuber.
Combinatorics, Probability & Computing, 2005

Special Issue in Memory of Walter Deuber.
Combinatorics, Probability & Computing, 2005

2004
Ordered binary decision diagrams and the Shannon effect.
Discrete Applied Mathematics, 2004

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

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

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

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

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

A note on triangle-free and bipartite graphs.
Discrete Mathematics, 2002

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

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

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

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

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

Asymptotic enumeration, global structure, and constrained evolution.
Discrete Mathematics, 2001

Counting Partial Orders With A Fixed Number Of Comparable Pairs.
Combinatorics, Probability & Computing, 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

2000
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

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

Forbidden induced partial orders.
Discrete Mathematics, 1999

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

1998
Induced Ramsey Numbers.
Combinatorica, 1998

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

1997
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

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

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

Counting H-free graphs.
Discrete Mathematics, 1996

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

1994
Probabilistically checkable proofs and their consequences for approximation algorithms.
Discrete Mathematics, 1994

Preface.
Discrete Mathematics, 1994

1993
Excluding Induced Subgraphs II: Extremal Graphs.
Discrete Applied Mathematics, 1993

Extremal Graph Problems for Graphs with a Color-Critical Vertex.
Combinatorics, Probability & Computing, 1993

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

From wqo to bqo, via Ellentuck's theorem.
Discrete Mathematics, 1992

Almost all Berge Graphs are Perfect.
Combinatorics, Probability & Computing, 1992

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

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

Fast growing functions based on Ramsey theorems.
Discrete Mathematics, 1991

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

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

1990
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

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

Some remarks on natural orders for combinatorial cubes.
Discrete Mathematics, 1989

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

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

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

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

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

Partition properties of q-hypergraphs.
J. Comb. Theory, Ser. B, 1986

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

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

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

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

Canonizing Ramsey theorems for finite graphs and hypergraphs.
Discrete Mathematics, 1985

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

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

A Canonical Partition Theorem for Equivalence Relations on Zt.
J. Comb. Theory, Ser. A, 1983

1981
Partition theorems for parameter systems and graphs.
Discrete Mathematics, 1981

Recent results in partition (Ramsey) theory for finite lattices.
Discrete Mathematics, 1981


  Loading...