Rajko Nenadov

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 30

Top Topics

Grow Exponentially

Top Venues

Random Struct. Algorithms

J. Comb. Theory, Ser. B

Comb. Probab. Comput.

Publications

Nemanja Draganic, Rajko Nenadov
Edge-disjoint paths in expanders: online with removals. SODA (2024)
David Conlon, Rajko Nenadov, Milos Trujic
On the size-Ramsey number of grids. Comb. Probab. Comput. 32 (6) (2023)
Nemanja Draganic, Rajko Nenadov
Edge-disjoint paths in expanders: online with removals. CoRR (2023)
Rajko Nenadov
Routing Permutations on Spectral Expanders via Matchings. Comb. 43 (4) (2023)
Anita Liebenau, Rajko Nenadov
The threshold bias of the clique-factor game. J. Comb. Theory, Ser. B 152 (2022)
Rajko Nenadov
Routing permutations on spectral expanders via matchings. CoRR (2022)
Nemanja Draganic, Michael Krivelevich, Rajko Nenadov
The size-Ramsey number of short subdivisions. Random Struct. Algorithms 59 (1) (2021)
Rajko Nenadov, Milos Trujic
Sprinkling a Few Random Edges Doubles the Power. SIAM J. Discret. Math. 35 (2) (2021)
Rajko Nenadov, Angelika Steger, Pascal Su
An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability. ITCS (2021)
Nemanja Draganic, Michael Krivelevich, Rajko Nenadov
Rolling backwards can move you forward: on embedding problems in sparse expanders. SODA (2021)
Rajko Nenadov, Angelika Steger, Pascal Su
An O(n) time algorithm for finding Hamilton cycles with high probability. CoRR (2020)
Rajko Nenadov, Yanitsa Pehova
On a Ramsey-Turán Variant of the Hajnal-Szemerédi Theorem. SIAM J. Discret. Math. 34 (2) (2020)
Rajko Nenadov, Mehtab Sawhney, Benny Sudakov, Adam Zsolt Wagner
Bounded Degree Spanners of the Hypercube. Electron. J. Comb. 27 (3) (2020)
Rajko Nenadov, Nemanja Skoric
On Komlós' tiling theorem in random graphs. Comb. Probab. Comput. 29 (1) (2020)
Frank Mousset, Rajko Nenadov, Wojciech Samotij
Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties. Comb. Probab. Comput. 29 (6) (2020)
Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner
Completion and deficiency problems. J. Comb. Theory, Ser. B 145 (2020)
Rajko Nenadov, Nemanja Skoric
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 54 (1) (2019)
Rajko Nenadov, Angelika Steger, Milos Trujic
Resilience of perfect matchings and Hamiltonicity in random graph processes. Random Struct. Algorithms 54 (4) (2019)
Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov
Monochromatic cycle covers in random graphs. Random Struct. Algorithms 53 (4) (2018)
Asaf Ferber, Rajko Nenadov
Spanning universality in random graphs. Random Struct. Algorithms 53 (4) (2018)
Rajko Nenadov
Star-factors in graphs with large minimum degree. J. Comb. Theory, Ser. B 133 (2018)
David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric
Almost-spanning universality in random graphs. Random Struct. Algorithms 50 (3) (2017)
Rajko Nenadov, Yury Person, Nemanja Skoric, Angelika Steger
An algorithmic framework for obtaining lower bounds for random Ramsey problems. J. Comb. Theory, Ser. B 124 (2017)
Noga Alon, Rajko Nenadov
Optimal induced universal graphs for bounded-degree graphs. SODA (2017)
Rajko Nenadov, Pascal Pfister, Angelika Steger
Unique reconstruction threshold for random jigsaw puzzles. Chic. J. Theor. Comput. Sci. 2017 (2017)
Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric
Robust Hamiltonicity of random directed graphs. J. Comb. Theory, Ser. B 126 (2017)
Rajko Nenadov, Angelika Steger, Milos Stojakovic
-game. Random Struct. Algorithms 49 (3) (2016)
Rajko Nenadov, Angelika Steger
A Short Proof of the Random Ramsey Theorem. Comb. Probab. Comput. 25 (1) (2016)
Rajko Nenadov, Pascal Pfister, Angelika Steger
Unique reconstruction threshold for random jigsaw puzzles. CoRR (2016)
Asaf Ferber, Rajko Nenadov, Ueli Peter
Universality of random graphs and rainbow embedding. Random Struct. Algorithms 48 (3) (2016)
Rajko Nenadov, Nemanja Skoric, Angelika Steger
. SODA (2015)
Asaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Skoric
. SODA (2015)
David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric
Almost-spanning universality in random graphs (Extended abstract). Electron. Notes Discret. Math. 49 (2015)
Frank Mousset, Rajko Nenadov, Angelika Steger
On the Number of Graphs Without Large Cliques. SIAM J. Discret. Math. 28 (4) (2014)
Dragan Masulovic, Rajko Nenadov, Nemanja Skoric
On finite reflexive homomorphism-homogeneous binary relational systems. Discret. Math. 311 (21) (2011)