Rajko Nenadov

45 papers A* 5A 1Journal 39
YearRankTypeTitle / Venue / Authors
2026 J jnl
Edge-Disjoint Paths in Expanders: Online with Removals.
SIAM J. Comput.
Nemanja Draganic, Rajko Nenadov
2026 J jnl
The Hamilton space of pseudorandom graphs.
J. Comb. Theory B
Micha Christoph, Rajko Nenadov, Kalina Petrova
2026 J jnl
Universality for graphs with bounded density.
J. Comb. Theory B
Noga Alon, Natalie Dodson, Carmen Jackson, Rose McCarty, Rajko Nenadov, Lani Southern
2025 J jnl
Counting sparse induced subgraphs in locally dense graphs.
Eur. J. Comb.
Rajko Nenadov
2025 J jnl
Refuting Perfect Matchings in Spectral Expanders is Hard.
CoRR
Ari Biswas, Rajko Nenadov
2025 J jnl
Refuting Perfect Matchings in Spectral Expanders is Hard.
Electron. Colloquium Comput. Complex.
Ari Biswas, Rajko Nenadov
2025 J jnl
Short proof of the hypergraph container theorem.
Comb. Probab. Comput.
Rajko Nenadov, Huy Tuan Pham
2025 J jnl
The Largest Subgraph Without A Forbidden Induced Subgraph.
Comb.
Jacob Fox, Rajko Nenadov, Huy Tuan Pham
2024 J jnl
A short note on the characterization of countable chains with finite big Ramsey spectra.
Order
Keegan Dasilva Barbosa, Dragan Masulovic, Rajko Nenadov
2024 A* conf
Edge-disjoint paths in expanders: online with removals.
SODA
Nemanja Draganic, Rajko Nenadov
2024 J jnl
Spread blow-up lemma with an application to perturbed random graphs.
CoRR
Rajko Nenadov, Huy Tuan Pham
2023 J jnl
Edge-disjoint paths in expanders: online with removals.
CoRR
Nemanja Draganic, Rajko Nenadov
2023 J jnl
On the size-Ramsey number of grids.
Comb. Probab. Comput.
David Conlon, Rajko Nenadov, Milos Trujic
2023 J jnl
Routing Permutations on Spectral Expanders via Matchings.
Comb.
Rajko Nenadov
2022 J jnl
Routing permutations on spectral expanders via matchings.
CoRR
Rajko Nenadov
2022 J jnl
The threshold bias of the clique-factor game.
J. Comb. Theory B
Anita Liebenau, Rajko Nenadov
2021 A conf
An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability.
ITCS
Rajko Nenadov, Angelika Steger, Pascal Su
2021 A* conf
Rolling backwards can move you forward: on embedding problems in sparse expanders.
SODA
Nemanja Draganic, Michael Krivelevich, Rajko Nenadov
2021 J jnl
Sprinkling a Few Random Edges Doubles the Power.
SIAM J. Discret. Math.
Rajko Nenadov, Milos Trujic
2021 J jnl
The size-Ramsey number of short subdivisions.
Random Struct. Algorithms
Nemanja Draganic, Michael Krivelevich, Rajko Nenadov
2020 J jnl
An O(n) time algorithm for finding Hamilton cycles with high probability.
CoRR
Rajko Nenadov, Angelika Steger, Pascal Su
2020 J jnl
Bounded Degree Spanners of the Hypercube.
Electron. J. Comb.
Rajko Nenadov, Mehtab Sawhney, Benny Sudakov, Adam Zsolt Wagner
2020 J jnl
Completion and deficiency problems.
J. Comb. Theory B
Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner
2020 J jnl
On Komlós' tiling theorem in random graphs.
Comb. Probab. Comput.
Rajko Nenadov, Nemanja Skoric
2020 J jnl
On a Ramsey-Turán Variant of the Hajnal-Szemerédi Theorem.
SIAM J. Discret. Math.
Rajko Nenadov, Yanitsa Pehova
2020 J jnl
Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties.
Comb. Probab. Comput.
Frank Mousset, Rajko Nenadov, Wojciech Samotij
2019 J jnl
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs.
Random Struct. Algorithms
Rajko Nenadov, Nemanja Skoric
2019 J jnl
Resilience of perfect matchings and Hamiltonicity in random graph processes.
Random Struct. Algorithms
Rajko Nenadov, Angelika Steger, Milos Trujic
2018 J jnl
Monochromatic cycle covers in random graphs.
Random Struct. Algorithms
Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov
2018 J jnl
Spanning universality in random graphs.
Random Struct. Algorithms
Asaf Ferber, Rajko Nenadov
2018 J jnl
Star-factors in graphs with large minimum degree.
J. Comb. Theory B
Rajko Nenadov
2017 J jnl
Almost-spanning universality in random graphs.
Random Struct. Algorithms
David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric
2017 J jnl
An algorithmic framework for obtaining lower bounds for random Ramsey problems.
J. Comb. Theory B
Rajko Nenadov, Yury Person, Nemanja Skoric, Angelika Steger
2017 A* conf
Optimal induced universal graphs for bounded-degree graphs.
SODA
Noga Alon, Rajko Nenadov
2017 J jnl
Robust Hamiltonicity of random directed graphs.
J. Comb. Theory B
Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric
2017 J jnl
Unique reconstruction threshold for random jigsaw puzzles.
Chic. J. Theor. Comput. Sci.
Rajko Nenadov, Pascal Pfister, Angelika Steger
2016 J jnl
A Short Proof of the Random Ramsey Theorem.
Comb. Probab. Comput.
Rajko Nenadov, Angelika Steger
2016 J jnl
On the threshold for the Maker-Breaker
Random Struct. Algorithms
Rajko Nenadov, Angelika Steger, Milos Stojakovic
2016 J jnl
Unique reconstruction threshold for random jigsaw puzzles.
CoRR
Rajko Nenadov, Pascal Pfister, Angelika Steger
2016 J jnl
Universality of random graphs and rainbow embedding.
Random Struct. Algorithms
Asaf Ferber, Rajko Nenadov, Ueli Peter
2015 J jnl
Almost-spanning universality in random graphs (Extended abstract).
Electron. Notes Discret. Math.
David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric
2015 A* conf
An algorithmic framework for obtaining lower bounds for random Ramsey problems
SODA
Rajko Nenadov, Nemanja Skoric, Angelika Steger
2015 A* conf
Robust hamiltonicity of random directed graphs
SODA
Asaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Skoric
2014 J jnl
On the Number of Graphs Without Large Cliques.
SIAM J. Discret. Math.
Frank Mousset, Rajko Nenadov, Angelika Steger
2011 J jnl
On finite reflexive homomorphism-homogeneous binary relational systems.
Discret. Math.
Dragan Masulovic, Rajko Nenadov, Nemanja Skoric