A Ramsey theorem for multiposets. - Nemanja Draganic; Dragan Masulovic (Eur. J. Comb., 2019)

Rolling backwards can move you forward: on embedding problems in sparse expanders. - Nemanja Draganic; Michael Krivelevich; Rajko Nenadov (SODA, 2021)

Universal and unavoidable graphs. - Matija Bucic; Nemanja Draganic; Benny Sudakov (Comb. Probab. Comput., 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)

Unavoidable hypergraphs. - Matija Bucic; Nemanja Draganic; Benny Sudakov; Tuan Tran (J. Comb. Theory B, 2021)

The size-Ramsey number of short subdivisions. - Nemanja Draganic; Michael Krivelevich; Rajko Nenadov (Random Struct. Algorithms, 2021)

Large Induced Matchings in Random Graphs. - Oliver Cooley; Nemanja Draganic; Mihyun Kang; Benny Sudakov (SIAM J. Discret. Math., 2021)

Short proofs for long induced paths. - Nemanja Draganic; Stefan Glock; Michael Krivelevich (Comb. Probab. Comput., 2022)

Ramsey number of 1-subdivisions of transitive tournaments. - Nemanja Draganic; David Munhá Correia; Benny Sudakov; Raphael Yuster (J. Comb. Theory B, 2022)

The largest hole in sparse random graphs. - Nemanja Draganic; Stefan Glock; Michael Krivelevich (Random Struct. Algorithms, 2022)

Tight bounds for powers of Hamilton cycles in tournaments. - Nemanja Draganic; David Munhá Correia; Benny Sudakov (J. Comb. Theory B, 2023)

Edge-disjoint paths in expanders: online with removals. - Nemanja Draganic; Rajko Nenadov (SODA, 2024)

A generalization of Bondy's pancyclicity theorem. - Nemanja Draganic; David Munhá Correia; Benny Sudakov (Comb. Probab. Comput., 2024)

Cycles with many chords. - Nemanja Draganic; Abhishek Methuku; David Munhá Correia; Benny Sudakov (Random Struct. Algorithms, 2024)

Tight bounds for divisible subdivisions. - Shagnik Das; Nemanja Draganic; Raphael Steiner (J. Comb. Theory B, 2024)

Effective Bounds for Induced Size-Ramsey Numbers of Cycles. - Domagoj Bradac; Nemanja Draganic; Benny Sudakov (Comb., 2024)

Disjoint Connected Dominating Sets in Pseudorandom Graphs. - Nemanja Draganic; Michael Krivelevich (STOC, 2025)

Long induced paths in expanders. - Nemanja Draganic; Peter Keevash (Comb. Probab. Comput., 2025)

Cycle-factors of regular graphs via entropy. - Micha Christoph; Nemanja Draganic; António Girão; Eoin Hurley; Lukas Michel; Alp Müyesser (CoRR, 2025)