default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNemanja Skoric
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Manuela Fischer, Nemanja Skoric, Angelika Steger, Milos Trujic
:
Triangle resilience of the square of a Hamilton cycle in random graphs. J. Comb. Theory B 152: 171-220 (2022)- [j13]Frank Mousset, Nemanja Skoric, Milos Trujic:
Covering cycles in sparse graphs. Random Struct. Algorithms 60(4): 716-748 (2022) - 2020
- [j12]Rajko Nenadov, Nemanja Skoric:
On Komlós' tiling theorem in random graphs. Comb. Probab. Comput. 29(1): 113-127 (2020) - [j11]Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A general lower bound for collaborative tree exploration. Theor. Comput. Sci. 811: 70-78 (2020)
2010 – 2019
- 2019
- [j10]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) - 2018
- [j9]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) - [j8]Nemanja Skoric, Angelika Steger, Milos Trujic:
Local resilience of an almost spanning k-cycle in random graphs. Random Struct. Algorithms 53(4): 728-751 (2018) - 2017
- [j7]Frank Mousset, Andreas Noever, Nemanja Skoric:
Smaller Subgraphs of Minimum Degree $k$. Electron. J. Comb. 24(4): 4 (2017) - [j6]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) - [j5]Frank Mousset, Andreas Noever, Nemanja Skoric, Felix Weissenberger:
A tight Erdős-Pósa function for long cycles. J. Comb. Theory B 125: 21-32 (2017) - [j4]Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric:
Robust Hamiltonicity of random directed graphs. J. Comb. Theory B 126: 1-23 (2017) - [j3]David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric:
Almost-spanning universality in random graphs. Random Struct. Algorithms 50(3): 380-393 (2017) - [c3]Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A General Lower Bound for Collaborative Tree Exploration. SIROCCO 2017: 125-139 - 2016
- [i1]Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A general lower bound for collaborative tree exploration. CoRR abs/1610.01753 (2016) - 2015
- [j2]David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric:
Almost-spanning universality in random graphs (Extended abstract). Electron. Notes Discret. Math. 49: 203-211 (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 - 2011
- [j1]Dragan Masulovic, Rajko Nenadov, Nemanja Skoric:
On finite reflexive homomorphism-homogeneous binary relational systems. Discret. Math. 311(21): 2543-2555 (2011)
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 21:24 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:
