(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. - Domagoj Bradac; Sahil Singla 001; Goran Zuzic (APPROX-RANDOM, 2019)

Robust Algorithms for the Secretary Problem. - Domagoj Bradac; Anupam Gupta 001; Sahil Singla 001; Goran Zuzic (ITCS, 2020)

Powers of Hamilton Cycles of High Discrepancy are Unavoidable. - Domagoj Bradac (Electron. J. Comb., 2022)

Covering random graphs with monochromatic trees. - Domagoj Bradac; Matija Bucic (Random Struct. Algorithms, 2023)

Asymptotics of the Hypergraph Bipartite Turán Problem. - Domagoj Bradac; Lior Gishboliner; Oliver Janzer; Benny Sudakov (Comb., 2023)

Minimum Degree Threshold for $H$-factors with High Discrepancy. - Domagoj Bradac; Micha Christoph; Lior Gishboliner (Electron. J. Comb., 2024)

Large cliques or cocliques in hypergraphs with forbidden order-size pairs. - Maria Axenovich; Domagoj Bradac; Lior Gishboliner; Dhruv Mubayi; Lea Weber (Comb. Probab. Comput., 2024)

On Ramsey Size-Linear Graphs and Related Questions. - Domagoj Bradac; Lior Gishboliner; Benny Sudakov (SIAM J. Discret. Math., 2024)

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

On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph. - Domagoj Bradac (J. Graph Theory, 2025)