On a Generalization of Bi-Complement Reducible Graphs. - Vadim V. Lozin (MFCS, 2000)

Conic reduction of graphs for the stable set problem. - Vadim V. Lozin (Discret. Math., 2000)

Stability in P5- and banner-free graphs. - Vadim V. Lozin (Eur. J. Oper. Res., 2000)

On the Jump Number Problem in Hereditary Classes of Bipartite Graphs. - Vadim V. Lozin; Michael U. Gerber (Order, 2000)

A note on alpha-redundant vertices in graphs. - Andreas Brandstädt; Vadim V. Lozin (Discret. Appl. Math., 2001)

On orthogonal representations of graphs. - Vladimir E. Alekseev; Vadim V. Lozin (Discret. Math., 2001)

An attractive class of bipartite graphs. - Rodica Boliac; Vadim V. Lozin (Discuss. Math. Graph Theory, 2001)

On the Clique-Width of Graphs in Hereditary Classes. - Rodica Boliac; Vadim V. Lozin (ISAAC, 2002)

Bipartite graphs without a skew star. - Vadim V. Lozin (Discret. Math., 2002)

On maximum induced matchings in bipartite graphs. - Vadim V. Lozin (Inf. Process. Lett., 2002)

On the linear structure and clique-width of bipartite permutation graphs. - Andreas Brandstädt; Vadim V. Lozin (Ars Comb., 2003)

Struction revisited. - Gabriela Alexe; Peter L. Hammer; Vadim V. Lozin; Dominique de Werra (Discret. Appl. Math., 2003)

An augmenting graph approach to the stable set problem in P5-free graphs. - Rodica Boliac; Vadim V. Lozin (Discret. Appl. Math., 2003)

Stable sets in two subclasses of banner-free graphs. - Michael U. Gerber; Alain Hertz; Vadim V. Lozin (Discret. Appl. Math., 2003)

On the stable set problem in special P5-free graphs. - Michael U. Gerber; Vadim V. Lozin (Discret. Appl. Math., 2003)

Special issue on stability in graphs and related topics. - Vadim V. Lozin; Dominique de Werra (Discret. Appl. Math., 2003)

Independent sets of maximum weight in (p, q)-colorable graphs. - Vladimir E. Alekseev; Vadim V. Lozin (Discret. Math., 2003)

Robust Algorithms for the Stable Set Problem. - Michael U. Gerber; Vadim V. Lozin (Graphs Comb., 2003)

Finding augmenting chains in extensions of claw-free graphs. - Alain Hertz; Vadim V. Lozin; David Schindl (Inf. Process. Lett., 2003)

Some results on graphs without long induced paths. - Vadim V. Lozin; Dieter Rautenbach (Inf. Process. Lett., 2003)

The 3-Colorability Problem on Graphs with Maximum Degree Four. - Martin Kochol; Vadim V. Lozin; Bert Randerath (SIAM J. Comput., 2003)

Independent domination in finitely defined classes of graphs. - Rodica Boliac; Vadim V. Lozin (Theor. Comput. Sci., 2003)

On computing the dissociation number and the induced matching number of bipartite graphs. - Rodica Boliac; Kathie Cameron; Vadim V. Lozin (Ars Comb., 2004)

Local transformations of graphs preserving independence number. - Vladimir E. Alekseev; Vadim V. Lozin (Discret. Appl. Math., 2004)

Augmenting graphs for independent sets. - Vladimir E. Alekseev; Vadim V. Lozin (Discret. Appl. Math., 2004)

Boundary classes of graphs for the dominating set problem. - Vladimir E. Alekseev; Dmitry V. Korobitsyn; Vadim V. Lozin (Discret. Math., 2004)

Chordal bipartite graphs of bounded tree- and clique-width. - Vadim V. Lozin; Dieter Rautenbach (Discret. Math., 2004)

New Results on Generalized Graph Coloring. - Vladimir E. Alekseev; Alastair Farrugia; Vadim V. Lozin (Discret. Math. Theor. Comput. Sci., 2004)

On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. - Vadim V. Lozin; Dieter Rautenbach (SIAM J. Discret. Math., 2004)

Clique-Width for Four-Vertex Forbidden Subgraphs. - Andreas Brandstädt; Joost Engelfriet; Hoàng-Oanh Le; Vadim V. Lozin (FCT, 2005)

Independent sets in extensions of 2K2-free graphs. - Vadim V. Lozin; Raffaele Mosca (Discret. Appl. Math., 2005)

