Fast recognition of some parametric graph families. - Nina Klobas; Matjaz Krnc (CoRR, 2020)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs. - Thekla Hamm; Nina Klobas; George B. Mertzios; Paul G. Spirakis (AAAI, 2022)

Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk). - Nina Klobas; George B. Mertzios; Paul G. Spirakis (MFCS, 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)

Realizing temporal graphs from fastest travel times. - Nina Klobas; George B. Mertzios; Hendrik Molter; Paul G. Spirakis (CoRR, 2023)

The complexity of computing optimum labelings for temporal connectivity. - Nina Klobas; George B. Mertzios; Hendrik Molter; Paul G. Spirakis (J. Comput. Syst. Sci., 2024)

Distinguishing graphs via cycles. - Nina Klobas; Matjaz Krnc (Discret. Appl. Math., 2025)

Temporal graph realization from fastest paths. - Nina Klobas; George B. Mertzios; Hendrik Molter; Paul G. Spirakis (Theor. Comput. Sci., 2025)