| 2026 | WG | Cycles in Unions of Transitive Tournaments. | Bogdan Alecu, Pedro Bureo Villafana, Vadim V. Lozin |
| 2026 | WG | Graph Classes Closed Under Self-Intersection. | Konrad K. Dabrowski, Vadim V. Lozin, Martin Milanic, Andrea Munaro, Danil Paulusma, Viktor Zamaraev |
| 2025 | IWOCA | Monotone Classes, Even Graphs and the Hamiltonian Cycle Problem. | Vadim V. Lozin |
| 2025 | IWOCA | Vector Spaces of Graphs Closed Under Isomorphism. | Vadim V. Lozin, D. V. Zakharova |
| 2024 | ISAAC | Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. | Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Danil Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen |
| 2024 | IWOCA | The Hamiltonian Cycle Problem and Monotone Classes. | Vadim V. Lozin |
| 2022 | DLT | Deciding Atomicity of Subword-Closed Languages. | Aistis Atminas, Vadim V. Lozin |
| 2022 | IWOCA | Graph Parameters, Implicit Representations and Factorial Properties. | Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev |
| 2021 | IWOCA | Combinatorics and Algorithms for Quasi-chain Graphs. | Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev |
| 2020 | IWOCA | The Micro-world of Cographs. | Bogdan Alecu, Vadim V. Lozin, Dominique de Werra |
| 2019 | LATA | From Words to Graphs, and Back. | Vadim V. Lozin |
| 2019 | WG | Graph Functionality. | Bogdan Alecu, Aistis Atminas, Vadim V. Lozin |
| 2019 | WG | Maximum Independent Sets in Subcubic Graphs: New Results. | Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jrme Monnot |
| 2018 | IWOCA | Linear Clique-Width of Bi-complement Reducible Graphs. | Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev |
| 2018 | IWOCA | Linear Ramsey Numbers. | Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev |
| 2017 | ALT | Specifying a positive threshold function via extremal points. | Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh |
| 2017 | IWOCA | Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. | Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra |
| 2017 | IWOCA | Graph Parameters and Ramsey Theory. | Vadim V. Lozin |
| 2017 | MFCS | Clique-Width for Graph Classes Closed under Complementation. | Alexandre Blanch, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Danil Paulusma, Viktor Zamaraev |
| 2017 | WG | Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. | Konrad K. Dabrowski, Vadim V. Lozin, Danil Paulusma |
| 2017 | WG | New Results on Weighted Independent Domination. | Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev |
| 2016 | IWOCA | A Boundary Property for Upper Domination. | Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jrme Monnot, Bernard Ries, Victor Zamaraev |
| 2016 | IWOCA | Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. | Konrad K. Dabrowski, Vadim V. Lozin, Danil Paulusma |
| 2015 | WG | Well-quasi-ordering Does Not Imply Bounded Clique-width. | Vadim V. Lozin, Igor Razgon, Victor Zamaraev |
| 2014 | COCOA | A Dichotomy for Upper Domination in Monogenic Classes. | Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jrme Monnot, Bernard Ries |
| 2014 | WG | Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). | Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin |
| 2013 | IWOCA | On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs. | Vadim V. Lozin, Jrme Monnot, Bernard Ries |
| 2013 | LATA | Deciding WQO for Factorial Languages. | Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov |
| 2010 | IWOCA | Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. | Konrad K. Dabrowski, Vadim V. Lozin, Haiko Mller, Dieter Rautenbach |
| 2010 | TAMC | Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. | Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin |
| 2010 | WG | Colouring Vertices of Triangle-Free Graphs. | Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries |
| 2009 | IWOCA | Bipartite Graphs of Large Clique-Width. | Nicholas Korpelainen, Vadim V. Lozin |
| 2008 | ISAAC | Independent Sets of Maximum Weight in Apple-Free Graphs. | Andreas Brandstdt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca |
| 2008 | ISAAC | From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. | Vadim V. Lozin |
| 2008 | MFCS | The Maximum Independent Set Problem in Planar Graphs. | Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic |
| 2008 | MFCS | A Note on k-Colorability of P5-Free Graphs. | Chnh T. Hong, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu |
| 2007 | SODA | Maximum independent sets in graphs of low degree. | Vadim V. Lozin, Martin Milanic |
| 2007 | WG | Tree-Width and Optimization in Bounded Degree Graphs. | Vadim V. Lozin, Martin Milanic |
| 2006 | SODA | A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. | Vadim V. Lozin, Martin Milanic |
| 2005 | FCT | Clique-Width for Four-Vertex Forbidden Subgraphs. | Andreas Brandstdt, Joost Engelfriet, Hong-Oanh Le, Vadim V. Lozin |
| 2002 | ISAAC | On the Clique-Width of Graphs in Hereditary Classes. | Rodica Boliac, Vadim V. Lozin |
| 2000 | MFCS | On a Generalization of Bi-Complement Reducible Graphs. | Vadim V. Lozin |