On finite reflexive homomorphism-homogeneous binary relational systems. - Dragan Masulovic; Rajko Nenadov; Nemanja Skoric (Discret. Math., 2011)

On the Number of Graphs Without Large Cliques. - Frank Mousset; Rajko Nenadov; Angelika Steger (SIAM J. Discret. Math., 2014)

Robust hamiltonicity of random directed graphs extended abstract. - Asaf Ferber; Rajko Nenadov; Ueli Peter; Andreas Noever; Nemanja Skoric (SODA, 2015)

An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract. - Rajko Nenadov; Nemanja Skoric; Angelika Steger (SODA, 2015)

Almost-spanning universality in random graphs (Extended abstract). - David Conlon; Asaf Ferber; Rajko Nenadov; Nemanja Skoric (Electron. Notes Discret. Math., 2015)

A Short Proof of the Random Ramsey Theorem. - Rajko Nenadov; Angelika Steger (Comb. Probab. Comput., 2016)

Universality of random graphs and rainbow embedding. - Asaf Ferber; Rajko Nenadov; Ueli Peter (Random Struct. Algorithms, 2016)

On the threshold for the Maker-Breaker H-game. - Rajko Nenadov; Angelika Steger; Milos Stojakovic (Random Struct. Algorithms, 2016)

Optimal induced universal graphs for bounded-degree graphs. - Noga Alon; Rajko Nenadov (SODA, 2017)

Unique reconstruction threshold for random jigsaw puzzles. - Rajko Nenadov; Pascal Pfister; Angelika Steger (Chic. J. Theor. Comput. Sci., 2017)

Robust Hamiltonicity of random directed graphs. - Asaf Ferber; Rajko Nenadov; Andreas Noever; Ueli Peter; Nemanja Skoric (J. Comb. Theory B, 2017)

An algorithmic framework for obtaining lower bounds for random Ramsey problems. - Rajko Nenadov; Yury Person; Nemanja Skoric; Angelika Steger (J. Comb. Theory B, 2017)

Almost-spanning universality in random graphs. - David Conlon; Asaf Ferber; Rajko Nenadov; Nemanja Skoric (Random Struct. Algorithms, 2017)

Star-factors in graphs with large minimum degree. - Rajko Nenadov (J. Comb. Theory B, 2018)

Spanning universality in random graphs. - Asaf Ferber; Rajko Nenadov (Random Struct. Algorithms, 2018)

Monochromatic cycle covers in random graphs. - Dániel Korándi; Frank Mousset; Rajko Nenadov; Nemanja Skoric; Benny Sudakov (Random Struct. Algorithms, 2018)

Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs. - Rajko Nenadov; Nemanja Skoric (Random Struct. Algorithms, 2019)

Resilience of perfect matchings and Hamiltonicity in random graph processes. - Rajko Nenadov; Angelika Steger; Milos Trujic (Random Struct. Algorithms, 2019)

Bounded Degree Spanners of the Hypercube. - Rajko Nenadov; Mehtab Sawhney; Benny Sudakov; Adam Zsolt Wagner (Electron. J. Comb., 2020)

Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties. - Frank Mousset; Rajko Nenadov; Wojciech Samotij (Comb. Probab. Comput., 2020)

On Komlós' tiling theorem in random graphs. - Rajko Nenadov; Nemanja Skoric (Comb. Probab. Comput., 2020)

Completion and deficiency problems. - Rajko Nenadov; Benny Sudakov; Adam Zsolt Wagner (J. Comb. Theory B, 2020)

On a Ramsey-Turán Variant of the Hajnal-Szemerédi Theorem. - Rajko Nenadov; Yanitsa Pehova (SIAM J. Discret. Math., 2020)

An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability. - Rajko Nenadov; Angelika Steger; Pascal Su (ITCS, 2021)

Rolling backwards can move you forward: on embedding problems in sparse expanders. - Nemanja Draganic; Michael Krivelevich; Rajko Nenadov (SODA, 2021)

The size-Ramsey number of short subdivisions. - Nemanja Draganic; Michael Krivelevich; Rajko Nenadov (Random Struct. Algorithms, 2021)

Sprinkling a Few Random Edges Doubles the Power. - Rajko Nenadov; Milos Trujic (SIAM J. Discret. Math., 2021)

The threshold bias of the clique-factor game. - Anita Liebenau; Rajko Nenadov (J. Comb. Theory B, 2022)

Routing Permutations on Spectral Expanders via Matchings. - Rajko Nenadov (Comb., 2023)

On the size-Ramsey number of grids. - David Conlon; Rajko Nenadov; Milos Trujic (Comb. Probab. Comput., 2023)

Edge-disjoint paths in expanders: online with removals. - Nemanja Draganic; Rajko Nenadov (SODA, 2024)

Spread blow-up lemma with an application to perturbed random graphs. - Rajko Nenadov; Huy Tuan Pham (CoRR, 2024)

A short note on the characterization of countable chains with finite big Ramsey spectra. - Keegan Dasilva Barbosa; Dragan Masulovic; Rajko Nenadov (Order, 2024)

Counting sparse induced subgraphs in locally dense graphs. - Rajko Nenadov (Eur. J. Comb., 2025)

Refuting Perfect Matchings in Spectral Expanders is Hard. - Ari Biswas; Rajko Nenadov (CoRR, 2025)