Hans Jürgen Prömel

Comb. Probab. Comput., 2005

Special Issue in Memory of Walter Deuber.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2005

2004

Ordered binary decision diagrams and the Shannon effect.

[BibT_eX]

[DOI]

Clemens Gröpl

Anand Srivastav

Discret. Appl. Math., 2004

2003

On random planar graphs, the number of planar graphs and their triangulations.

[BibT_eX]

[DOI]

Deryk Osthus

J. Comb. Theory B, 2003

Independent Deuber sets in graphs on the natural numbers.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

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

[BibT_eX]

[DOI]

Deryk Osthus

Comb., 2003

2002

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

[BibT_eX]

[DOI]

Synth., 2002

Steiner trees in uniformly quasi-bipartite graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

A note on triangle-free and bipartite graphs.

[BibT_eX]

[DOI]

Thomas Schickinger

Discret. Math., 2002

2001

On the structure of clique-free graphs.

[BibT_eX]

[DOI]

Thomas Schickinger

Random Struct. Algorithms, 2001

Almost all graphs with high girth and suitable density have high chromatic number.

[BibT_eX]

[DOI]

Deryk Osthus

J. Graph Theory, 2001

Phase Transitions in the Evolution of Partial Orders.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2001

Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2001

On the evolution of the worst-case OBDD size.

[BibT_eX]

[DOI]

Clemens Gröpl

Anand Srivastav

Inf. Process. Lett., 2001

Asymptotic enumeration, global structure, and constrained evolution.

[BibT_eX]

[DOI]

Discret. Math., 2001

Counting Partial Orders With A Fixed Number Of Comparable Pairs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders.

[BibT_eX]

[DOI]

Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

2000

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

[BibT_eX]

[DOI]

J. Algorithms, 2000

Obituary Walter Deuber (1942-1999).

[BibT_eX]

[DOI]

Eur. J. Comb., 2000

1999

Non-Ramsey Graphs Are c log n-Universal.

[BibT_eX]

[DOI]

Vojtech Rödl

J. Comb. Theory A, 1999

Forbidden induced partial orders.

[BibT_eX]

[DOI]

Graham R. Brightwell

David A. Grable

Discret. Math., 1999

A 1.598 Approximation Algorithm for the Steiner Problem in Graphs.

[BibT_eX]

[DOI]

Stefan Hougardy

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Induced Ramsey Numbers.

[BibT_eX]

[DOI]

Yoshiharu Kohayakawa

Vojtech Rödl

Comb., 1998

Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract).

[BibT_eX]

[DOI]

Clemens Gröpl

Anand Srivastav

Proceedings of the STACS 98, 1998

1997

RNC-Approximation Algorithms for the Steiner Problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

The Average Number of Linear Extensions of a Partial Order.

[BibT_eX]

[DOI]

Graham R. Brightwell

J. Comb. Theory A, 1996

Counting H-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

Random I-Cororable Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

1994

Probabilistically checkable proofs and their consequences for approximation algorithms.

[BibT_eX]

[DOI]

Stefan Hougardy

Discret. Math., 1994

Preface.

[BibT_eX]

[DOI]

Walter A. Deuber

Discret. Math., 1994

1993

Excluding Induced Subgraphs II: Extremal Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

Extremal Graph Problems for Graphs with a Color-Critical Vertex.

[BibT_eX]

[DOI]

Christoph Hundack

Comb. Probab. Comput., 1993

1992

Coloring Clique-free Graphs in Linear Expected Time.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1992

From wqo to bqo, via Ellentuck's theorem.

[BibT_eX]

[DOI]

Discret. Math., 1992

Almost all Berge Graphs are Perfect.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1992

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

[BibT_eX]

[DOI]

Comb., 1992

1991

Excluding Induced Subgraphs: Quadrilaterals.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1991

Fast growing functions based on Ramsey theorems.

[BibT_eX]

[DOI]

Wolfgang Thumser

Discret. Math., 1991

Graham-Rothschild parameter words and measurable partitions.

[BibT_eX]

[DOI]

Comb., 1991

The asymptotic structure of H-free graphs.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

1990

Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design.

[BibT_eX]

Inform. Forsch. Entwickl., 1990

Finding Clusters in VLSI Circuits.

[BibT_eX]

[DOI]

Jörn Garbers

Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 1990

VLSI: placement based on routing and timing information.

[BibT_eX]

[DOI]

Proceedings of the European Design Automation Conference, 1990

1989

A short proof of the restricted Ramsey theorem for finite set systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1989

Some remarks on natural orders for combinatorial cubes.

[BibT_eX]

[DOI]

Discret. Math., 1989

Combining partitioning and global routing in sea-of-cells design.

[BibT_eX]

[DOI]

Bernhard Korte

Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, 1989

1987

Counting unlabeled structures.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1987

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

[BibT_eX]

[DOI]

B. L. Rothschild

Comb., 1987

1986

A dual form of Erdös-Rado's canonization theorem.

[BibT_eX]

[DOI]

Stephen G. Simpson

J. Comb. Theory A, 1986

An elementary proof of the canonizing version of Gallai-Witt's theorem.

[BibT_eX]

[DOI]

Vojtech Rödl

J. Comb. Theory A, 1986

Partition properties of q-hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

Hereditary attributes of surjections and parameter sets.

[BibT_eX]

[DOI]

Eur. J. Comb., 1986

1985

Canonical Forms of Borel-Measurable Mappings Delta: [omega]omega -> R.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

Induced Partition Properties of Combinatorial Cubes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

Canonizing Ordering Theorems for Hales Jewett Structures.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

Canonizing Ramsey theorems for finite graphs and hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 1985

On the sum of the reciprocals of cycle lengths in sparse graphs.

[BibT_eX]

[DOI]

Comb., 1985

1983

Canonical Partition Theorems for Parameter Sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

A Canonical Partition Theorem for Equivalence Relations on Zt.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

1981

Partition theorems for parameter systems and graphs.

[BibT_eX]

[DOI]

Discret. Math., 1981

Recent results in partition (Ramsey) theory for finite lattices.

[BibT_eX]

[DOI]