Anusch Taraz

J. Graph Theory, 2018

Logical limit laws for minor-closed classes of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

2017

Counting results for sparse pseudorandom hypergraphs II.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Counting results for sparse pseudorandom hypergraphs I.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Spanning embeddings of arrangeable graphs with sublinear bandwidth.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

2015

An Extension of the Blow-up Lemma to Arrangeable Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

A counting lemma for sparse pseudorandom hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Approximating Minimum k-Section in Trees with Linear Diameter.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Local resilience of spanning subgraphs in sparse random graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Ramsey numbers for bipartite graphs with small bandwidth.

[BibT_eX]

[DOI]

Gábor N. Sárközy

Eur. J. Comb., 2015

2014

Coloring d-Embeddable k-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Carl Georg Heise

Konstantinos Panagiotou

Oleg Pikhurko

Discret. Comput. Geom., 2014

An Approximate Version of the Tree Packing Conjecture via Random Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2014

2012

Perfect Graphs of Fixed Density: Counting and Homogeneous Sets.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

Diskrete Mathematik - Grundlagen und Methoden.

[BibT_eX]

[DOI]

Mathematik Kompakt, Birkhäuser, ISBN: 978-3-7643-8898-0, 2012

2011

Induced C5-free graphs of fixed density: counting and homogeneous sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Embedding into Bipartite Graphs.

[BibT_eX]

[DOI]

Peter Heinig

SIAM J. Discret. Math., 2010

Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.

[BibT_eX]

[DOI]

Klaas Paul Pruessmann

Eur. J. Comb., 2010

2009

Coloring Random Intersection Graphs and Complex Networks.

[BibT_eX]

[DOI]

Michael Behrisch

Michael Ueckerdt

SIAM J. Discret. Math., 2009

Almost spanning subgraphs of random graphs after adversarial edge removal.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2008

The random planar graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

Spanning 3-colourable subgraphs of small bandwidth in dense graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Bandwidth, treewidth, separators, expansion, and universality.

[BibT_eX]

[DOI]

Klaas Paul Pruessmann

Electron. Notes Discret. Math., 2008

2007

Embedding spanning subgraphs of small bandwidth.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

K 4-free subgraphs of random graphs revisited.

[BibT_eX]

[DOI]

Comb., 2007

On the bandwidth conjecture for 3-colourable graphs.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Efficiently covering complex networks with cliques of similar vertices.

[BibT_eX]

[DOI]

Michael Behrisch

Theor. Comput. Sci., 2006

2005

Large planar subgraphs in dense graphs.

[BibT_eX]

[DOI]

Daniela Kühn

J. Comb. Theory B, 2005

Globally bounded local edge colourings of hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Degree Sequences of F-Free Graphs.

[BibT_eX]

[DOI]

Oleg Pikhurko

Electron. J. Comb., 2005

2004

Exact and approximative algorithms for coloring G(n, p).

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Random Struct. Algorithms, 2004

2003

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

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

[BibT_eX]

[DOI]

Comb., 2003

Colouring Random Graphs in Expected Polynomial Time.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2001

Random maximal H-free graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

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

[BibT_eX]

[DOI]

J. Graph Theory, 2001

Phase Transitions in the Evolution of Partial Orders.

[BibT_eX]

[DOI]

Angelika Steger

J. Comb. Theory A, 2001

Asymptotic enumeration, global structure, and constrained evolution.

[BibT_eX]

[DOI]

Angelika Steger

Discret. Math., 2001

Counting Partial Orders With A Fixed Number Of Comparable Pairs.

[BibT_eX]

[DOI]

Angelika Steger

Comb. Probab. Comput., 2001

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

[BibT_eX]

[DOI]

Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

1999

Phase transitions in the evolution of partially ordered sets

[BibT_eX]

[DOI]

PhD thesis, 1999

Hypergraph Packing And Graph Embedding.

[BibT_eX]

[DOI]

Vojtech Rödl

Andrzej Rucinski