 | Up a level |
Number of items: 2.
Klobas, N, Mertzios, GB, Molter, H and Spirakis, PG 
ORCID: 0000-0001-5396-3749
(2022)
The Complexity of Computing Optimum Labelings for Temporal Connectivity.
In: Mathematical Foundations of Computer Science (MFCS 2022), 2022-8-22 - 2022-8-26, Vienna , Austria.
Mertzios, GB, Molter, H, Renken, M, Spirakis, PG ORCID: 0000-0001-5396-3749 and Zschoche, P
(2021)
The Complexity of Transitively Orienting Temporal Graphs.
.