Nemanja Draganic

According to our database, Nemanja Draganic authored at least 20 papers between 2019 and 2026.

Collaborative distances:

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

2026

On Independent Spanning Trees in Random Graphs.

Nemanja Draganic, Keith Frankston, Michael Krivelevich, Alexey Pokrovskiy, Liana Yepremyan

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Long induced paths in expanders.

Nemanja Draganic, Peter Keevash

Comb. Probab. Comput., 2025

Disjoint Connected Dominating Sets in Pseudorandom Graphs.

Nemanja Draganic, Michael Krivelevich

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Cycle-factors of regular graphs via entropy.

Micha Christoph, Nemanja Draganic, António Girão, Eoin Hurley, Lukas Michel, Alp Müyesser

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024

Effective Bounds for Induced Size-Ramsey Numbers of Cycles.

Domagoj Bradac, Nemanja Draganic, Benny Sudakov

Comb., October, 2024

Tight bounds for divisible subdivisions.

Shagnik Das, Nemanja Draganic, Raphael Steiner

J. Comb. Theory B, March, 2024

Cycles with many chords.

Nemanja Draganic, Abhishek Methuku, David Munhá Correia, Benny Sudakov

Random Struct. Algorithms, 2024

A generalization of Bondy's pancyclicity theorem.

Nemanja Draganic, David Munhá Correia, Benny Sudakov

Comb. Probab. Comput., 2024

Edge-disjoint paths in expanders: online with removals.

Nemanja Draganic, Rajko Nenadov

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Tight bounds for powers of Hamilton cycles in tournaments.

Nemanja Draganic, David Munhá Correia, Benny Sudakov

J. Comb. Theory B, 2023

2022

The largest hole in sparse random graphs.

Nemanja Draganic, Stefan Glock, Michael Krivelevich

Random Struct. Algorithms, 2022

Ramsey number of 1-subdivisions of transitive tournaments.

Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster

J. Comb. Theory B, 2022

Short proofs for long induced paths.

Nemanja Draganic, Stefan Glock, Michael Krivelevich

Comb. Probab. Comput., 2022

2021

Large Induced Matchings in Random Graphs.

Oliver Cooley, Nemanja Draganic, Mihyun Kang, Benny Sudakov

SIAM J. Discret. Math., 2021

The size-Ramsey number of short subdivisions.

Nemanja Draganic, Michael Krivelevich, Rajko Nenadov

Random Struct. Algorithms, 2021

Unavoidable hypergraphs.

Matija Bucic, Nemanja Draganic, Benny Sudakov, Tuan Tran

J. Comb. Theory B, 2021

Powers of paths in tournaments.

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

Comb. Probab. Comput., 2021

Universal and unavoidable graphs.

Matija Bucic, Nemanja Draganic, Benny Sudakov

Comb. Probab. Comput., 2021

Rolling backwards can move you forward: on embedding problems in sparse expanders.

Nemanja Draganic, Michael Krivelevich, Rajko Nenadov

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2019

A Ramsey theorem for multiposets.

Nemanja Draganic, Dragan Masulovic

Eur. J. Comb., 2019