Milos Trujic

According to our database, Milos Trujic authored at least 8 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the size-Ramsey number of grids.

David Conlon, Rajko Nenadov, Milos Trujic

Comb. Probab. Comput., November, 2023

2022

Covering cycles in sparse graphs.

Frank Mousset, Nemanja Skoric, Milos Trujic

Random Struct. Algorithms, 2022

Triangle resilience of the square of a Hamilton cycle in random graphs.

Manuela Fischer, Nemanja Skoric, Angelika Steger, Milos Trujic

J. Comb. Theory, Ser. B, 2022

2021

Sprinkling a Few Random Edges Doubles the Power.

Rajko Nenadov, Milos Trujic

SIAM J. Discret. Math., 2021

2020

An Optimal Decentralized (Δ + 1)-Coloring Algorithm.

Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Resilience of perfect matchings and Hamiltonicity in random graph processes.

Rajko Nenadov, Angelika Steger, Milos Trujic

Random Struct. Algorithms, 2019

On Resilience of Connectivity in the Evolution of Random Graphs.

Luc Haller, Milos Trujic

Electron. J. Comb., 2019

2018

Local resilience of an almost spanning k-cycle in random graphs.

Nemanja Skoric, Angelika Steger, Milos Trujic

Random Struct. Algorithms, 2018