default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRajko Nenadov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j25]Rajko Nenadov
:
Routing Permutations on Spectral Expanders via Matchings. Comb. 43(4): 737-742 (2023)- [j24]David Conlon, Rajko Nenadov, Milos Trujic:
On the size-Ramsey number of grids. Comb. Probab. Comput. 32(6): 874-880 (2023) - 2022
- [j23]Anita Liebenau, Rajko Nenadov:
The threshold bias of the clique-factor game. J. Comb. Theory B 152: 221-247 (2022) - 2021
- [j22]Nemanja Draganic, Michael Krivelevich, Rajko Nenadov:
The size-Ramsey number of short subdivisions. Random Struct. Algorithms 59(1): 68-78 (2021) - [j21]Rajko Nenadov, Milos Trujic:
Sprinkling a Few Random Edges Doubles the Power. SIAM J. Discret. Math. 35(2): 988-1004 (2021) - 2020
- [j20]Rajko Nenadov, Mehtab Sawhney, Benny Sudakov, Adam Zsolt Wagner:
Bounded Degree Spanners of the Hypercube. Electron. J. Comb. 27(3): 3 (2020) - [j19]Rajko Nenadov, Nemanja Skoric:
On Komlós' tiling theorem in random graphs. Comb. Probab. Comput. 29(1): 113-127 (2020) - [j18]Frank Mousset, Rajko Nenadov, Wojciech Samotij:
Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties. Comb. Probab. Comput. 29(6): 943-955 (2020) - [j17]Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner:
Completion and deficiency problems. J. Comb. Theory B 145: 214-240 (2020) - [j16]Rajko Nenadov, Yanitsa Pehova:
On a Ramsey-Turán Variant of the Hajnal-Szemerédi Theorem. SIAM J. Discret. Math. 34(2): 1001-1010 (2020) - 2019
- [j15]Rajko Nenadov, Nemanja Skoric:
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 54(1): 187-208 (2019) - [j14]Rajko Nenadov, Angelika Steger, Milos Trujic:
Resilience of perfect matchings and Hamiltonicity in random graph processes. Random Struct. Algorithms 54(4): 797-819 (2019) - 2018
- [j13]Rajko Nenadov:
Star-factors in graphs with large minimum degree. J. Comb. Theory B 133: 78-87 (2018) - [j12]Asaf Ferber, Rajko Nenadov:
Spanning universality in random graphs. Random Struct. Algorithms 53(4): 604-637 (2018) - [j11]Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov:
Monochromatic cycle covers in random graphs. Random Struct. Algorithms 53(4): 667-691 (2018) - 2017
- [j10]Rajko Nenadov, Pascal Pfister, Angelika Steger:
Unique reconstruction threshold for random jigsaw puzzles. Chic. J. Theor. Comput. Sci. 2017 (2017) - [j9]Rajko Nenadov, Yury Person, Nemanja Skoric, Angelika Steger:
An algorithmic framework for obtaining lower bounds for random Ramsey problems. J. Comb. Theory B 124: 1-38 (2017) - [j8]Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric:
Robust Hamiltonicity of random directed graphs. J. Comb. Theory B 126: 1-23 (2017) - [j7]David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric:
Almost-spanning universality in random graphs. Random Struct. Algorithms 50(3): 380-393 (2017) - 2016
- [j6]Rajko Nenadov, Angelika Steger:
A Short Proof of the Random Ramsey Theorem. Comb. Probab. Comput. 25(1): 130-144 (2016) - [j5]Asaf Ferber, Rajko Nenadov, Ueli Peter:
Universality of random graphs and rainbow embedding. Random Struct. Algorithms 48(3): 546-564 (2016) - [j4]Rajko Nenadov, Angelika Steger, Milos Stojakovic:
On the threshold for the Maker-Breaker H-game. Random Struct. Algorithms 49(3): 558-578 (2016) - 2015
- [j3]David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric:
Almost-spanning universality in random graphs (Extended abstract). Electron. Notes Discret. Math. 49: 203-211 (2015) - 2014
- [j2]Frank Mousset, Rajko Nenadov, Angelika Steger:
On the Number of Graphs Without Large Cliques. SIAM J. Discret. Math. 28(4): 1980-1986 (2014) - 2011
- [j1]Dragan Masulovic, Rajko Nenadov, Nemanja Skoric:
On finite reflexive homomorphism-homogeneous binary relational systems. Discret. Math. 311(21): 2543-2555 (2011)
Conference and Workshop Papers
- 2024
- [c6]Nemanja Draganic, Rajko Nenadov:
Edge-disjoint paths in expanders: online with removals. SODA 2024: 4554-4563 - 2021
- [c5]Rajko Nenadov, Angelika Steger, Pascal Su:
An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability. ITCS 2021: 60:1-60:17 - [c4]Nemanja Draganic, Michael Krivelevich, Rajko Nenadov:
Rolling backwards can move you forward: on embedding problems in sparse expanders. SODA 2021: 123-134 - 2017
- [c3]Noga Alon, Rajko Nenadov:
Optimal induced universal graphs for bounded-degree graphs. SODA 2017: 1149-1157 - 2015
- [c2]Rajko Nenadov, Nemanja Skoric, Angelika Steger:
An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract. SODA 2015: 1743-1751 - [c1]Asaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Skoric:
Robust hamiltonicity of random directed graphs extended abstract. SODA 2015: 1752-1758
Informal and Other Publications
- 2023
- [i4]Nemanja Draganic, Rajko Nenadov:
Edge-disjoint paths in expanders: online with removals. CoRR abs/2310.13082 (2023) - 2022
- [i3]Rajko Nenadov:
Routing permutations on spectral expanders via matchings. CoRR abs/2209.03838 (2022) - 2020
- [i2]Rajko Nenadov, Angelika Steger, Pascal Su:
An O(n) time algorithm for finding Hamilton cycles with high probability. CoRR abs/2012.02551 (2020) - 2016
- [i1]Rajko Nenadov, Pascal Pfister, Angelika Steger:
Unique reconstruction threshold for random jigsaw puzzles. CoRR abs/1605.03043 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
