 | Up a level |
Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor 
ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2020)
Computing Maximum Matchings in Temporal Graphs.
.
Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2020)
Computing Maximum Matchings in Temporal Graphs.
In: STACS.
Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2023)
Computing maximum matchings in temporal graphs.
Journal of Computer and System Sciences, 137.
pp. 1-19.
Potapov, I, Niskanen, R ORCID: 0000-0002-2210-1481 and Reichert, J
(2016)
Undecidability of Two-dimensional Robot Games.
In: 41st International Symposium on Mathematical Foundations of Computer Science, 2016-8-22 - 2016-8-26, Krakow (Poland).
Potapov, I and Semukhin, P
(2016)
Vector Reachability Problem in SL(2,Z).
In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 2016-8-22 - 2016-8-26, Krakow (Poland).