The n-queens completion problem. - Stefan Glock; David Munhá Correia; Benny Sudakov (CoRR, 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)

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

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

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs. - Jun-Ting Hsieh; Pravesh K. Kothari; Sidhanth Mohanty; David Munhá Correia; Benny Sudakov (CoRR, 2024)

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

Turán problems in pseudorandom graphs. - Xizhi Liu; Dhruv Mubayi; David Munhá Correia (Comb. Probab. Comput., 2024)

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