David Gajser

12 papers Journal 12

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Connectivity with Uncertainty Regions Given as Line Segments. Algorithmica Sergio Cabello, David Gajser
2023	J	`jnl`	Connectivity with uncertainty regions given as line segments. CoRR Sergio Cabello, David Gajser
2020	J	`jnl`	Verifying whether one-tape Turing machines run in linear time. J. Comput. Syst. Sci. David Gajser
2018	J	`jnl`	Minimal Normal Graph Covers. Comb. David Gajser, Bojan Mohar
2016	J	`jnl`	On convergence of binomial means, and an application to finite Markov chains. Ars Math. Contemp. David Gajser
2016	J	`jnl`	Verifying Time Complexity of Turing Machines. Informatica (Slovenia) David Gajser
2015	J	`jnl`	Simple PTAS's for families of graphs excluding a minor. Discret. Appl. Math. Sergio Cabello, David Gajser
2015	J	`jnl`	Verifying time complexity of Turing machines. Theor. Comput. Sci. David Gajser
2015	J	`jnl`	Verifying whether One-Tape Turing Machines Run in Linear Time. Electron. Colloquium Comput. Complex. David Gajser
2014	J	`jnl`	Simple PTAS's for families of graphs excluding a minor. CoRR Sergio Cabello, David Gajser
2013	J	`jnl`	Verifying Time Complexity of Deterministic Turing Machines. CoRR David Gajser
2013	J	`jnl`	Verifying whether one-tape NTMs run in time $Cn+D$. CoRR David Gajser