Draganić, N, Kim, J., Lee, H., Munhá Correia, D., Pavez-Signé, M., Sudakov, B. (2025), Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
Christoph, M., Draganić, N., Girão, A., Hurley, E., Michel, L. and Müyesser, A. (2025), New bounds for linear arboricity and related problems, submitted
Draganić, N., Montgomery R., Munhá Correia, D., Pokrovskiy, A. and Sudakov B. (2024), Hamiltonicity of expanders: optimal bounds and applications, submitted
Draganić, N. and Keevash, P. (2024), Posa rotation through a random permutation, submitted
Draganić, N., Kaufmann, M., Munhá Correia, D., Petrova, K., Steiner, R. (2023). Size-Ramsey numbers of structurally sparse graphs, submitted
Draganić, N, Frankston, K., Krivelevich, M., Pokrovskiy, A., Yepremyan, L., (2025), Independent spanning trees in random and pesudorandom graphs, Symposium on Discrete Algorithms (SODA'26)
Christoph, M., Draganić, N., Girão, A., Hurley, E., Michel, L. and Müyesser, A. (2025), Cycle-factors of regular graphs via entropy
Symposium on Foundations of Computer Science (FOCS'25)
Draganić, N., Munhá Correia, D., Sudakov, B. (2025+). Pancyclicity of Hamiltonian graphs
Journal of European Mathematical Society (JEMS)
Draganić, N., Keevash, P., Müyesser, A. (2025+), Cyclic subsets in regular Dirac graphs,
International Mathematics Research Notices (IMRN), 14: rnaf215.
Draganić, N., Krivelevich M. (2025), Disjoint connected dominating sets in pseudorandom graphs
Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC), 329-335.
Draganić, N., Petrova, K. (2025). The size-Ramsey number of graphs with maximum degree three
Journal of the London Mathematical Society (JLMS), 11.3: e70116.
Draganić, N. and Keevash, P. (2025). Long induced paths in expanders,
Combinatorics, Probability and Computing (CPC), 34(2):276-282.
Draganić, N., Glock, S., Munhá Correia, D., Sudakov, B. (2025). Optimal Hamilton covers and linear arboricity for random graphs
Proceedings of American Mathematical Society (PAMS), 153(3):921-935.
Bradač, D., Draganić, N., and Sudakov, B. (2024). Effective bounds for induced size-Ramsey numbers of cycles
Combinatorica 44: 1011-1039.
Draganić, N., Methuku, A., Munhá Correia, D., and Sudakov, B. (2024). Cycles with many chords
Random Structures and Algorithms (RSA) 65(1):3-16
Draganić, N., Munhá Correia, D., and Sudakov, B. (2024). A generalization of Bondy's pancyclicity theorem
Combinatorics, Probability and Computing (CPC) 33(5): 554-563
Draganić, N., Munhá Correia, D., and Sudakov, B. (2024). Chvátal-Erdős condition for pancyclicity
Journal of the Association for Mathematical Research (JAMR) 2(1):1-14.
Das, S., Draganić, N., Steiner, R. (2024). Tight bounds for divisible subdivisions
Journal of Combinatorial Theory, Ser. B. (JCTB) 165: 1-19.
Draganić, N. and Nenadov R. (2024). Edge-disjoint paths in expanders: online with removals
Proceedings of the 2024 Symposium on Discrete Algorithms (SODA'24), 4554-4563.
Draganić, N., Munhá Correia, D., and Sudakov, B. (2023). Tight bounds for powers of Hamilton cycles in tournaments
Journal of Combinatorial Theory, ser. B (JCTB) 158: 305-340.
Draganić, N., Munhá Correia, D., Sudakov, B., Yuster, R. (2022). Ramsey number of 1-subdivisions of transitive tournaments
Journal of Combinatorial Theory, Ser. B (JCTB) 157: 176-183.
Draganić, N., Glock, S., Krivelevich, M. (2022). Short proofs for long induced paths,
Combinatorics, Probability and Computing (CPC) 31(5): 870-878.
Draganić, N., Glock, S., Krivelevich, M. (2022). The largest hole in sparse random graphs,
Random Structures and Algorithms (RSA) 61(4): 666-677.
Bucić, M., Draganić, N., Sudakov, B. and Tuan, T. (2021). Unavoidable hypergraphs
Journal of Combinatorial Theory, Ser. B (JCTB) 151: 307-338.
Draganić, N., Krivelevich, M. and Nenadov R. (2021). Rolling backwards can move you forward: on embedding problems in sparse expanders, Transactions of American Mathematical Society (TAMS) 375: 5195-5216.
A preliminary version appeared in Proceedings of the 32nd Symposium on Discrete Algorithms (SODA'21), 123-134.
Cooley, O., Draganić, N., Kang, M. and Sudakov, B. (2021). Large induced matchings in random graphs
SIAM Journal on Discrete Mathematics (SIDMA) 35(1): 267-280.
Bucić, M., Draganić, N. and Sudakov, B. (2021). Universal and unavoidable graphs
Combinatorics, Probability and Computing (CPC) 30: 942-955.
Draganić, N., Dross, F., Fox, J., Girão, A., Havet, F., Korándi, D., Lochet, W., Munhá Correia, D., Scott, A. and Sudakov, B. (2020).
Powers of paths in tournaments
Combinatorics, Probability and Computing (CPC) 30: 894-898.
Draganić, N., Krivelevich, M. and Nenadov R. (2020). The size-Ramsey number of short subdivisions
Random Structures and Algorithms (RSA) 59: 68– 78.
Draganić, N. and Mašulović, D. (2018). A Ramsey Theorem for Multiposets,
European Journal of Combinatorics (EJC) 81: 142-149.
Draganić, N., Marković, P., Uljarević, V. and Zahirović, S. (2017).
A characterization of idempotent strong Mal’cev conditions for congruence meet-semidistributivity in locally finite varieties ,
Algebra universalis 79(3), article no. 53.