Nina Klobas

I am

First year PhD student in the Algorithms and Complexity research group at Durham University (ACiD).

Contact and profiles

• nina [dot] klobas [at] durham [dot] ac [dot] uk
• ORCID ID
• Research Gate
• LinkedIn

Research interests

• Algorithmic Graph Theory
• Efficient Algorithms Computational Complexity
• Temporal Graphs

Publications

Conference Publications

• N. Klobas and M. Krnc, Distinguishing graphs via cycles. In Proceedings of the 27th International Computing and Combinatorics Conference (COCOON), Tainan, Taiwan, October 2021. To appear.
• 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

• 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

Quantum Physics

• If interested in non-equilibrium statistical mechanics or many-body (quantum and classical) dynamics contact Katja Klobas