![]() | Up a level |
Adamson, D, Gusev, VV, Malyshev, D and Zamaraev, V ORCID: 0000-0001-5755-4141
(2022)
Faster Exploration of Some Temporal Graphs.
.
Alecu, B, Alekseev, VE, Atminas, A, Lozin, V and Zamaraev, V ORCID: 0000-0001-5755-4141
(2023)
Graph parameters, implicit representations and factorial properties.
DISCRETE MATHEMATICS, 346 (10).
p. 113573.
Dabrowski, KK, Johnson, M, Paesani, G, Paulusma, D and Zamaraev, V ORCID: 0000-0001-5755-4141
(2019)
INDEPENDENT TRANSVERSALS VERSUS TRANSVERSALS.
.
Collins, A, Foniok, J, Korpelainen, N, Lozin, V and Zamaraev, V ORCID: 0000-0001-5755-4141
(2018)
Infinitely many minimal classes of graphs of unbounded clique-width.
DISCRETE APPLIED MATHEMATICS, 248.
pp. 145-152.
Esperet, L, Harms, N and Zamaraev, V ORCID: 0000-0001-5755-4141
(2023)
Optimal Adjacency Labels for Subgraphs of Cartesian Products.
.