 | Up a level |
Spirakis, PG 
ORCID: 0000-0001-5396-3749, Deligkas, A and mertzios, george
(2018)
Binary Search in Graphs Revisited.
Algorithmica: an international journal in computer science, 81 (5).
pp. 1757-1780.
Chatterjee, K, Ibsen-Jensen, R ORCID: 0000-0003-4783-0389 and Nowak, MA
(2017)
Faster Monte-Carlo algorithms for fixation probability of the moran process on undirected graphs.
.
Potapov, I and Semukhin, P
(2017)
Membership problem in GL(2, Z) extended by singular matrices.
In: MFCS, 2017-8-21 - 2017-8-25, Aalborg, Denmark.
Chatterjee, K, Hansen, KA and Ibsen-Jensen, R ORCID: 0000-0003-4783-0389
(2017)
Strategy complexity of concurrent safety games.
.
Brânzei, S, Filos-Ratsikas, A ORCID: 0000-0001-7868-8114, Miltersen, PB and Zeng, Y
(2017)
Walrasian pricing in multi-unit auctions.
In: MFCS, Denmark.