Miloš Trujić

I am a fourth year PhD student in Computer Science at ETH Zürich. My adviser is Professor Angelika Steger. Prior to this I received my Master's degree from ETH Zürich in 2016 and my Bachelor's degree from University of Novi Sad in 2014. My research interests include, but are not limited to, probabilistic and extremal combinatorics, graph theory, random graph theory, and random discrete structures.

Publications

Preprints

The Chromatic Number of Dense Random Block Graphs
(joint with A. Martinsson, K. Panagiotou, and P. Su)
submitted July 2020

Covering cycles in sparse graphs
(joint with F. Mousset and N. Škorić)
submitted March 2020

Sprinkling a few random edges doubles the power
(joint with R. Nenadov)
submitted November 2018

Triangle resilience of the square of a Hamilton cycle in random graphs
(joint with M. Fischer, N. Škorić, and A. Steger)
submitted September 2018

Accepted publications

2020

An optimal decentralized (Δ+1)-coloring algorithm
(joint with D. Bertschinger, J. Lengler, A. Martinsson, R. Meier, A. Steger, and E. Welzl)
28th Annual European Symposium on Algorithms (ESA 2020)

2019

The edge-statistics conjecture for ℓ ≪ k^6/5
(joint with A. Martinsson, F. Mousset, and A. Noever)
Israel Journal of Mathematics 234, 677-690

Resilience of perfect matchings and Hamiltonicity in random graph Processes
(joint with R. Nenadov and A. Steger)
Random Structures & Algorithms 54, 797-819

On resilience of connectivity in the evolution of random graphs
(joint with L. Haller)
Electronic Journal of Combinatorics 26, P2.24

2018

Local resilience of an almost spanning k-cycle in random graphs
(joint with N. Škorić and A. Steger)
Random Structures & Algorithms 53, 728-751

Talks

July 2019	RS&A 2019, ETH Zurich, Zurich
May 2019	CoG 2019, Moscow Institute of Physics and Technology, Moscow
March 2018	SLADIM+, University of Novi Sad, Novi Sad
July 2017	NSFOCS 2017, University of Novi Sad, Novi Sad
August 2017	RS&A 2017, Institute of European Culture, Gniezno