Rajko Nenadov

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

2023

On the size-Ramsey number of grids.

[BibT_eX]

[DOI]

David Conlon

Milos Trujic

Comb. Probab. Comput., November, 2023

Routing Permutations on Spectral Expanders via Matchings.

[BibT_eX]

[DOI]

Comb., August, 2023

2022

The threshold bias of the clique-factor game.

[BibT_eX]

[DOI]

Anita Liebenau

J. Comb. Theory, Ser. B, 2022

2021

Sprinkling a Few Random Edges Doubles the Power.

[BibT_eX]

[DOI]

Milos Trujic

SIAM J. Discret. Math., 2021

The size-Ramsey number of short subdivisions.

[BibT_eX]

[DOI]

Nemanja Draganic

Michael Krivelevich

Random Struct. Algorithms, 2021

Rolling backwards can move you forward: on embedding problems in sparse expanders.

[BibT_eX]

[DOI]

Nemanja Draganic

Michael Krivelevich

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

An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability.

[BibT_eX]

[DOI]

Pascal Su

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

On a Ramsey-Turán Variant of the Hajnal-Szemerédi Theorem.

[BibT_eX]

[DOI]

Yanitsa Pehova

SIAM J. Discret. Math., 2020

Completion and deficiency problems.

[BibT_eX]

[DOI]

Benny Sudakov

Adam Zsolt Wagner

J. Comb. Theory, Ser. B, 2020

On Komlós' tiling theorem in random graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties.

[BibT_eX]

[DOI]

Frank Mousset

Wojciech Samotij

Comb. Probab. Comput., 2020

Bounded Degree Spanners of the Hypercube.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

Resilience of perfect matchings and Hamiltonicity in random graph processes.

[BibT_eX]

[DOI]

Milos Trujic

Random Struct. Algorithms, 2019

Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

2018

Monochromatic cycle covers in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

Spanning universality in random graphs.

[BibT_eX]

[DOI]

Asaf Ferber

Random Struct. Algorithms, 2018

Star-factors in graphs with large minimum degree.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2018

2017

Almost-spanning universality in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

An algorithmic framework for obtaining lower bounds for random Ramsey problems.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2017

Robust Hamiltonicity of random directed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2017

Unique reconstruction threshold for random jigsaw puzzles.

[BibT_eX]

[DOI]

Pascal Pfister

Chic. J. Theor. Comput. Sci., 2017

Optimal induced universal graphs for bounded-degree graphs.

[BibT_eX]

[DOI]

Noga Alon

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

On the threshold for the Maker-Breaker H-game.

[BibT_eX]

[DOI]

Milos Stojakovic

Random Struct. Algorithms, 2016

Universality of random graphs and rainbow embedding.

[BibT_eX]

[DOI]

Asaf Ferber

Ueli Peter

Random Struct. Algorithms, 2016

A Short Proof of the Random Ramsey Theorem.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

2015

Almost-spanning universality in random graphs (Extended abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Robust hamiltonicity of random directed graphs extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

On the Number of Graphs Without Large Cliques.

[BibT_eX]

[DOI]

Frank Mousset

SIAM J. Discret. Math., 2014

2011

On finite reflexive homomorphism-homogeneous binary relational systems.

[BibT_eX]

[DOI]

Dragan Masulovic