Bisplit graphs. - Andreas Brandstädt; Peter L. Hammer; Van Bang Le; Vadim V. Lozin (Discret. Math., 2005)

Graphs of low chordality. - L. Sunil Chandran; Vadim V. Lozin; C. R. Subramanian 001 (Discret. Math. Theor. Comput. Sci., 2005)

Between 2- and 3-colorability. - Vadim V. Lozin (Inf. Process. Lett., 2005)

The tree- and clique-width of bipartite graphs in special classes. - Vadim V. Lozin; Dieter Rautenbach (Australas. J Comb., 2006)

Polynomial-time algorithm for vertex k-colorability of P_5-free graphs - Marcin Kaminski 001; Vadim V. Lozin (CoRR, 2006)

Polar graphs and maximal independent sets. - Vadim V. Lozin; Raffaele Mosca (Discret. Math., 2006)

Augmenting chains in graphs without a skew star. - Michael U. Gerber; Alain Hertz; Vadim V. Lozin (J. Comb. Theory B, 2006)

Clique-Width for 4-Vertex Forbidden Subgraphs. - Andreas Brandstädt; Joost Engelfriet; Hoàng-Oanh Le; Vadim V. Lozin (Theory Comput. Syst., 2006)

On the maximum independent set problem in subclasses of planar and more general graphs. - Vadim V. Lozin; Martin Milanic (CTW, 2007)

Maximum independent sets in graphs of low degree. - Vadim V. Lozin; Martin Milanic (SODA, 2007)

Tree-Width and Optimization in Bounded Degree Graphs. - Vadim V. Lozin; Martin Milanic (WG, 2007)

Vertex 3-colorability of Claw-free Graphs. - Marcin Kaminski 001; Vadim V. Lozin (Algorithmic Oper. Res., 2007)

Minimal Universal Bipartite Graphs. - Vadim V. Lozin; Gábor Rudolf (Ars Comb., 2007)

Coloring edges and vertices of graphs without short or long cycles. - Vadim V. Lozin; Marcin Kaminski 001 (Contributions Discret. Math., 2007)

Deciding k-colourability of P_5-free graphs in polynomial time - Chính T. Hoàng; Marcin Kaminski 001; Vadim V. Lozin; Joe Sawada; Xiao Shu (CoRR, 2007)

Maximum k -regular induced subgraphs. - Domingos Moreira Cardoso; Marcin Kaminski 001; Vadim V. Lozin (J. Comb. Optim., 2007)

The relative clique-width of a graph. - Vadim V. Lozin; Dieter Rautenbach (J. Comb. Theory B, 2007)

NP-hard graph problems and boundary classes of graphs. - Vladimir E. Alekseev; Rodica Boliac; Dmitry V. Korobitsyn; Vadim V. Lozin (Theor. Comput. Sci., 2007)

Independent Sets of Maximum Weight in Apple-Free Graphs. - Andreas Brandstädt; Tilo Klembt; Vadim V. Lozin; Raffaele Mosca (ISAAC, 2008)

From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. - Vadim V. Lozin (ISAAC, 2008)

The Maximum Independent Set Problem in Planar Graphs. - Vladimir E. Alekseev; Vadim V. Lozin; Dmitriy S. Malyshev; Martin Milanic (MFCS, 2008)

A Note on k-Colorability of P5-Free Graphs. - Chính T. Hoàng; Marcin Kaminski 001; Vadim V. Lozin; Joe Sawada; Xiao Shu (MFCS, 2008)

Boundary Classes of Planar Graphs. - Vadim V. Lozin (Comb. Probab. Comput., 2008)

On finding augmenting graphs. - Vadim V. Lozin; Martin Milanic (Discret. Appl. Math., 2008)

The Clique-Width of Bipartite Graphs in Monogenic Classes. - Vadim V. Lozin; Jordan Volz (Int. J. Found. Comput. Sci., 2008)

Graph Representation Functions Computable by Finite Automata. - Vadim V. Lozin (J. Autom. Lang. Comb., 2008)

A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. - Vadim V. Lozin; Martin Milanic (J. Discrete Algorithms, 2008)

Dominating Induced Matchings. - Domingos Moreira Cardoso; Vadim V. Lozin (Graph Theory, Computational Intelligence and Thought, 2009)

A Note on the Parameterized Complexity of the Maximum Independent Set Problem. - Vadim V. Lozin (CTW, 2009)

