Mihyun Kang

Jean Bernoulli Ravelomanana

Michael Missethan

Random Struct. Algorithms, 2022

The Sparse Parity Matrix.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Longest Paths in Random Hypergraphs.

[BibT_eX]

[DOI]

Nicolás Sanhueza-Matamala

Julian Zalla

SIAM J. Discret. Math., 2021

Large Induced Matchings in Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Phase transitions from exp⁡(n1/2) to exp⁡(n2/3) in the asymptotics of banded plane partitions.

[BibT_eX]

[DOI]

Wenjie Fang

Hsien-Kuei Hwang

J. Comb. Theory, Ser. A, 2021

Large complete minors in random subgraphs.

[BibT_eX]

[DOI]

Joshua Erde

Michael Krivelevich

Comb. Probab. Comput., 2021

2020

Subcritical Random Hypergraphs, High-Order Components, and Hypertrees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

Tamás Makai

Random Struct. Algorithms, 2020

The genus of the Erdős-Rényi random graph and the fragile genus property.

[BibT_eX]

[DOI]

Chris Dowden

Michael Krivelevich

Random Struct. Algorithms, 2020

Vanishing of cohomology groups of random simplicial complexes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

The Giant Component and 2-Core in Sparse Random Outerplanar Graphs.

[BibT_eX]

[DOI]

Michael Missethan

Proceedings of the 31st International Conference on Probabilistic, 2020

Counting Cubic Maps with Large Genus.

[BibT_eX]

[DOI]

Zhicheng Gao

Proceedings of the 31st International Conference on Probabilistic, 2020

2019

Core forging and local limit theorems for the k-core of random graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2019

The Toucher-Isolator game.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

The Size of the Giant Component in Random Hypergraphs: a Short Proof.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2018

The size of the giant high-order component in random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

Largest Components in Random Hypergraphs.

[BibT_eX]

[DOI]

Yury Person

Comb. Probab. Comput., 2018

Symmetries of Unlabelled Planar Triangulations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Cubic Graphs and Related Triangulations on Orientable Surfaces.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Asymptotic Expansions for Sub-Critical Lagrangean Forms.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

Guan-Huei Duh

Proceedings of the 29th International Conference on Probabilistic, 2018

Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers).

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

The Minimum Bisection in the Planted Bisection Model.

[BibT_eX]

[DOI]

Theory Comput., 2017

Jigsaw percolation on random hypergraphs.

[BibT_eX]

[DOI]

J. Appl. Probab., 2017

Evolution of the giant component in graphs on orientable surfaces.

[BibT_eX]

[DOI]

Michael Moßhammer

Electron. Notes Discret. Math., 2017

Supersaturation Problem for the Bowtie.

[BibT_eX]

[DOI]

Tamás Makai

Oleg Pikhurko

Electron. Notes Discret. Math., 2017

Preface.

[BibT_eX]

[DOI]

Michael Drmota

Christian Krattenthaler

Jaroslav Nesetril

Electron. Notes Discret. Math., 2017

The evolution of random graphs on surfaces.

[BibT_eX]

[DOI]

Chris Dowden

Electron. Notes Discret. Math., 2017

Homological connectedness of random hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Core forging and local limit theorems for the k-core of random graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Charting the Replica Symmetric Phase.

[BibT_eX]

[DOI]

Tobias Kapetanopoulos

Proceedings of the Approximation, 2017

2016

Cubic Bridgeless Graphs and Braces.

[BibT_eX]

[DOI]

Andrea Jiménez

Martin Loebl

Graphs Comb., 2016

Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

The Phase Transition in Multitype Binomial Random Graphs.

[BibT_eX]

[DOI]

Angélica Pachón

SIAM J. Discret. Math., 2015

Characterisation of symmetries of unlabelled triangulations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Enumeration of cubic multigraphs on orientable surfaces.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Bootstrap percolation in random k-uniform hypergraphs.

[BibT_eX]

[DOI]

Tamás Makai

Electron. Notes Discret. Math., 2015

Evolution of high-order connected components in random hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

How does the core sit inside the mantle?

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

'The Asymptotic Number of Connected d-Uniform Hypergraphs' - CORRIGENDUM.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

2014

The Asymptotic Number of Connected d-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2014

Local Limit Theorems for the Giant Component of Random Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2014

2013

The Bohman-Frieze process near criticality.

[BibT_eX]

[DOI]

Will Perkins

Joel Spencer

Random Struct. Algorithms, 2013

On the connectivity of random graphs from addable classes.

[BibT_eX]

[DOI]

Konstantinos Panagiotou

J. Comb. Theory, Ser. B, 2013

2011

Asymptotic Study of Subcritical Graph Classes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Boltzmann Samplers, Pólya Theory, and Cycle Pointing.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Random unlabelled graphs containing few disjoint cycles.

[BibT_eX]

[DOI]

Colin McDiarmid

Random Struct. Algorithms, 2011

Untangling planar graphs from a specified vertex position - Hard cases.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

The order of the giant component of random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

Random preorders and alignments.

[BibT_eX]

[DOI]

Peter J. Cameron

Dudley Stark

Discret. Math., 2010

2009

The evolution of the min-min random graph process.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Generating unlabeled connected cubic planar graphs uniformly at random.

[BibT_eX]

[DOI]

Clemens Gröpl

Random Struct. Algorithms, 2008

The Critical Phase for Random Graphs with a Given Degree Sequence.

[BibT_eX]

[DOI]

Taral Guldahl Seierstad

Comb. Probab. Comput., 2008

Obfuscated Drawings of Planar Graphs

[BibT_eX]

[DOI]

CoRR, 2008

A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

Generating labeled planar graphs uniformly at random.

[BibT_eX]

[DOI]

Clemens Gröpl

Theor. Comput. Sci., 2007

Phase transition of the minimum degree random multigraph process.

[BibT_eX]

[DOI]

Taral Guldahl Seierstad

Random Struct. Algorithms, 2007

Random cubic planar graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

Evolution of random graph processes with degree constraints.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Enumeration and limit laws for series-parallel graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

An unbiased pointing operator for unlabeled structures, with applications to counting and sampling.

[BibT_eX]

[DOI]

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

2006

The connectivity threshold for the min-degree random graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

Generating Outerplanar Graphs Uniformly at Random.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

2005

Sampling Unlabeled Biconnected Planar Graphs.

[BibT_eX]

[DOI]

Clemens Gröpl

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Random walks on a finite graph with congestion points.

[BibT_eX]

[DOI]