Nina Klobas

Papers

Total Citations

H-Index

About

Nina Klobas is a rising researcher in theoretical computer science, with a primary focus on temporal graphs and algorithmic complexity. Her work centers on understanding how information or agents can move through networks that change over time—a crucial area for modeling dynamic systems like communication networks, transportation, or social interactions. Klobas’s major contribution lies in her investigation of temporally disjoint paths and walks, where she systematically explores the computational complexity of finding multiple routes that do not interfere with each other across time steps. Her most-cited paper, “Interference-free walks in time: temporally disjoint paths” (2022, 15 citations), along with its earlier version (2021, 4 citations), provides foundational insights into how to determine whether such non-conflicting temporal routes exist, establishing key hardness results and algorithmic approaches. While her citation counts are still growing—reflecting her early-career stage—her work has already attracted attention for its clarity and practical relevance. Klobas’s research is particularly notable for bridging theoretical graph theory with real-world applications, making her a promising voice in the evolving field of temporal networks.