Bipartite Graphs of Large Clique-Width. - Nicholas Korpelainen; Vadim V. Lozin (IWOCA, 2009)

Clique-Width and the Speed of Hereditary Properties. - Peter Allen 001; Vadim V. Lozin; Michaël Rao (Electron. J. Comb., 2009)

Recent developments on graphs of bounded clique-width. - Marcin Kaminski 001; Vadim V. Lozin; Martin Milanic (Discret. Appl. Math., 2009)

DIMAP Workshop on Algorithmic Graph Theory. - Arie M. C. A. Koster; Vadim V. Lozin (Electron. Notes Discret. Math., 2009)

Parameterized complexity of the maximum independent set problem and the speed of hereditary properties. - Vadim V. Lozin (Electron. Notes Discret. Math., 2009)

Maximum independent sets in subclasses of P5-free graphs. - Vadim V. Lozin; Raffaele Mosca (Inf. Process. Lett., 2009)

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. - Konrad K. Dabrowski; Vadim V. Lozin; Haiko Müller; Dieter Rautenbach (IWOCA, 2010)

Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. - Nicholas Korpelainen; Vadim V. Lozin; Alexander Tiskin (TAMC, 2010)

Colouring Vertices of Triangle-Free Graphs. - Konrad K. Dabrowski; Vadim V. Lozin; Rajiv Raman 001; Bernard Ries (WG, 2010)

On Independent Vertex Sets in Subclasses of Apple-Free Graphs. - Andreas Brandstädt; Tilo Klembt; Vadim V. Lozin; Raffaele Mosca (Algorithmica, 2010)

Deciding k-Colorability of P5-Free Graphs in Polynomial Time. - Chính T. Hoàng; Marcin Kaminski 001; Vadim V. Lozin; Joe Sawada; Xiao Shu (Algorithmica, 2010)

On the Maximum Independent Set Problem in Subclasses of Planar Graphs. - Vadim V. Lozin; Martin Milanic (J. Graph Algorithms Appl., 2010)

Independent Sets of Maximum Weight in Apple-Free Graphs. - Andreas Brandstädt; Vadim V. Lozin; Raffaele Mosca (SIAM J. Discret. Math., 2010)

A decidability result for the dominating set problem. - Vadim V. Lozin (Theor. Comput. Sci., 2010)

Stability preserving transformations of graphs. - Vadim V. Lozin (Ann. Oper. Res., 2011)

A Note on the Speed of Hereditary Graph Properties. - Vadim V. Lozin; Colin Mayhill; Victor Zamaraev (Electron. J. Comb., 2011)

On the complexity of the dominating induced matching problem in hereditary classes of graphs. - Domingos Moreira Cardoso; Nicholas Korpelainen; Vadim V. Lozin (Discret. Appl. Math., 2011)

Two forbidden induced subgraphs and well-quasi-ordering. - Nicholas Korpelainen; Vadim V. Lozin (Discret. Math., 2011)

Bipartite induced subgraphs and well-quasi-ordering. - Nicholas Korpelainen; Vadim V. Lozin (J. Graph Theory, 2011)

Canonical Antichains of Unit Interval and Bipartite Permutation Graphs. - Vadim V. Lozin; Colin Mayhill (Order, 2011)

Boundary properties of graphs for algorithmic graph problems. - Nicholas Korpelainen; Vadim V. Lozin; Dmitriy S. Malyshev; Alexander Tiskin (Theor. Comput. Sci., 2011)

Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. - Aistis Atminas; Vadim V. Lozin; Igor Razgon (SWAT, 2012)

Colouring vertices of triangle-free graphs without forests. - Konrad K. Dabrowski; Vadim V. Lozin; Rajiv Raman 001; Bernard Ries (Discret. Math., 2012)

On factorial properties of chordal bipartite graphs. - Konrad K. Dabrowski; Vadim V. Lozin; Victor Zamaraev (Discret. Math., 2012)

Locally bounded coverings and factorial properties of graphs. - Vadim V. Lozin; Colin Mayhill; Victor Zamaraev (Eur. J. Comb., 2012)

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. - Konrad K. Dabrowski; Vadim V. Lozin; Haiko Müller; Dieter Rautenbach (J. Discrete Algorithms, 2012)

Maximum regular induced subgraphs in 2 P3-free graphs. - Vadim V. Lozin; Raffaele Mosca (Theor. Comput. Sci., 2012)

Deciding WQO for Factorial Languages. - Aistis Atminas; Vadim V. Lozin; Mikhail Moshkov (LATA, 2013)

GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. - Marc Demange; Vadim V. Lozin; Christophe Picouleau; Bernard Ries (Discret. Appl. Math., 2013)

Sparse regular induced subgraphs in 2P3-free graphs. - Vadim V. Lozin; Raffaele Mosca; Christopher Purcell (Discret. Optim., 2013)

Critical properties of graphs of bounded clique-width. - Vadim V. Lozin; Martin Milanic (Discret. Math., 2013)

Universal graphs and Universal Permutations. - Aistis Atminas; Vadim V. Lozin; Sergey Kitaev; Alexandr Valyuzhenich (Discret. Math. Algorithms Appl., 2013)

Boundary properties of the satisfiability problems. - Vadim V. Lozin; Christopher Purcell (Inf. Process. Lett., 2013)

Boundary Properties of Well-Quasi-Ordered Sets of Graphs. - Nicholas Korpelainen; Vadim V. Lozin; Igor Razgon (Order, 2013)

New results on maximum induced matchings in bipartite graphs and beyond. - Konrad K. Dabrowski; Marc Demange; Vadim V. Lozin (Theor. Comput. Sci., 2013)

Three Approaches to Data Analysis - Test Theory, Rough Sets and Logical Analysis of Data - Igor Chikalov; Vadim V. Lozin; Irina Lozina; Mikhail Moshkov; Hung Son Nguyen; Andrzej Skowron; Beata Zielosko (Springer, 2013)

A Dichotomy for Upper Domination in Monogenic Classes. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries (COCOA, 2014)

Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). - Aistis Atminas; Andrew Collins 004; Jan Foniok; Vadim V. Lozin (WG, 2014)

Corrigendum to "Locally bounded coverings and factorial properties of graphs" [European J. Combin. 33(2012) 534-543]. - Vadim V. Lozin; Colin Mayhill; Victor Zamaraev (Eur. J. Comb., 2014)

Split Permutation Graphs. - Nicholas Korpelainen; Vadim V. Lozin; Colin Mayhill (Graphs Comb., 2014)

Graphs Without Large Apples and the Maximum Weight Independent Set Problem. - Vadim V. Lozin; Martin Milanic; Christopher Purcell (Graphs Comb., 2014)

Coloring vertices of claw-free graphs in three colors. - Vadim V. Lozin; Christopher Purcell (J. Comb. Optim., 2014)

Dominating induced matchings in graphs without a skew star. - Nicholas Korpelainen; Vadim V. Lozin; Christopher Purcell (J. Discrete Algorithms, 2014)

Well-quasi-ordering Does Not Imply Bounded Clique-width. - Vadim V. Lozin; Igor Razgon; Victor Zamaraev (WG, 2015)

Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. - Aistis Atminas; Robert Brignall; Nicholas Korpelainen; Vadim V. Lozin; Vincent Vatter (Electron. J. Comb., 2015)

Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. - Aistis Atminas; Robert Brignall; Vadim V. Lozin; Juraj Stacho (CoRR, 2015)

Stable-iΠ partitions of graphs. - Konrad K. Dabrowski; Vadim V. Lozin; Juraj Stacho (Discret. Appl. Math., 2015)

Independent domination in finitely defined classes of graphs: Polynomial algorithms. - Vadim V. Lozin; Raffaele Mosca; Christopher Purcell (Discret. Appl. Math., 2015)

Implicit representations and factorial properties of graphs. - Aistis Atminas; Andrew Collins 004; Vadim V. Lozin; Victor Zamaraev (Discret. Math., 2015)

On the maximum independent set problem in subclasses of subcubic graphs. - Vadim V. Lozin; Jérôme Monnot; Bernard Ries (J. Discrete Algorithms, 2015)

Boundary Properties of Factorial Classes of Graphs. - Vadim V. Lozin; Victor Zamaraev (J. Graph Theory, 2015)

Labelled Induced Subgraphs and Well-Quasi-Ordering. - Aistis Atminas; Vadim V. Lozin (Order, 2015)

Words and Graphs - Sergey Kitaev; Vadim V. Lozin (Springer, 2015)

A Boundary Property for Upper Domination. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries; Victor Zamaraev (IWOCA, 2016)

Independent Domination versus Weighted Independent Domination. - Vadim V. Lozin; Raffaele Mosca; Victor Zamaraev (CoRR, 2016)

Bichain graphs: Geometric model and universal graphs. - Robert Brignall; Vadim V. Lozin; Juraj Stacho (Discret. Appl. Math., 2016)

