Vadim V. Lozin

203 papers A* 2B 18C 22Journal 156Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Graph problems and monotone classes. Discret. Appl. Math. Vadim V. Lozin
2026	J	`jnl`	Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. Algorithmica Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
2025	J	`jnl`	Awesome graph parameters. CoRR Kenny Storgel, Clément Dallard, Vadim V. Lozin, Martin Milanic, Viktor Zamaraev
2025	J	`jnl`	Graph Classes Closed under Self-intersection. CoRR Konrad K. Dabrowski, Vadim V. Lozin, Martin Milanic, Andrea Munaro, Daniël Paulusma, Viktor Zamaraev
2025	J	`jnl`	Independent sets of maximum weight beyond claw-free graphs and related problems. Theor. Comput. Sci. Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca
2025	C	`conf`	Monotone Classes, Even Graphs and the Hamiltonian Cycle Problem. IWOCA Vadim V. Lozin
2025	C	`conf`	Vector Spaces of Graphs Closed Under Isomorphism. IWOCA Vadim V. Lozin, D. V. Zakharova
2024	B	`conf`	Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. ISAAC Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen
2024	J	`jnl`	Critical properties of bipartite permutation graphs. J. Graph Theory Bogdan Alecu, Vadim V. Lozin, Dmitriy S. Malyshev
2024	J	`jnl`	Deciding atomicity of subword-closed languages. Theor. Comput. Sci. Aistis Atminas, Vadim V. Lozin
2024	J	`jnl`	Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. CoRR Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
2024	J	`jnl`	Ramsey Numbers and Graph Parameters. Graphs Comb. Vadim V. Lozin
2024	C	`conf`	The Hamiltonian Cycle Problem and Monotone Classes. IWOCA Vadim V. Lozin
2024	J	`jnl`	The Treewidth and Pathwidth of Graph Unions. SIAM J. Discret. Math. Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
2024	J	`jnl`	Union-closed sets and Horn Boolean functions. J. Comb. Theory A Vadim V. Lozin, Viktor Zamaraev
2023	J	`jnl`	Combinatorics and Algorithms for Quasi-Chain Graphs. Algorithmica Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev
2023	J	`jnl`	Functionality of box intersection graphs. CoRR Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev
2023	J	`jnl`	Graph parameters, implicit representations and factorial properties. CoRR Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
2023	J	`jnl`	Graph parameters, implicit representations and factorial properties. Discret. Math. Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Victor Zamaraev
2023	J	`jnl`	Hereditary classes of graphs: A parametric approach. Discret. Appl. Math. Vadim V. Lozin
2022	C	`conf`	Deciding Atomicity of Subword-Closed Languages. DLT Aistis Atminas, Vadim V. Lozin
2022	C	`conf`	Graph Parameters, Implicit Representations and Factorial Properties. IWOCA Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
2022	J	`jnl`	Letter Graphs and Geometric Grid Classes of Permutations. SIAM J. Discret. Math. Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev
2022	J	`jnl`	On Boolean threshold functions with minimum specification number. Inf. Comput. Vadim V. Lozin, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
2022	J	`jnl`	The micro-world of cographs. Discret. Appl. Math. Bogdan Alecu, Vadim V. Lozin, Dominique de Werra
2022	J	`jnl`	The treewidth and pathwidth of graph unions. CoRR Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
2022	J	`jnl`	Tree-width dichotomy. Eur. J. Comb. Vadim V. Lozin, Igor Razgon
2021	C	`conf`	Combinatorics and Algorithms for Quasi-chain Graphs. IWOCA Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev
2021	J	`jnl`	Critical Properties and Complexity Measures of Read-Once Boolean Functions. Ann. Math. Artif. Intell. Vadim V. Lozin, Mikhail Moshkov
2021	J	`jnl`	Graph classes with linear Ramsey numbers. Discret. Math. Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
2021	J	`jnl`	Graph functionality. J. Comb. Theory B Bogdan Alecu, Aistis Atminas, Vadim V. Lozin
2021	J	`jnl`	Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. Discret. Appl. Math. Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho
2020	J	`jnl`	Between clique-width and linear clique-width of bipartite graphs. Discret. Math. Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
2020	J	`jnl`	Clique-Width for Graph Classes Closed under Complementation. SIAM J. Discret. Math. Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
2020	J	`jnl`	Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci. Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
2020	J	`jnl`	Independent domination versus weighted independent domination. Inf. Process. Lett. Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
2020	J	`jnl`	Letter graphs and geometric grid classes of permutations: Characterization and recognition. Discret. Appl. Math. Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev
2020	J	`jnl`	Maximum independent sets in subcubic graphs: New results. Theor. Comput. Sci. Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2020	C	`conf`	The Micro-world of Cographs. IWOCA Bogdan Alecu, Vadim V. Lozin, Dominique de Werra
2020	J	`jnl`	Tree-width dichotomy. CoRR Vadim V. Lozin, Igor Razgon
2019	C	`conf`	From Words to Graphs, and Back. LATA Vadim V. Lozin
2019	B	`conf`	Graph Functionality. WG Bogdan Alecu, Aistis Atminas, Vadim V. Lozin
2019	B	`conf`	Maximum Independent Sets in Subcubic Graphs: New Results. WG Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2019	J	`jnl`	Recent advances in the theory and practice of Logical Analysis of Data. Eur. J. Oper. Res. Miguel A. Lejeune, Vadim V. Lozin, Irina Lozina, Ahmed Ragab, Soumaya Yacout
2018	J	`jnl`	Dominating induced matchings in graphs containing no long claw. J. Graph Theory Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra
2018	J	`jnl`	Infinitely many minimal classes of graphs of unbounded clique-width. Discret. Appl. Math. Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev
2018	J	`jnl`	Letter graphs and geometric grid classes of permutations: characterization and recognition. CoRR Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev
2018	C	`conf`	Linear Clique-Width of Bi-complement Reducible Graphs. IWOCA Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev
2018	C	`conf`	Linear Ramsey Numbers. IWOCA Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
2018	J	`jnl`	Linear read-once and related Boolean functions. CoRR Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
2018	J	`jnl`	Linear read-once and related Boolean functions. Discret. Appl. Math. Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
2018	J	`jnl`	Maximum Independent Sets in Subcubic Graphs: New Results. CoRR Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2018	J	`jnl`	Perfect edge domination: hard and solvable cases. Ann. Oper. Res. Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter
2018	J	`jnl`	Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev
2018	J	`jnl`	Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Order Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
2018	J	`jnl`	Well-quasi-ordering versus clique-width. J. Comb. Theory B Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
2017	B	`conf`	Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. WG Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
2017	B	`conf`	Clique-Width for Graph Classes Closed under Complementation. MFCS Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
2017	J	`jnl`	Clique-Width for Graph Classes Closed under Complementation. CoRR Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev
2017	J	`jnl`	Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes. CoRR Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
2017	J	`jnl`	From matchings to independent sets. Discret. Appl. Math. Vadim V. Lozin
2017	C	`conf`	Graph Parameters and Ramsey Theory. IWOCA Vadim V. Lozin
2017	J	`jnl`	Infinitely many minimal classes of graphs of unbounded clique-width. CoRR Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev
2017	C	`conf`	Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. IWOCA Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra
2017	J	`jnl`	More results on weighted independent domination. Theor. Comput. Sci. Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
2017	B	`conf`	New Results on Weighted Independent Domination. WG Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
2017	J	`jnl`	New results on word-representable graphs. Discret. Appl. Math. Andrew Collins, Sergey Kitaev, Vadim V. Lozin
2017	J	`jnl`	Perfect Edge Domination: Hard and Solvable Cases. CoRR Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter
2017	B	`conf`	Specifying a positive threshold function via extremal points. ALT Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
2017	J	`jnl`	Specifying a positive threshold function via extremal points. CoRR Vadim V. Lozin, Igor Razgon, Victor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
2017	J	`jnl`	The structure and the number of P Eur. J. Comb. Vadim V. Lozin, Viktor Zamaraev
2017	J	`jnl`	The structure and the number of P Electron. Notes Discret. Math. Vadim V. Lozin, Victor Zamaraev
2017	J	`jnl`	Vertex coloring of graphs with few obstructions. Discret. Appl. Math. Vadim V. Lozin, Dmitriy S. Malyshev
2017	J	`jnl`	WQO is decidable for factorial languages. Inf. Comput. Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov
2016	C	`conf`	A Boundary Property for Upper Domination. IWOCA Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
2016	J	`jnl`	Bichain graphs: Geometric model and universal graphs. Discret. Appl. Math. Robert Brignall, Vadim V. Lozin, Juraj Stacho
2016	J	`jnl`	Combinatorics and Algorithms for Augmenting Graphs. Graphs Comb. Konrad Kazimierz Dabrowski, Vadim V. Lozin, Dominique de Werra, Victor Zamaraev
2016	J	`jnl`	Deciding the Bell Number for Hereditary Graph Properties. SIAM J. Discret. Math. Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
2016	J	`jnl`	Efficient domination through eigenvalues. Discret. Appl. Math. Domingos M. Cardoso, Vadim V. Lozin, Carlos J. Luz, Maria F. Pacheco
2016	J	`jnl`	Graph Parameters and Ramsey Theory. CoRR Vadim V. Lozin
2016	J	`jnl`	Independent Domination versus Weighted Independent Domination. CoRR Vadim V. Lozin, Raffaele Mosca, Victor Zamaraev
2016	J	`jnl`	Upper Domination: towards a dichotomy through boundary properties. CoRR Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
2016	C	`conf`	Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. IWOCA Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
2016	J	`jnl`	Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. CoRR Konrad Kazimierz Dabrowski, Vadim V. Lozin, Daniël Paulusma
2015	J	`jnl`	Boundary Properties of Factorial Classes of Graphs. J. Graph Theory Vadim V. Lozin, Victor Zamaraev
2015	J	`jnl`	Dominating induced matchings in graphs containing no long claw. CoRR Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra
2015	J	`jnl`	Implicit representations and factorial properties of graphs. Discret. Math. Aistis Atminas, Andrew Collins, Vadim V. Lozin, Victor Zamaraev
2015	J	`jnl`	Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discret. Appl. Math. Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
2015	J	`jnl`	Labelled Induced Subgraphs and Well-Quasi-Ordering. Order Aistis Atminas, Vadim V. Lozin
2015	J	`jnl`	Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. CoRR Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho
2015	J	`jnl`	On the maximum independent set problem in subclasses of subcubic graphs. J. Discrete Algorithms Vadim V. Lozin, Jérôme Monnot, Bernard Ries
2015	J	`jnl`	Stable-iΠ partitions of graphs. Discret. Appl. Math. Konrad K. Dabrowski, Vadim V. Lozin, Juraj Stacho
2015	—	`book`	Surveys in Combinatorics 2015 Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko
2015	J	`jnl`	Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. Electron. J. Comb. Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter
2015	B	`conf`	Well-quasi-ordering Does Not Imply Bounded Clique-width. WG Vadim V. Lozin, Igor Razgon, Victor Zamaraev
2015	J	`jnl`	Well-quasi-ordering does not imply bounded clique-width. CoRR Vadim V. Lozin, Igor Razgon, Victor Zamaraev
2015	—	`book`	Words and Graphs Sergey Kitaev, Vadim V. Lozin
2014	C	`conf`	A Dichotomy for Upper Domination in Monogenic Classes. COCOA Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries
2014	J	`jnl`	Coloring vertices of claw-free graphs in three colors. J. Comb. Optim. Vadim V. Lozin, Christopher Purcell
2014	J	`jnl`	Combinatorics and algorithms for augmenting graphs. CoRR Konrad K. Dabrowski, Dominique de Werra, Vadim V. Lozin, Victor Zamaraev
2014	J	`jnl`	Corrigendum to "Locally bounded coverings and factorial properties of graphs" [European J. Combin. 33(2012) 534-543]. Eur. J. Comb. Vadim V. Lozin, Colin Mayhill, Victor Zamaraev
2014	B	`conf`	Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). WG Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
2014	J	`jnl`	Dominating induced matchings in graphs without a skew star. J. Discrete Algorithms Nicholas Korpelainen, Vadim V. Lozin, Christopher Purcell
2014	J	`jnl`	Graphs Without Large Apples and the Maximum Weight Independent Set Problem. Graphs Comb. Vadim V. Lozin, Martin Milanic, Christopher Purcell
2014	J	`jnl`	Split Permutation Graphs. Graphs Comb. Nicholas Korpelainen, Vadim V. Lozin, Colin Mayhill
2013	J	`jnl`	Boundary Properties of Well-Quasi-Ordered Sets of Graphs. Order Nicholas Korpelainen, Vadim V. Lozin, Igor Razgon
2013	J	`jnl`	Boundary properties of the satisfiability problems. Inf. Process. Lett. Vadim V. Lozin, Christopher Purcell
2013	J	`jnl`	Critical properties of graphs of bounded clique-width. Discret. Math. Vadim V. Lozin, Martin Milanic
2013	C	`conf`	Deciding WQO for Factorial Languages. LATA Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov
2013	J	`jnl`	GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discret. Appl. Math. Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries
2013	J	`jnl`	New results on maximum induced matchings in bipartite graphs and beyond. Theor. Comput. Sci. Konrad K. Dabrowski, Marc Demange, Vadim V. Lozin
2013	C	`conf`	On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs. IWOCA Vadim V. Lozin, Jérôme Monnot, Bernard Ries
2013	J	`jnl`	Sparse regular induced subgraphs in 2P Discret. Optim. Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
2013	—	`book`	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
2013	J	`jnl`	Universal graphs and Universal Permutations. Discret. Math. Algorithms Appl. Aistis Atminas, Vadim V. Lozin, Sergey Kitaev, Alexandr Valyuzhenich
2012	J	`jnl`	Colouring vertices of triangle-free graphs without forests. Discret. Math. Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries
2012	—	`conf`	Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. SWAT Aistis Atminas, Vadim V. Lozin, Igor Razgon
2012	J	`jnl`	Locally bounded coverings and factorial properties of graphs. Eur. J. Comb. Vadim V. Lozin, Colin Mayhill, Victor Zamaraev
2012	J	`jnl`	Maximum regular induced subgraphs in 2 P Theor. Comput. Sci. Vadim V. Lozin, Raffaele Mosca
2012	J	`jnl`	On factorial properties of chordal bipartite graphs. Discret. Math. Konrad K. Dabrowski, Vadim V. Lozin, Victor Zamaraev
2012	J	`jnl`	Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. J. Discrete Algorithms Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach
2011	J	`jnl`	A Note on the Speed of Hereditary Graph Properties. Electron. J. Comb. Vadim V. Lozin, Colin Mayhill, Victor Zamaraev
2011	J	`jnl`	Bipartite induced subgraphs and well-quasi-ordering. J. Graph Theory Nicholas Korpelainen, Vadim V. Lozin
2011	J	`jnl`	Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin
2011	J	`jnl`	Canonical Antichains of Unit Interval and Bipartite Permutation Graphs. Order Vadim V. Lozin, Colin Mayhill
2011	J	`jnl`	On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discret. Appl. Math. Domingos Moreira Cardoso, Nicholas Korpelainen, Vadim V. Lozin
2011	J	`jnl`	Stability preserving transformations of graphs. Ann. Oper. Res. Vadim V. Lozin
2011	J	`jnl`	Two forbidden induced subgraphs and well-quasi-ordering. Discret. Math. Nicholas Korpelainen, Vadim V. Lozin
2010	J	`jnl`	A decidability result for the dominating set problem. Theor. Comput. Sci. Vadim V. Lozin
2010	B	`conf`	Colouring Vertices of Triangle-Free Graphs. WG Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries
2010	J	`jnl`	Deciding Algorithmica Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2010	C	`conf`	Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. TAMC Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin
2010	J	`jnl`	Independent Sets of Maximum Weight in Apple-Free Graphs. SIAM J. Discret. Math. Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca
2010	J	`jnl`	On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Algorithmica Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
2010	J	`jnl`	On the Maximum Independent Set Problem in Subclasses of Planar Graphs. J. Graph Algorithms Appl. Vadim V. Lozin, Martin Milanic
2010	C	`conf`	Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. IWOCA Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach
2009	C	`conf`	A Note on the Parameterized Complexity of the Maximum Independent Set Problem. CTW Vadim V. Lozin
2009	C	`conf`	Bipartite Graphs of Large Clique-Width. IWOCA Nicholas Korpelainen, Vadim V. Lozin
2009	J	`jnl`	Clique-Width and the Speed of Hereditary Properties. Electron. J. Comb. Peter Allen, Vadim V. Lozin, Michaël Rao
2009	J	`jnl`	DIMAP Workshop on Algorithmic Graph Theory. Electron. Notes Discret. Math. Arie M. C. A. Koster, Vadim V. Lozin
2009	—	`conf`	Dominating Induced Matchings. Graph Theory, Computational Intelligence and Thought Domingos Moreira Cardoso, Vadim V. Lozin
2009	J	`jnl`	Maximum independent sets in subclasses of P Inf. Process. Lett. Vadim V. Lozin, Raffaele Mosca
2009	J	`jnl`	Parameterized complexity of the maximum independent set problem and the speed of hereditary properties. Electron. Notes Discret. Math. Vadim V. Lozin
2009	J	`jnl`	Recent developments on graphs of bounded clique-width. Discret. Appl. Math. Marcin Kaminski, Vadim V. Lozin, Martin Milanic
2008	B	`conf`	A Note on k-Colorability of P5-Free Graphs. MFCS Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2008	J	`jnl`	A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms Vadim V. Lozin, Martin Milanic
2008	J	`jnl`	Boundary Classes of Planar Graphs. Comb. Probab. Comput. Vadim V. Lozin
2008	B	`conf`	From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. ISAAC Vadim V. Lozin
2008	J	`jnl`	Graph Representation Functions Computable by Finite Automata. J. Autom. Lang. Comb. Vadim V. Lozin
2008	B	`conf`	Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
2008	J	`jnl`	On finding augmenting graphs. Discret. Appl. Math. Vadim V. Lozin, Martin Milanic
2008	J	`jnl`	The Clique-Width of Bipartite Graphs in Monogenic Classes. Int. J. Found. Comput. Sci. Vadim V. Lozin, Jordan Volz
2008	B	`conf`	The Maximum Independent Set Problem in Planar Graphs. MFCS Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic
2007	J	`jnl`	Coloring edges and vertices of graphs without short or long cycles. Contributions Discret. Math. Vadim V. Lozin, Marcin Kaminski
2007	J	`jnl`	Deciding k-colourability of P_5-free graphs in polynomial time CoRR Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2007	J	`jnl`	Maximum J. Comb. Optim. Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin
2007	A*	`conf`	Maximum independent sets in graphs of low degree. SODA Vadim V. Lozin, Martin Milanic
2007	J	`jnl`	Minimal Universal Bipartite Graphs. Ars Comb. Vadim V. Lozin, Gábor Rudolf
2007	J	`jnl`	NP-hard graph problems and boundary classes of graphs. Theor. Comput. Sci. Vladimir E. Alekseev, Rodica Boliac, Dmitry V. Korobitsyn, Vadim V. Lozin
2007	C	`conf`	On the maximum independent set problem in subclasses of planar and more general graphs. CTW Vadim V. Lozin, Martin Milanic
2007	J	`jnl`	The relative clique-width of a graph. J. Comb. Theory B Vadim V. Lozin, Dieter Rautenbach
2007	B	`conf`	Tree-Width and Optimization in Bounded Degree Graphs. WG Vadim V. Lozin, Martin Milanic
2007	J	`jnl`	Vertex 3-colorability of Claw-free Graphs. Algorithmic Oper. Res. Marcin Kaminski, Vadim V. Lozin
2006	A*	`conf`	A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. SODA Vadim V. Lozin, Martin Milanic
2006	J	`jnl`	Augmenting chains in graphs without a skew star. J. Comb. Theory B Michael U. Gerber, Alain Hertz, Vadim V. Lozin
2006	J	`jnl`	Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
2006	J	`jnl`	Polar graphs and maximal independent sets. Discret. Math. Vadim V. Lozin, Raffaele Mosca
2006	J	`jnl`	Polynomial-time algorithm for vertex k-colorability of P_5-free graphs CoRR Marcin Kaminski, Vadim V. Lozin
2006	J	`jnl`	The tree- and clique-width of bipartite graphs in special classes. Australas. J Comb. Vadim V. Lozin, Dieter Rautenbach
2005	J	`jnl`	Between 2- and 3-colorability. Inf. Process. Lett. Vadim V. Lozin
2005	J	`jnl`	Bisplit graphs. Discret. Math. Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin
2005	B	`conf`	Clique-Width for Four-Vertex Forbidden Subgraphs. FCT Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
2005	J	`jnl`	Graphs of low chordality. Discret. Math. Theor. Comput. Sci. L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian
2005	J	`jnl`	Independent sets in extensions of 2 Discret. Appl. Math. Vadim V. Lozin, Raffaele Mosca
2004	J	`jnl`	Augmenting graphs for independent sets. Discret. Appl. Math. Vladimir E. Alekseev, Vadim V. Lozin
2004	J	`jnl`	Boundary classes of graphs for the dominating set problem. Discret. Math. Vladimir E. Alekseev, Dmitry V. Korobitsyn, Vadim V. Lozin
2004	J	`jnl`	Chordal bipartite graphs of bounded tree- and clique-width. Discret. Math. Vadim V. Lozin, Dieter Rautenbach
2004	J	`jnl`	Local transformations of graphs preserving independence number. Discret. Appl. Math. Vladimir E. Alekseev, Vadim V. Lozin
2004	J	`jnl`	New Results on Generalized Graph Coloring. Discret. Math. Theor. Comput. Sci. Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin
2004	J	`jnl`	On computing the dissociation number and the induced matching number of bipartite graphs. Ars Comb. Rodica Boliac, Kathie Cameron, Vadim V. Lozin
2004	J	`jnl`	On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. SIAM J. Discret. Math. Vadim V. Lozin, Dieter Rautenbach
2003	J	`jnl`	An augmenting graph approach to the stable set problem in P Discret. Appl. Math. Rodica Boliac, Vadim V. Lozin
2003	J	`jnl`	Finding augmenting chains in extensions of claw-free graphs. Inf. Process. Lett. Alain Hertz, Vadim V. Lozin, David Schindl
2003	J	`jnl`	Independent domination in finitely defined classes of graphs. Theor. Comput. Sci. Rodica Boliac, Vadim V. Lozin
2003	J	`jnl`	Independent sets of maximum weight in (p, q)-colorable graphs. Discret. Math. Vladimir E. Alekseev, Vadim V. Lozin
2003	J	`jnl`	On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. Andreas Brandstädt, Vadim V. Lozin
2003	J	`jnl`	On the stable set problem in special P Discret. Appl. Math. Michael U. Gerber, Vadim V. Lozin
2003	J	`jnl`	Robust Algorithms for the Stable Set Problem. Graphs Comb. Michael U. Gerber, Vadim V. Lozin
2003	J	`jnl`	Some results on graphs without long induced paths. Inf. Process. Lett. Vadim V. Lozin, Dieter Rautenbach
2003	J	`jnl`	Special issue on stability in graphs and related topics. Discret. Appl. Math. Vadim V. Lozin, Dominique de Werra
2003	J	`jnl`	Stable sets in two subclasses of banner-free graphs. Discret. Appl. Math. Michael U. Gerber, Alain Hertz, Vadim V. Lozin
2003	J	`jnl`	Struction revisited. Discret. Appl. Math. Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra
2003	J	`jnl`	The 3-Colorability Problem on Graphs with Maximum Degree Four. SIAM J. Comput. Martin Kochol, Vadim V. Lozin, Bert Randerath
2002	J	`jnl`	Bipartite graphs without a skew star. Discret. Math. Vadim V. Lozin
2002	J	`jnl`	On maximum induced matchings in bipartite graphs. Inf. Process. Lett. Vadim V. Lozin
2002	B	`conf`	On the Clique-Width of Graphs in Hereditary Classes. ISAAC Rodica Boliac, Vadim V. Lozin
2001	J	`jnl`	A note on alpha-redundant vertices in graphs. Discret. Appl. Math. Andreas Brandstädt, Vadim V. Lozin
2001	J	`jnl`	An attractive class of bipartite graphs. Discuss. Math. Graph Theory Rodica Boliac, Vadim V. Lozin
2001	J	`jnl`	On orthogonal representations of graphs. Discret. Math. Vladimir E. Alekseev, Vadim V. Lozin
2000	J	`jnl`	Conic reduction of graphs for the stable set problem. Discret. Math. Vadim V. Lozin
2000	B	`conf`	On a Generalization of Bi-Complement Reducible Graphs. MFCS Vadim V. Lozin
2000	J	`jnl`	On the Jump Number Problem in Hereditary Classes of Bipartite Graphs. Order Vadim V. Lozin, Michael U. Gerber
2000	J	`jnl`	Stability in P Eur. J. Oper. Res. Vadim V. Lozin