On finite reflexive homomorphism-homogeneous binary relational systems. - Dragan Masulovic; Rajko Nenadov; Nemanja Skoric (Discret. Math., 2011)

Robust hamiltonicity of random directed graphs extended abstract. - Asaf Ferber; Rajko Nenadov; Ueli Peter; Andreas Noever; Nemanja Skoric (SODA, 2015)

An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract. - Rajko Nenadov; Nemanja Skoric; Angelika Steger (SODA, 2015)

Almost-spanning universality in random graphs (Extended abstract). - David Conlon; Asaf Ferber; Rajko Nenadov; Nemanja Skoric (Electron. Notes Discret. Math., 2015)

Smaller Subgraphs of Minimum Degree $k$. - Frank Mousset; Andreas Noever; Nemanja Skoric (Electron. J. Comb., 2017)

Robust Hamiltonicity of random directed graphs. - Asaf Ferber; Rajko Nenadov; Andreas Noever; Ueli Peter; Nemanja Skoric (J. Comb. Theory B, 2017)

A tight Erdős-Pósa function for long cycles. - Frank Mousset; Andreas Noever; Nemanja Skoric; Felix Weissenberger (J. Comb. Theory B, 2017)

An algorithmic framework for obtaining lower bounds for random Ramsey problems. - Rajko Nenadov; Yury Person; Nemanja Skoric; Angelika Steger (J. Comb. Theory B, 2017)

Almost-spanning universality in random graphs. - David Conlon; Asaf Ferber; Rajko Nenadov; Nemanja Skoric (Random Struct. Algorithms, 2017)

Monochromatic cycle covers in random graphs. - Dániel Korándi; Frank Mousset; Rajko Nenadov; Nemanja Skoric; Benny Sudakov (Random Struct. Algorithms, 2018)

Local resilience of an almost spanning k-cycle in random graphs. - Nemanja Skoric; Angelika Steger; Milos Trujic (Random Struct. Algorithms, 2018)

Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs. - Rajko Nenadov; Nemanja Skoric (Random Struct. Algorithms, 2019)

On Komlós' tiling theorem in random graphs. - Rajko Nenadov; Nemanja Skoric (Comb. Probab. Comput., 2020)

A general lower bound for collaborative tree exploration. - Yann Disser; Frank Mousset; Andreas Noever; Nemanja Skoric; Angelika Steger (Theor. Comput. Sci., 2020)

Triangle resilience of the square of a Hamilton cycle in random graphs. - Manuela Fischer; Nemanja Skoric; Angelika Steger; Milos Trujic (J. Comb. Theory B, 2022)

Covering cycles in sparse graphs. - Frank Mousset; Nemanja Skoric; Milos Trujic (Random Struct. Algorithms, 2022)