Nina Klobas nina.klobas@durham.ac.uk
PGR Student Doctor of Philosophy
Temporal graph realization from fastest paths
Klobas, Nina; Mertzios, George; Molter, Hendrik; Spirakis, Paul
Authors
Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
Hendrik Molter
Paul Spirakis
Citation
Klobas, N., Mertzios, G., Molter, H., & Spirakis, P. (in press). Temporal graph realization from fastest paths.
Conference Name | 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024 |
---|---|
Conference Location | Patras, Greece |
Start Date | Jun 5, 2024 |
End Date | Jun 7, 2024 |
Acceptance Date | Mar 21, 2024 |
Deposit Date | May 2, 2024 |
Publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Series Title | Leibniz International Proceedings in Informatics (LIPIcs) |
Series ISSN | 1868-8969 |
Public URL | https://durham-repository.worktribe.com/output/2431661 |
Publisher URL | https://drops.dagstuhl.de/entities/conference/SAND |
This file is under embargo due to copyright reasons.
You might also like
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs
(2023)
Conference Proceeding
Interference-free walks in time: Temporally disjoint paths
(2022)
Journal Article
The complexity of computing optimum labelings for temporal connectivity
(2022)
Conference Proceeding
The complexity of temporal vertex cover in small-degree graphs
(2022)
Conference Proceeding
Interference-free walks in time: temporally disjoint paths
(2021)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search