Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
Temporal graph realization with bounded stretch
Mertzios, George; Molter, Hendrik; Morawietz, Nils; Spirakis, Paul
Authors
Hendrik Molter
Nils Morawietz
Paul Spirakis
Citation
Mertzios, G., Molter, H., Morawietz, N., & Spirakis, P. (2025, August). Temporal graph realization with bounded stretch. Presented at Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), Warsaw, Poland
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025) |
| Start Date | Aug 25, 2025 |
| Acceptance Date | Jun 20, 2025 |
| Deposit Date | Jun 25, 2025 |
| Peer Reviewed | Peer Reviewed |
| DOI | https://doi.org/10.4230/LIPIcs.MFCS.2025.20 |
| Public URL | https://durham-repository.worktribe.com/output/4122474 |
You might also like
Interference-free walks in time: Temporally disjoint paths
(2022)
Journal Article
Equitable scheduling on a single machine
(2022)
Journal Article
The Power of Linear-Time Data Reduction for Maximum Matching
(2020)
Journal Article
When can graph hyperbolicity be computed in linear time?
(2018)
Journal Article
A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
(2018)
Journal Article
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 © 2025
Advanced Search