Nemanja Skoric

According to our database, Nemanja Skoric authored at least 16 papers between 2011 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Covering cycles in sparse graphs.

Frank Mousset, Nemanja Skoric, Milos Trujic

Random Struct. Algorithms, 2022

Triangle resilience of the square of a Hamilton cycle in random graphs.

Manuela Fischer, Nemanja Skoric, Angelika Steger, Milos Trujic

J. Comb. Theory, Ser. B, 2022

2020

A general lower bound for collaborative tree exploration.

Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger

Theor. Comput. Sci., 2020

On Komlós' tiling theorem in random graphs.

Rajko Nenadov, Nemanja Skoric

Comb. Probab. Comput., 2020

2019

Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs.

Rajko Nenadov, Nemanja Skoric

Random Struct. Algorithms, 2019

2018

Local resilience of an almost spanning k-cycle in random graphs.

Nemanja Skoric, Angelika Steger, Milos Trujic

Random Struct. Algorithms, 2018

Monochromatic cycle covers in random graphs.

Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov

Random Struct. Algorithms, 2018

2017

Almost-spanning universality in random graphs.

David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric

Random Struct. Algorithms, 2017

An algorithmic framework for obtaining lower bounds for random Ramsey problems.

Rajko Nenadov, Yury Person, Nemanja Skoric, Angelika Steger

J. Comb. Theory, Ser. B, 2017

A tight Erdős-Pósa function for long cycles.

Frank Mousset, Andreas Noever, Nemanja Skoric, Felix Weissenberger

J. Comb. Theory, Ser. B, 2017

Robust Hamiltonicity of random directed graphs.

Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric

J. Comb. Theory, Ser. B, 2017

Smaller Subgraphs of Minimum Degree $k$.

Frank Mousset, Andreas Noever, Nemanja Skoric

Electron. J. Comb., 2017

2015

Almost-spanning universality in random graphs (Extended abstract).

David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric

Electron. Notes Discret. Math., 2015

An algorithmic framework for obtaining lower bounds for random Ramsey problems <i>extended abstract</i>.

Rajko Nenadov, Nemanja Skoric, Angelika Steger

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Robust hamiltonicity of random directed graphs <i>extended abstract</i>.

Asaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Skoric

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2011

On finite reflexive homomorphism-homogeneous binary relational systems.

Dragan Masulovic, Rajko Nenadov, Nemanja Skoric

Discret. Math., 2011