Verifying Time Complexity of Deterministic Turing Machines. - David Gajser (CoRR, 2013)

Verifying whether one-tape NTMs run in time $Cn+D$. - David Gajser (CoRR, 2013)

Simple PTAS's for families of graphs excluding a minor. - Sergio Cabello; David Gajser (Discret. Appl. Math., 2015)

Verifying time complexity of Turing machines. - David Gajser (Theor. Comput. Sci., 2015)

On convergence of binomial means, and an application to finite Markov chains. - David Gajser (Ars Math. Contemp., 2016)

Minimal Normal Graph Covers. - David Gajser; Bojan Mohar (Comb., 2018)

Verifying whether one-tape Turing machines run in linear time. - David Gajser (J. Comput. Syst. Sci., 2020)

Connectivity with Uncertainty Regions Given as Line Segments. - Sergio Cabello; David Gajser (Algorithmica, 2024)