Xavier Pérez-Giménez

Douglas B. West

Eur. J. Comb., 2021

2020

On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph.

[BibT_eX]

[DOI]

Alan M. Frieze

Electron. J. Comb., 2020

2019

Perfect matchings and Hamiltonian cycles in the preferential attachment model.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

2018

Arboricity and spanning-tree packing in random graphs.

[BibT_eX]

[DOI]

Pu Gao

Cristiane M. Sato

Random Struct. Algorithms, 2018

Subhypergraphs in non-uniform random hypergraphs.

[BibT_eX]

[DOI]

Internet Math., 2018

Randomly twisted hypercubes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

The robot crawler graph process.

[BibT_eX]

[DOI]

Anthony Bonato

Rita M. del Río-Chanona

Discret. Appl. Math., 2018

2017

Rainbow perfect matchings and Hamilton cycles in the random geometric graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

The Game of Overprescribed Cops and Robbers Played on Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

2016

A probabilistic version of the game of Zombies and Survivors on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

The Bondage Number of Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Subgraphs in Non-uniform Random Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

2015

Randomized Rumour Spreading: The Effect of the Network Topology.

[BibT_eX]

[DOI]

Konstantinos Panagiotou

Thomas Sauerwald

He Sun

Comb. Probab. Comput., 2015

Strong-majority bootstrap percolation on regular graphs with low dissemination threshold.

[BibT_eX]

[DOI]

CoRR, 2015

On-line List Colouring of Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

The Robot Crawler Number of a Graph.

[BibT_eX]

[DOI]

Anthony Bonato

Rita M. del Río-Chanona

Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

The Domination Number of On-line Social Networks and Random Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2015

2014

On the relation between graph distance and Euclidean distance in random geometric graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Arboricity and spanning-tree packing in random graphs with an application to load balancing.

[BibT_eX]

[DOI]

Pu Gao

Cristiane M. Sato

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Asymptotic enumeration of strongly connected digraphs by vertices and edges.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Random Struct. Algorithms, 2013

2011

Disjoint Hamilton cycles in the random geometric graph.

[BibT_eX]

[DOI]

Tobias Müller

Nicholas C. Wormald

J. Graph Theory, 2011

2009

Large Connectivity for Dynamic Random Geometric Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2009

On the satisfiability threshold of formulas with three literals per clause.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On the chromatic number of a random 5-regular graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

2008

Walkers on the Cycle and the Grid.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs

[BibT_eX]

[DOI]

CoRR, 2008

On the connectivity of dynamic random geometric graphs.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

A new upper bound for 3-SAT.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007

Sharp Threshold for Hamiltonicity of Random Geometric Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Dynamic Random Geometric Graphs

[BibT_eX]

[DOI]

CoRR, 2007

2005

Empirical Analysis of the Connectivity Threshold of Mobile Agents on the Grid.

[BibT_eX]

[DOI]