Efficient domination through eigenvalues. - Domingos M. Cardoso; Vadim V. Lozin; Carlos J. Luz; Maria F. Pacheco (Discret. Appl. Math., 2016)

Combinatorics and Algorithms for Augmenting Graphs. - Konrad Kazimierz Dabrowski; Vadim V. Lozin; Dominique de Werra; Victor Zamaraev (Graphs Comb., 2016)

Deciding the Bell Number for Hereditary Graph Properties. - Aistis Atminas; Andrew Collins 004; Jan Foniok; Vadim V. Lozin (SIAM J. Discret. Math., 2016)

Specifying a positive threshold function via extremal points. - Vadim V. Lozin; Igor Razgon; Viktor Zamaraev; Elena Zamaraeva; Nikolai Yu. Zolotykh (ALT, 2017)

Graph Parameters and Ramsey Theory. - Vadim V. Lozin (IWOCA, 2017)

New Results on Weighted Independent Domination. - Vadim V. Lozin; Dmitriy S. Malyshev; Raffaele Mosca; Viktor Zamaraev (WG, 2017)

New results on word-representable graphs. - Andrew Collins 004; Sergey Kitaev; Vadim V. Lozin (Discret. Appl. Math., 2017)

From matchings to independent sets. - Vadim V. Lozin (Discret. Appl. Math., 2017)

Vertex coloring of graphs with few obstructions. - Vadim V. Lozin; Dmitriy S. Malyshev (Discret. Appl. Math., 2017)

The structure and the number of P7-free bipartite graphs. - Vadim V. Lozin; Victor Zamaraev (Electron. Notes Discret. Math., 2017)

WQO is decidable for factorial languages. - Aistis Atminas; Vadim V. Lozin; Mikhail Moshkov (Inf. Comput., 2017)

More results on weighted independent domination. - Vadim V. Lozin; Dmitriy S. Malyshev; Raffaele Mosca; Viktor Zamaraev (Theor. Comput. Sci., 2017)

Linear Clique-Width of Bi-complement Reducible Graphs. - Bogdan Alecu; Vadim V. Lozin; Viktor Zamaraev (IWOCA, 2018)

Linear Ramsey Numbers. - Aistis Atminas; Vadim V. Lozin; Viktor Zamaraev (IWOCA, 2018)

Upper Domination: Towards a Dichotomy Through Boundary Properties. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries; Viktor Zamaraev (Algorithmica, 2018)

Perfect edge domination: hard and solvable cases. - Min Chih Lin; Vadim V. Lozin; Veronica A. Moyano; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2018)

Infinitely many minimal classes of graphs of unbounded clique-width. - Andrew Collins 004; Jan Foniok; Nicholas Korpelainen; Vadim V. Lozin; Victor Zamaraev (Discret. Appl. Math., 2018)

Linear read-once and related Boolean functions. - Vadim V. Lozin; Igor Razgon; Viktor Zamaraev; Elena Zamaraeva; Nikolai Yu. Zolotykh (Discret. Appl. Math., 2018)

Well-quasi-ordering versus clique-width. - Vadim V. Lozin; Igor Razgon; Viktor Zamaraev (J. Comb. Theory B, 2018)

Dominating induced matchings in graphs containing no long claw. - Alain Hertz; Vadim V. Lozin; Bernard Ries; Viktor Zamaraev; Dominique de Werra (J. Graph Theory, 2018)

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. - Konrad K. Dabrowski; Vadim V. Lozin; Daniël Paulusma (Order, 2018)

From Words to Graphs, and Back. - Vadim V. Lozin (LATA, 2019)

Recent advances in the theory and practice of Logical Analysis of Data. - Miguel A. Lejeune; Vadim V. Lozin; Irina Lozina; Ahmed Ragab; Soumaya Yacout (Eur. J. Oper. Res., 2019)

Letter graphs and geometric grid classes of permutations: Characterization and recognition. - Bogdan Alecu; Vadim V. Lozin; Dominique de Werra; Viktor Zamaraev (Discret. Appl. Math., 2020)

Between clique-width and linear clique-width of bipartite graphs. - Bogdan Alecu; Mamadou Moustapha Kanté; Vadim V. Lozin; Viktor Zamaraev (Discret. Math., 2020)

Independent domination versus weighted independent domination. - Vadim V. Lozin; Dmitriy S. Malyshev; Raffaele Mosca; Viktor Zamaraev (Inf. Process. Lett., 2020)

