Staff profile
Overview
Nina
Publications
Conference Paper
- Klobas, N., Mertzios, G., Molter, H., & Spirakis, P. (2024). Temporal Graph Realization from Fastest Paths. In 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024) (16:1-16:18). https://doi.org/10.4230/LIPIcs.SAND.2024.16
- Klobas, N., Mertzios, G. B., & Spirakis, P. G. (2023). Sliding into the Future: Investigating Sliding Windows in Temporal Graphs. . https://doi.org/10.4230/LIPIcs.MFCS.2023.5
- Hamm, T., Klobas, N., Mertzios, G., & Spirakis, P. (2023, February). The complexity of temporal vertex cover in small-degree graphs. Presented at 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vancouver, BC
- Klobas, N., Mertzios, G., Molter, H., & Spirakis, P. (2022, August). The complexity of computing optimum labelings for temporal connectivity. Presented at 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Vienna, Austria
- Klobas, N., Mertzios, G., Molter, H., Niedermeier, R., & Zschoche, P. (2021, August). Interference-free walks in time: temporally disjoint paths. Presented at 30th International Joint Conference on Artificial Intelligence (IJCAI-21), Montreal, Quebec
Journal Article
- Klobas, N., Mertzios, G., Molter, H., & Spirakis, P. (online). The complexity of computing optimum labelings for temporal connectivity. Journal of Computer and System Sciences, Article 103564. https://doi.org/10.1016/j.jcss.2024.103564
- Klobas, N., Mertzios, G., Molter, H., Niedermeier, R., & Zschoche, P. (2022). Interference-free walks in time: Temporally disjoint paths. Autonomous Agents and Multi-Agent Systems, 37, Article 1. https://doi.org/10.1007/s10458-022-09583-5