default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNemanja Draganic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j14]Nemanja Draganic, Peter Keevash:
Long induced paths in expanders. Comb. Probab. Comput. 34(2): 276-282 (2025)- 2024
- [j13]Domagoj Bradac
, Nemanja Draganic, Benny Sudakov:
Effective Bounds for Induced Size-Ramsey Numbers of Cycles. Comb. 44(5): 1011-1039 (2024) - [j12]Nemanja Draganic, David Munhá Correia, Benny Sudakov:
A generalization of Bondy's pancyclicity theorem. Comb. Probab. Comput. 33(5): 554-563 (2024) - [j11]Shagnik Das, Nemanja Draganic, Raphael Steiner:
Tight bounds for divisible subdivisions. J. Comb. Theory B 165: 1-19 (2024) - [c2]Nemanja Draganic, Rajko Nenadov:
Edge-disjoint paths in expanders: online with removals. SODA 2024: 4554-4563 - 2023
- [j10]Nemanja Draganic, David Munhá Correia, Benny Sudakov:
Tight bounds for powers of Hamilton cycles in tournaments. J. Comb. Theory B 158(Part): 305-340 (2023) - [i1]Nemanja Draganic, Rajko Nenadov:
Edge-disjoint paths in expanders: online with removals. CoRR abs/2310.13082 (2023) - 2022
- [j9]Nemanja Draganic, Stefan Glock, Michael Krivelevich:
Short proofs for long induced paths. Comb. Probab. Comput. 31(5): 870-878 (2022) - [j8]Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster:
Ramsey number of 1-subdivisions of transitive tournaments. J. Comb. Theory B 157: 176-183 (2022) - [j7]Nemanja Draganic, Stefan Glock, Michael Krivelevich:
The largest hole in sparse random graphs. Random Struct. Algorithms 61(4): 666-677 (2022) - 2021
- [j6]Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov:
Powers of paths in tournaments. Comb. Probab. Comput. 30(6): 894-898 (2021) - [j5]Matija Bucic, Nemanja Draganic, Benny Sudakov:
Universal and unavoidable graphs. Comb. Probab. Comput. 30(6): 942-955 (2021) - [j4]Matija Bucic, Nemanja Draganic, Benny Sudakov, Tuan Tran:
Unavoidable hypergraphs. J. Comb. Theory B 151: 307-338 (2021) - [j3]Nemanja Draganic, Michael Krivelevich, Rajko Nenadov:
The size-Ramsey number of short subdivisions. Random Struct. Algorithms 59(1): 68-78 (2021) - [j2]Oliver Cooley, Nemanja Draganic, Mihyun Kang, Benny Sudakov:
Large Induced Matchings in Random Graphs. SIAM J. Discret. Math. 35(1): 267-280 (2021) - [c1]Nemanja Draganic, Michael Krivelevich, Rajko Nenadov:
Rolling backwards can move you forward: on embedding problems in sparse expanders. SODA 2021: 123-134
2010 – 2019
- 2019
- [j1]Nemanja Draganic, Dragan Masulovic:
A Ramsey theorem for multiposets. Eur. J. Comb. 81: 142-149 (2019)
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 2025-04-03 00:19 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:
