Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
Hendrik Molter
Malte Renken
Paul Spirakis
Philipp Zschoche
Mertzios, G., Molter, H., Renken, M., Spirakis, P., & Zschoche, P. (2025). The complexity of transitively orienting temporal graphs. Journal of Computer and System Sciences, 150, Article 103630. https://doi.org/10.1016/j.jcss.2025.103630
Journal Article Type | Article |
---|---|
Acceptance Date | Jan 27, 2025 |
Online Publication Date | Feb 3, 2025 |
Publication Date | 2025-06 |
Deposit Date | Jan 28, 2025 |
Publicly Available Date | Feb 26, 2025 |
Journal | Journal of Computer and System Sciences |
Print ISSN | 0022-0000 |
Electronic ISSN | 1090-2724 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 150 |
Article Number | 103630 |
DOI | https://doi.org/10.1016/j.jcss.2025.103630 |
Public URL | https://durham-repository.worktribe.com/output/3354019 |
Published Journal Article
(1 Mb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
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
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
Apache License Version 2.0 (http://www.apache.org/licenses/)
Apache License Version 2.0 (http://www.apache.org/licenses/)
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