Local resilience of an almost spanning k-cycle in random graphs. - Nemanja Skoric; Angelika Steger; Milos Trujic (Random Struct. Algorithms, 2018)

On Resilience of Connectivity in the Evolution of Random Graphs. - Luc Haller; Milos Trujic (Electron. J. Comb., 2019)

Resilience of perfect matchings and Hamiltonicity in random graph processes. - Rajko Nenadov; Angelika Steger; Milos Trujic (Random Struct. Algorithms, 2019)

An Optimal Decentralized (Δ + 1)-Coloring Algorithm. - Daniel Bertschinger; Johannes Lengler; Anders Martinsson; Robert Meier; Angelika Steger; Milos Trujic; Emo Welzl (ESA, 2020)

Sprinkling a Few Random Edges Doubles the Power. - Rajko Nenadov; Milos Trujic (SIAM J. Discret. Math., 2021)

Triangle resilience of the square of a Hamilton cycle in random graphs. - Manuela Fischer; Nemanja Skoric; Angelika Steger; Milos Trujic (J. Comb. Theory B, 2022)

Covering cycles in sparse graphs. - Frank Mousset; Nemanja Skoric; Milos Trujic (Random Struct. Algorithms, 2022)

On the size-Ramsey number of grids. - David Conlon; Rajko Nenadov; Milos Trujic (Comb. Probab. Comput., 2023)

Ramsey numbers for multiple copies of sparse graphs. - Aurelio L. Sulser; Milos Trujic (J. Graph Theory, 2024)

Transference for loose Hamilton cycles in random 3-uniform hypergraphs. - Kalina Petrova; Milos Trujic (Random Struct. Algorithms, 2024)