Viktor Zamaraev
University of Warwick
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Viktor Zamaraev.
workshop on graph theoretic concepts in computer science | 2015
Vadim V. Lozin; Igor Razgon; Viktor Zamaraev
We present a hereditary class of graphs of unbounded clique-width which is well-quasi-ordered by the induced subgraph relation. This result provides the negative answer to a question asked by Daligault, Rao and Thomasse in [3].
Journal of Graph Theory | 2018
Alain Hertz; Vadim V. Lozin; Bernard Ries; Viktor Zamaraev; Dominique de Werra
An induced matching
workshop on graph theoretic concepts in computer science | 2017
Vadim V. Lozin; Dmitriy S. Malyshev; Raffaele Mosca; Viktor Zamaraev
M
principles of distributed computing | 2018
Christian Konrad; Viktor Zamaraev
in a graph
international workshop on combinatorial algorithms | 2018
Bogdan Alecu; Vadim V. Lozin; Viktor Zamaraev
G
international workshop on combinatorial algorithms | 2018
Aistis Atminas; Vadim V. Lozin; Viktor Zamaraev
is dominating if every edge not in
Discrete and Computational Geometry | 2018
Aistis Atminas; Viktor Zamaraev
M
Discrete Applied Mathematics | 2018
Vadim V. Lozin; Igor Razgon; Viktor Zamaraev; Elena Zamaraeva; Nikolai Yu. Zolotykh
shares exactly one vertex with an edge in
mathematical foundations of computer science | 2017
Alexandre Blanché; Konrad K. Dabrowski; Matthew Johnson; Vadim V. Lozin; Daniël Paulusma; Viktor Zamaraev
M
international workshop on combinatorial algorithms | 2017
Bogdan Alecu; Vadim V. Lozin; Viktor Zamaraev; Dominique de Werra
. The dominating induced matching problem (also known as efficient edge domination) asks whether a graph
Collaboration
Dive into the Viktor Zamaraev's collaboration.
