Nemanja Draganic

23 papers A* 5Journal 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Edge-Disjoint Paths in Expanders: Online with Removals. SIAM J. Comput. Nemanja Draganic, Rajko Nenadov
2026	A*	`conf`	On Independent Spanning Trees in Random Graphs. SODA Nemanja Draganic, Keith Frankston, Michael Krivelevich, Alexey Pokrovskiy, Liana Yepremyan
2025	A*	`conf`	Cycle-factors of regular graphs via entropy. FOCS Micha Christoph, Nemanja Draganic, António Girão, Eoin Hurley, Lukas Michel, Alp Müyesser
2025	J	`jnl`	Cycle-factors of regular graphs via entropy. CoRR Micha Christoph, Nemanja Draganic, António Girão, Eoin Hurley, Lukas Michel, Alp Müyesser
2025	A*	`conf`	Disjoint Connected Dominating Sets in Pseudorandom Graphs. STOC Nemanja Draganic, Michael Krivelevich
2025	J	`jnl`	Long induced paths in expanders. Comb. Probab. Comput. Nemanja Draganic, Peter Keevash
2024	J	`jnl`	A generalization of Bondy's pancyclicity theorem. Comb. Probab. Comput. Nemanja Draganic, David Munhá Correia, Benny Sudakov
2024	J	`jnl`	Cycles with many chords. Random Struct. Algorithms Nemanja Draganic, Abhishek Methuku, David Munhá Correia, Benny Sudakov
2024	A*	`conf`	Edge-disjoint paths in expanders: online with removals. SODA Nemanja Draganic, Rajko Nenadov
2024	J	`jnl`	Effective Bounds for Induced Size-Ramsey Numbers of Cycles. Comb. Domagoj Bradac, Nemanja Draganic, Benny Sudakov
2024	J	`jnl`	Tight bounds for divisible subdivisions. J. Comb. Theory B Shagnik Das, Nemanja Draganic, Raphael Steiner
2023	J	`jnl`	Edge-disjoint paths in expanders: online with removals. CoRR Nemanja Draganic, Rajko Nenadov
2023	J	`jnl`	Tight bounds for powers of Hamilton cycles in tournaments. J. Comb. Theory B Nemanja Draganic, David Munhá Correia, Benny Sudakov
2022	J	`jnl`	Ramsey number of 1-subdivisions of transitive tournaments. J. Comb. Theory B Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster
2022	J	`jnl`	Short proofs for long induced paths. Comb. Probab. Comput. Nemanja Draganic, Stefan Glock, Michael Krivelevich
2022	J	`jnl`	The largest hole in sparse random graphs. Random Struct. Algorithms Nemanja Draganic, Stefan Glock, Michael Krivelevich
2021	J	`jnl`	Large Induced Matchings in Random Graphs. SIAM J. Discret. Math. Oliver Cooley, Nemanja Draganic, Mihyun Kang, Benny Sudakov
2021	J	`jnl`	Powers of paths in tournaments. Comb. Probab. Comput. 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
2021	A*	`conf`	Rolling backwards can move you forward: on embedding problems in sparse expanders. SODA Nemanja Draganic, Michael Krivelevich, Rajko Nenadov
2021	J	`jnl`	The size-Ramsey number of short subdivisions. Random Struct. Algorithms Nemanja Draganic, Michael Krivelevich, Rajko Nenadov
2021	J	`jnl`	Unavoidable hypergraphs. J. Comb. Theory B Matija Bucic, Nemanja Draganic, Benny Sudakov, Tuan Tran
2021	J	`jnl`	Universal and unavoidable graphs. Comb. Probab. Comput. Matija Bucic, Nemanja Draganic, Benny Sudakov
2019	J	`jnl`	A Ramsey theorem for multiposets. Eur. J. Comb. Nemanja Draganic, Dragan Masulovic