Nina Klobas

According to our database, Nina Klobas authored at least 8 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Temporal graph realization from fastest paths.

Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis

Theor. Comput. Sci., 2025

Distinguishing graphs via cycles.

Nina Klobas, Matjaz Krnc

Discret. Appl. Math., 2025

2024

The complexity of computing optimum labelings for temporal connectivity.

Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis

J. Comput. Syst. Sci., 2024

2023

Realizing temporal graphs from fastest travel times.

Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis

CoRR, 2023

Interference-free walks in time: temporally disjoint paths.

Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche

Auton. Agents Multi Agent Syst., 2023

Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk).

Nina Klobas, George B. Mertzios, Paul G. Spirakis

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

The Complexity of Temporal Vertex Cover in Small-Degree Graphs.

Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2020

Fast recognition of some parametric graph families.

Nina Klobas, Matjaz Krnc

CoRR, 2020