Nina Klobas

I am

A third 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, G. B. Mertzios, H. Molter, and P.G. Spirakis. The Complexity of Computing Optimum Labelings for Temporal Connectivity. In proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS), Vienna, Austria, August 2022. (PDF)
• T. Hamm, N. Klobas, G.B. Mertzios, and 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. (PDF)
• 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

• N. Klobas, G. B. Mertzios, H. Molter, P.G. Spirakis. Realizing temporal graphs from fastest travel times, 2023, arXiv:2302.08860 [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].
• 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, 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].

Journal Publications

• N. Klobas, G.B. Mertzios, H. Molter, R. Niedermeier, and P. Zschoche. Interference-free walks in time: temporally disjoint paths. Autonomous Agents and Multi-Agent Systems, Volume 37, 2023 (link)

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
• 2022 - 2023 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