I am
A second year PhD student in the Algorithms and Complexity research group at Durham University (ACiD).
Research interests
- Algorithmic Graph Theory
- Efficient Algorithms Computational Complexity
- Temporal Graphs
Publications
Conference Publications
- T. Hamm, N. Klobas, G.B. Mertzios, P.G. Spirakis. The Complexity of Temporal Vertex Cover in Small-Degree Graphs. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, a virtual conference, February - March 2022. To appear.
- N. Klobas and M. Krnc, Distinguishing graphs via cycles. In Proceedings of the 27th International Computing and Combinatorics Conference (COCOON), Tainan, Taiwan, October 2021. (PDF)
- N. Klobas, G.B. Mertzios, H. Molter, R. Niedermeier, and P. Zschoche. Interference-free walks in time: temporally disjoint paths. In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), Montreal, Canada, August 2021. (PDF)
Preprints
- T. Hamm, N. Klobas, G.B. Mertzios, P.G. Spirakis. The Complexity of Temporal Vertex Cover in Small-Degree Graphs, 2022. , arXiv:2204.04832 [cs.DS].
- N. Klobas, G.B. Mertzios, H. Molter, P.G. Spirakis. The complexity of computing optimum labelings for temporal connectivity, 2022, arXiv:2202.05880 [cs.DS].
- N. Klobas, G.B. Mertzios, H. Molter, R. Niedermeier, and P. Zschoche. Interference-free walks in time: temporally disjoint paths, 2021, arXiv:2105.08335 [cs.DS].
- N. Klobas and M. Krnc, Fast recognition of some parametric graph families, 2020, arXiv:2008.08856 [math.CO].
Education
-
2020 - present
PhD at Durham University under the supervison of George B. Mertzios and Matthew Johnson
-
2015 - 2020
BSc and MSc in Mathematics at FAMNIT, University of Primorska
Teaching
2020 - 2021
demonstrator of Theory of Computation
2021 - 2022
demonstrator of Theory of Computation, Computational Thinking, Project Preparation
Quantum Physics
- If interested in non-equilibrium statistical mechanics or many-body (quantum and classical) dynamics contact Katja Klobas