Nemanja Skoric

Publication Activity (10 Years)

Years Active: 2011-2022
Publications (10 Years): 17

Top Topics

Learning Curves

Cellular Automata

Undirected Graph

Top Venues

Random Struct. Algorithms

J. Comb. Theory, Ser. B

Comb. Probab. Comput.

Publications

Frank Mousset, Nemanja Skoric, Milos Trujic
Covering cycles in sparse graphs. Random Struct. Algorithms 60 (4) (2022)
Manuela Fischer, Nemanja Skoric, Angelika Steger, Milos Trujic
Triangle resilience of the square of a Hamilton cycle in random graphs. J. Comb. Theory, Ser. B 152 (2022)
Rajko Nenadov, Nemanja Skoric
On Komlós' tiling theorem in random graphs. Comb. Probab. Comput. 29 (1) (2020)
Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
A general lower bound for collaborative tree exploration. Theor. Comput. Sci. 811 (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)
Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov
Monochromatic cycle covers in random graphs. Random Struct. Algorithms 53 (4) (2018)
Nemanja Skoric, Angelika Steger, Milos Trujic
Local resilience of an almost spanning k-cycle in random graphs. Random Struct. Algorithms 53 (4) (2018)
David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric
Almost-spanning universality in random graphs. Random Struct. Algorithms 50 (3) (2017)
Frank Mousset, Andreas Noever, Nemanja Skoric, Felix Weissenberger
A tight Erdős-Pósa function for long cycles. J. Comb. Theory, Ser. B 125 (2017)
Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
A General Lower Bound for Collaborative Tree Exploration. SIROCCO (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)
Frank Mousset, Andreas Noever, Nemanja Skoric
Smaller Subgraphs of Minimum Degree $k$. Electron. J. Comb. 24 (4) (2017)
Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric
Robust Hamiltonicity of random directed graphs. J. Comb. Theory, Ser. B 126 (2017)
Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
A general lower bound for collaborative tree exploration. CoRR (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)
Dragan Masulovic, Rajko Nenadov, Nemanja Skoric
On finite reflexive homomorphism-homogeneous binary relational systems. Discret. Math. 311 (21) (2011)