Vadim V. Lozin

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 83

Top Venues

CoRR

Discret. Appl. Math.

IWOCA

Publications

Vadim V. Lozin, Viktor Zamaraev
Union-closed sets and Horn Boolean functions. J. Comb. Theory, Ser. A 202 (2024)
Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
The Treewidth and Pathwidth of Graph Unions. SIAM J. Discret. Math. 38 (1) (2024)
Bogdan Alecu, Vadim V. Lozin, Dmitriy S. Malyshev
Critical properties of bipartite permutation graphs. J. Graph Theory 105 (1) (2024)
Vadim V. Lozin
Hereditary classes of graphs: A parametric approach. Discret. Appl. Math. 325 (2023)
Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Victor Zamaraev
Graph parameters, implicit representations and factorial properties. Discret. Math. 346 (10) (2023)
Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Graph parameters, implicit representations and factorial properties. CoRR (2023)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev
Combinatorics and Algorithms for Quasi-Chain Graphs. Algorithmica 85 (3) (2023)
Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev
Functionality of box intersection graphs. CoRR (2023)
Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Graph Parameters, Implicit Representations and Factorial Properties. IWOCA (2022)
Bogdan Alecu, Vadim V. Lozin, Dominique de Werra
The micro-world of cographs. Discret. Appl. Math. 312 (2022)
Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
The treewidth and pathwidth of graph unions. CoRR (2022)
Vadim V. Lozin, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
On Boolean threshold functions with minimum specification number. Inf. Comput. 289 (Part) (2022)
Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev
Letter Graphs and Geometric Grid Classes of Permutations. SIAM J. Discret. Math. 36 (4) (2022)
Aistis Atminas, Vadim V. Lozin
Deciding Atomicity of Subword-Closed Languages. DLT (2022)
Vadim V. Lozin, Igor Razgon
Tree-width dichotomy. Eur. J. Comb. 103 (2022)
Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. Discret. Appl. Math. 295 (2021)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin
Graph functionality. J. Comb. Theory, Ser. B 147 (2021)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev
Combinatorics and Algorithms for Quasi-chain Graphs. IWOCA (2021)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Graph classes with linear Ramsey numbers. Discret. Math. 344 (4) (2021)
Vadim V. Lozin, Mikhail Moshkov
Critical Properties and Complexity Measures of Read-Once Boolean Functions. Ann. Math. Artif. Intell. 89 (5-6) (2021)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum independent sets in subcubic graphs: New results. Theor. Comput. Sci. 846 (2020)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci. 108 (2020)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
Independent domination versus weighted independent domination. Inf. Process. Lett. 156 (2020)
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
Between clique-width and linear clique-width of bipartite graphs. Discret. Math. 343 (8) (2020)
Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev
Letter graphs and geometric grid classes of permutations: Characterization and recognition. Discret. Appl. Math. 283 (2020)
Vadim V. Lozin, Igor Razgon
Tree-width dichotomy. CoRR (2020)
Bogdan Alecu, Vadim V. Lozin, Dominique de Werra
The Micro-world of Cographs. IWOCA (2020)
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
Clique-Width for Graph Classes Closed under Complementation. SIAM J. Discret. Math. 34 (2) (2020)
Miguel A. Lejeune, Vadim V. Lozin, Irina Lozina, Ahmed Ragab, Soumaya Yacout
Recent advances in the theory and practice of Logical Analysis of Data. Eur. J. Oper. Res. 275 (1) (2019)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin
Graph Functionality. WG (2019)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum Independent Sets in Subcubic Graphs: New Results. WG (2019)
Vadim V. Lozin
From Words to Graphs, and Back. LATA (2019)
Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev
Infinitely many minimal classes of graphs of unbounded clique-width. Discret. Appl. Math. 248 (2018)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Order 35 (2) (2018)
Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
Linear read-once and related Boolean functions. CoRR (2018)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev
Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica 80 (10) (2018)
Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
Linear read-once and related Boolean functions. Discret. Appl. Math. 250 (2018)
Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev
Letter graphs and geometric grid classes of permutations: characterization and recognition. CoRR (2018)
Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev
Linear Clique-Width of Bi-complement Reducible Graphs. IWOCA (2018)
Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Linear Ramsey Numbers. IWOCA (2018)
Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter
Perfect edge domination: hard and solvable cases. Ann. Oper. Res. 264 (1-2) (2018)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum Independent Sets in Subcubic Graphs: New Results. CoRR (2018)
Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
Well-quasi-ordering versus clique-width. J. Comb. Theory, Ser. B 130 (2018)
Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra
Dominating induced matchings in graphs containing no long claw. J. Graph Theory 88 (1) (2018)
Vadim V. Lozin, Dmitriy S. Malyshev
Vertex coloring of graphs with few obstructions. Discret. Appl. Math. 216 (2017)
Vadim V. Lozin, Igor Razgon, Victor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
Specifying a positive threshold function via extremal points. CoRR (2017)
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev
Clique-Width for Graph Classes Closed under Complementation. CoRR (2017)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
More results on weighted independent domination. Theor. Comput. Sci. 700 (2017)
Vadim V. Lozin
Graph Parameters and Ramsey Theory. IWOCA (2017)
Vadim V. Lozin, Viktor Zamaraev
-free bipartite graphs. Eur. J. Comb. 65 (2017)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. WG (2017)
Vadim V. Lozin
From matchings to independent sets. Discret. Appl. Math. 231 (2017)
Andrew Collins, Sergey Kitaev, Vadim V. Lozin
New results on word-representable graphs. Discret. Appl. Math. 216 (2017)
Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev
Infinitely many minimal classes of graphs of unbounded clique-width. CoRR (2017)
Vadim V. Lozin, Victor Zamaraev
-free bipartite graphs. Electron. Notes Discret. Math. 61 (2017)
Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter
Perfect Edge Domination: Hard and Solvable Cases. CoRR (2017)
Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov
WQO is decidable for factorial languages. Inf. Comput. 256 (2017)
Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra
Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. IWOCA (2017)
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
Clique-Width for Graph Classes Closed under Complementation. MFCS (2017)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
New Results on Weighted Independent Domination. WG (2017)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes. CoRR (2017)
Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
Specifying a positive threshold function via extremal points. ALT (2017)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
Upper Domination: towards a dichotomy through boundary properties. CoRR (2016)
Domingos M. Cardoso, Vadim V. Lozin, Carlos J. Luz, Maria F. Pacheco
Efficient domination through eigenvalues. Discret. Appl. Math. 214 (2016)
Vadim V. Lozin
Graph Parameters and Ramsey Theory. CoRR (2016)
Robert Brignall, Vadim V. Lozin, Juraj Stacho
Bichain graphs: Geometric model and universal graphs. Discret. Appl. Math. 199 (2016)
Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
Deciding the Bell Number for Hereditary Graph Properties. SIAM J. Discret. Math. 30 (2) (2016)
Konrad Kazimierz Dabrowski, Vadim V. Lozin, Dominique de Werra, Victor Zamaraev
Combinatorics and Algorithms for Augmenting Graphs. Graphs Comb. 32 (4) (2016)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
A Boundary Property for Upper Domination. IWOCA (2016)
Vadim V. Lozin, Raffaele Mosca, Victor Zamaraev
Independent Domination versus Weighted Independent Domination. CoRR (2016)
Konrad Kazimierz Dabrowski, Vadim V. Lozin, Daniël Paulusma
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. CoRR (2016)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. IWOCA (2016)
Aistis Atminas, Andrew Collins, Vadim V. Lozin, Victor Zamaraev
Implicit representations and factorial properties of graphs. Discret. Math. 338 (2) (2015)
Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. Electron. J. Comb. 22 (2) (2015)
Vadim V. Lozin, Jérôme Monnot, Bernard Ries
On the maximum independent set problem in subclasses of subcubic graphs. J. Discrete Algorithms 31 (2015)
Konrad K. Dabrowski, Vadim V. Lozin, Juraj Stacho
Stable-iΠ partitions of graphs. Discret. Appl. Math. 182 (2015)
Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho
Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. CoRR (2015)
Aistis Atminas, Vadim V. Lozin
Labelled Induced Subgraphs and Well-Quasi-Ordering. Order 32 (3) (2015)
Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra
Dominating induced matchings in graphs containing no long claw. CoRR (2015)
Vadim V. Lozin, Victor Zamaraev
Boundary Properties of Factorial Classes of Graphs. J. Graph Theory 78 (3) (2015)
Vadim V. Lozin, Igor Razgon, Victor Zamaraev
Well-quasi-ordering Does Not Imply Bounded Clique-width. WG (2015)
Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discret. Appl. Math. 182 (2015)
Vadim V. Lozin, Igor Razgon, Victor Zamaraev
Well-quasi-ordering does not imply bounded clique-width. CoRR (2015)
Vadim V. Lozin, Martin Milanic, Christopher Purcell
Graphs Without Large Apples and the Maximum Weight Independent Set Problem. Graphs Comb. 30 (2) (2014)
Nicholas Korpelainen, Vadim V. Lozin, Colin Mayhill
Split Permutation Graphs. Graphs Comb. 30 (3) (2014)
Nicholas Korpelainen, Vadim V. Lozin, Christopher Purcell
Dominating induced matchings in graphs without a skew star. J. Discrete Algorithms 26 (2014)
Konrad K. Dabrowski, Dominique de Werra, Vadim V. Lozin, Victor Zamaraev
Combinatorics and algorithms for augmenting graphs. CoRR (2014)
Vadim V. Lozin, Colin Mayhill, Victor Zamaraev
Corrigendum to "Locally bounded coverings and factorial properties of graphs" [European J. Combin. 33(2012) 534-543]. Eur. J. Comb. 40 (2014)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries
A Dichotomy for Upper Domination in Monogenic Classes. COCOA (2014)
Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). WG (2014)
Vadim V. Lozin, Christopher Purcell
Coloring vertices of claw-free graphs in three colors. J. Comb. Optim. 28 (2) (2014)
Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov
Deciding WQO for Factorial Languages. LATA (2013)
Aistis Atminas, Vadim V. Lozin, Sergey Kitaev, Alexandr Valyuzhenich
Universal graphs and Universal Permutations. Discret. Math. Algorithms Appl. 5 (4) (2013)
Konrad K. Dabrowski, Marc Demange, Vadim V. Lozin
New results on maximum induced matchings in bipartite graphs and beyond. Theor. Comput. Sci. 478 (2013)
Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries
GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discret. Appl. Math. 161 (4-5) (2013)
Vadim V. Lozin, Jérôme Monnot, Bernard Ries
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs. IWOCA (2013)
Vadim V. Lozin, Martin Milanic
Critical properties of graphs of bounded clique-width. Discret. Math. 313 (9) (2013)
Vadim V. Lozin, Christopher Purcell
Boundary properties of the satisfiability problems. Inf. Process. Lett. 113 (9) (2013)
Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
-free graphs. Discret. Optim. 10 (4) (2013)
Nicholas Korpelainen, Vadim V. Lozin, Igor Razgon
Boundary Properties of Well-Quasi-Ordered Sets of Graphs. Order 30 (3) (2013)

Vadim V. Lozin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vadim V. Lozin