Up a level |
Alecu, Bogdan, Kante, Mamadou Moustapha, Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020)
Between clique-width and linear clique-width of bipartite graphs.
DISCRETE MATHEMATICS, 343 (8).
p. 111926.
Hertz, Alain, Lozin, Vadim, Ries, Bernard, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and de Werra, Dominique
(2018)
Dominating induced matchings in graphs containing no long claw.
JOURNAL OF GRAPH THEORY, 88 (1).
pp. 18-39.
Alecu, Bogdan, Alekseev, Vladimir E, Atminas, Aistis, Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2022)
Graph Parameters, Implicit Representations and Factorial Properties.
In: The 33rd International Workshop on Combinatorial Algorithms (IWOCA), 2022-6-7 - 2022-6-9, Trier, Germany.
Alecu, Bogdan, Atminas, Aistis, Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2021)
Graph classes with linear Ramsey numbers.
Discrete Mathematics, 344 (4).
p. 112307.
Lozin, Vadim, Malyshev, Dmitriy, Mosca, Raffaele and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020)
Independent domination versus weighted independent domination.
INFORMATION PROCESSING LETTERS, 156.
p. 105914.
Alecu, Bogdan, Ferguson, Robert, Kanté, Mamadou Moustapha, Lozin, Vadim, Vatter, Vincent and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2021)
Letter graphs and geometric grid classes of permutations.
[Preprint]
Atminas, Aistis, Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018)
Linear Ramsey Numbers.
.
Lozin, Vadim, Razgon, Igor, Zamaraev, Viktor ORCID: 0000-0001-5755-4141, Zamaraeva, Elena and Zolotykh, Nikolai
(2018)
Linear read-once and related Boolean functions.
DISCRETE APPLIED MATHEMATICS, 250.
pp. 16-27.
Lozin, Vadim, Malyshev, Dmitriy, Mosca, Raffaele and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2017)
More results on weighted independent domination.
THEORETICAL COMPUTER SCIENCE, 700.
pp. 63-74.
Lozin, Vadim, Zamaraev, Viktor ORCID: 0000-0001-5755-4141, Zamaraeva, Elena and Zolotykh, Nikolai Yu
(2022)
On Boolean threshold functions with minimum specification number.
INFORMATION AND COMPUTATION, 289.
p. 104926.
Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2024)
Union-closed sets and Horn Boolean functions.
Journal of Combinatorial Theory, Series A, 202.
p. 105818.
AbouEisha, Hassan, Hussain, Shahid, Lozin, Vadim, Monnot, Jerome, Ries, Bernard and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018)
Upper Domination: Towards a Dichotomy Through Boundary Properties.
ALGORITHMICA, 80 (10).
pp. 2799-2817.
Lozin, Vadim, Razgon, Igor and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018)
Well-quasi-ordering versus clique-width.
JOURNAL OF COMBINATORIAL THEORY SERIES B, 130.
pp. 1-18.
Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2017)
The structure and the number of <i>P</i><sub>7</sub>-free bipartite graphs.
EUROPEAN JOURNAL OF COMBINATORICS, 65.
pp. 143-153.
Alecu, Bogdan, Lozin, Vadim, Quiroz, Daniel A, Rabinovich, Roman, Razgon, Igor and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2022)
The treewidth and pathwidth of graph unions.
[Report]