Clique-width and well-quasi-ordering of triangle-free graph classes. - Konrad K. Dabrowski; Vadim V. Lozin; Daniël Paulusma (J. Comput. Syst. Sci., 2020)

Clique-Width for Graph Classes Closed under Complementation. - Alexandre Blanché; Konrad K. Dabrowski; Matthew Johnson 002; Vadim V. Lozin; Daniël Paulusma; Viktor Zamaraev (SIAM J. Discret. Math., 2020)

Maximum independent sets in subcubic graphs: New results. - Ararat Harutyunyan; Michael Lampis; Vadim V. Lozin; Jérôme Monnot (Theor. Comput. Sci., 2020)

Critical Properties and Complexity Measures of Read-Once Boolean Functions. - Vadim V. Lozin; Mikhail Moshkov (Ann. Math. Artif. Intell., 2021)

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. - Aistis Atminas; Robert Brignall; Vadim V. Lozin; Juraj Stacho (Discret. Appl. Math., 2021)

Graph classes with linear Ramsey numbers. - Bogdan Alecu; Aistis Atminas; Vadim V. Lozin; Viktor Zamaraev (Discret. Math., 2021)

Graph functionality. - Bogdan Alecu; Aistis Atminas; Vadim V. Lozin (J. Comb. Theory B, 2021)

The micro-world of cographs. - Bogdan Alecu; Vadim V. Lozin; Dominique de Werra (Discret. Appl. Math., 2022)

Tree-width dichotomy. - Vadim V. Lozin; Igor Razgon (Eur. J. Comb., 2022)

On Boolean threshold functions with minimum specification number. - Vadim V. Lozin; Viktor Zamaraev; Elena Zamaraeva; Nikolai Yu. Zolotykh (Inf. Comput., 2022)

Letter Graphs and Geometric Grid Classes of Permutations. - Bogdan Alecu; Robert Ferguson; Mamadou Moustapha Kanté; Vadim V. Lozin; Vincent Vatter; Victor Zamaraev (SIAM J. Discret. Math., 2022)

Functionality of box intersection graphs. - Clément Dallard; Vadim V. Lozin; Martin Milanic; Kenny Storgel; Viktor Zamaraev (CoRR, 2023)

Hereditary classes of graphs: A parametric approach. - Vadim V. Lozin (Discret. Appl. Math., 2023)

Graph parameters, implicit representations and factorial properties. - Bogdan Alecu; Vladimir E. Alekseev; Aistis Atminas; Vadim V. Lozin; Victor Zamaraev (Discret. Math., 2023)

Combinatorics and Algorithms for Quasi-Chain Graphs. - Bogdan Alecu; Aistis Atminas; Vadim V. Lozin; Dmitriy S. Malyshev (Algorithmica, 2023)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. - Vadim V. Lozin; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Mark H. Siggers; Siani Smith; Erik Jan van Leeuwen (ISAAC, 2024)

The Hamiltonian Cycle Problem and Monotone Classes. - Vadim V. Lozin (IWOCA, 2024)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. - Bogdan Alecu; Mamadou Moustapha Kanté; Vadim V. Lozin; Viktor Zamaraev (CoRR, 2024)

Deciding atomicity of subword-closed languages. - Aistis Atminas; Vadim V. Lozin (Theor. Comput. Sci., 2024)

Critical properties of bipartite permutation graphs. - Bogdan Alecu; Vadim V. Lozin; Dmitriy S. Malyshev (J. Graph Theory, 2024)

Union-closed sets and Horn Boolean functions. - Vadim V. Lozin; Viktor Zamaraev (J. Comb. Theory A, 2024)

The Treewidth and Pathwidth of Graph Unions. - Bogdan Alecu; Vadim V. Lozin; Daniel A. Quiroz; Roman Rabinovich 001; Igor Razgon; Viktor Zamaraev (SIAM J. Discret. Math., 2024)

Ramsey Numbers and Graph Parameters. - Vadim V. Lozin (Graphs Comb., 2024)

Monotone Classes, Even Graphs and the Hamiltonian Cycle Problem. - Vadim V. Lozin (IWOCA, 2025)

Vector Spaces of Graphs Closed Under Isomorphism. - Vadim V. Lozin; D. V. Zakharova (IWOCA, 2025)

Independent sets of maximum weight beyond claw-free graphs and related problems. - Andreas Brandstädt; Vadim V. Lozin; Raffaele Mosca (Theor. Comput. Sci., 2025)