default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVadim V. Lozin
Person information
- affiliation: University of Warwick, Coventry, United Kingdom
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j128]Vadim V. Lozin:
Ramsey Numbers and Graph Parameters. Graphs Comb. 40(2): 29 (2024)- [j127]Vadim V. Lozin, Viktor Zamaraev
:
Union-closed sets and Horn Boolean functions. J. Comb. Theory A 202: 105818 (2024) - [j126]Bogdan Alecu, Vadim V. Lozin, Dmitriy S. Malyshev:
Critical properties of bipartite permutation graphs. J. Graph Theory 105(1): 34-60 (2024) - [j125]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): 261-276 (2024) - [j124]Aistis Atminas, Vadim V. Lozin:
Deciding atomicity of subword-closed languages. Theor. Comput. Sci. 1003: 114595 (2024) - [c41]Vadim V. Lozin:
The Hamiltonian Cycle Problem and Monotone Classes. IWOCA 2024: 460-471 - [i23]Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev:
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. CoRR abs/2402.12559 (2024) - 2023
- [j123]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev:
Combinatorics and Algorithms for Quasi-Chain Graphs. Algorithmica 85(3): 642-664 (2023) - [j122]Vadim V. Lozin:
Hereditary classes of graphs: A parametric approach. Discret. Appl. Math. 325: 134-151 (2023) - [j121]Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Victor Zamaraev:
Graph parameters, implicit representations and factorial properties. Discret. Math. 346(10): 113573 (2023) - [i22]Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev:
Functionality of box intersection graphs. CoRR abs/2301.09493 (2023) - [i21]Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Graph parameters, implicit representations and factorial properties. CoRR abs/2303.04453 (2023) - 2022
- [j120]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra:
The micro-world of cographs. Discret. Appl. Math. 312: 3-14 (2022) - [j119]Vadim V. Lozin, Igor Razgon:
Tree-width dichotomy. Eur. J. Comb. 103: 103517 (2022) - [j118]Vadim V. Lozin, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
On Boolean threshold functions with minimum specification number. Inf. Comput. 289(Part): 104926 (2022) - [j117]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): 2774-2797 (2022) - [c40]Aistis Atminas, Vadim V. Lozin:
Deciding Atomicity of Subword-Closed Languages. DLT 2022: 69-77 - [c39]Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Graph Parameters, Implicit Representations and Factorial Properties. IWOCA 2022: 60-72 - [i20]Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev:
The treewidth and pathwidth of graph unions. CoRR abs/2202.07752 (2022) - 2021
- [j116]Vadim V. Lozin, Mikhail Moshkov:
Critical Properties and Complexity Measures of Read-Once Boolean Functions. Ann. Math. Artif. Intell. 89(5-6): 595-614 (2021) - [j115]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: 57-69 (2021) - [j114]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Graph classes with linear Ramsey numbers. Discret. Math. 344(4): 112307 (2021) - [j113]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin:
Graph functionality. J. Comb. Theory B 147: 139-158 (2021) - [c38]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev:
Combinatorics and Algorithms for Quasi-chain Graphs. IWOCA 2021: 49-62 - 2020
- [j112]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: 482-494 (2020) - [j111]Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev:
Between clique-width and linear clique-width of bipartite graphs. Discret. Math. 343(8): 111926 (2020) - [j110]Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev:
Independent domination versus weighted independent domination. Inf. Process. Lett. 156: 105914 (2020) - [j109]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: 64-91 (2020) - [j108]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): 1107-1147 (2020) - [j107]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum independent sets in subcubic graphs: New results. Theor. Comput. Sci. 846: 14-26 (2020) - [c37]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra:
The Micro-world of Cographs. IWOCA 2020: 30-42 - [i19]Vadim V. Lozin, Igor Razgon:
Tree-width dichotomy. CoRR abs/2012.01115 (2020)
2010 – 2019
- 2019
- [j106]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): 1-15 (2019) - [c36]Vadim V. Lozin:
From Words to Graphs, and Back. LATA 2019: 43-54 - [c35]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum Independent Sets in Subcubic Graphs: New Results. WG 2019: 40-52 - [c34]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin:
Graph Functionality. WG 2019: 135-147 - 2018
- [j105]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): 2799-2817 (2018) - [j104]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): 287-305 (2018) - [j103]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: 145-152 (2018) - [j102]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
Linear read-once and related Boolean functions. Discret. Appl. Math. 250: 16-27 (2018) - [j101]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev:
Well-quasi-ordering versus clique-width. J. Comb. Theory B 130: 1-18 (2018) - [j100]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): 18-39 (2018) - [j99]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Order 35(2): 253-274 (2018) - [c33]Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev:
Linear Clique-Width of Bi-complement Reducible Graphs. IWOCA 2018: 14-25 - [c32]Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Linear Ramsey Numbers. IWOCA 2018: 26-38 - [i18]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev:
Letter graphs and geometric grid classes of permutations: characterization and recognition. CoRR abs/1804.11217 (2018) - [i17]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
Linear read-once and related Boolean functions. CoRR abs/1805.10159 (2018) - [i16]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum Independent Sets in Subcubic Graphs: New Results. CoRR abs/1810.10940 (2018) - 2017
- [j98]Andrew Collins, Sergey Kitaev, Vadim V. Lozin:
New results on word-representable graphs. Discret. Appl. Math. 216: 136-141 (2017) - [j97]Vadim V. Lozin, Dmitriy S. Malyshev:
Vertex coloring of graphs with few obstructions. Discret. Appl. Math. 216: 273-280 (2017) - [j96]Vadim V. Lozin:
From matchings to independent sets. Discret. Appl. Math. 231: 4-14 (2017) - [j95]Vadim V. Lozin, Viktor Zamaraev:
The structure and the number of P7-free bipartite graphs. Eur. J. Comb. 65: 143-153 (2017) - [j94]Vadim V. Lozin, Victor Zamaraev:
The structure and the number of P7-free bipartite graphs. Electron. Notes Discret. Math. 61: 827-833 (2017) - [j93]Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov:
WQO is decidable for factorial languages. Inf. Comput. 256: 321-333 (2017) - [j92]Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev:
More results on weighted independent domination. Theor. Comput. Sci. 700: 63-74 (2017) - [c31]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
Specifying a positive threshold function via extremal points. ALT 2017: 208-222 - [c30]Vadim V. Lozin:
Graph Parameters and Ramsey Theory. IWOCA 2017: 185-194 - [c29]Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra:
Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. IWOCA 2017: 195-205 - [c28]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: 73:1-73:14 - [c27]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. WG 2017: 220-233 - [c26]Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev:
New Results on Weighted Independent Domination. WG 2017: 399-411 - [i15]Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev:
Infinitely many minimal classes of graphs of unbounded clique-width. CoRR abs/1701.08857 (2017) - [i14]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev:
Clique-Width for Graph Classes Closed under Complementation. CoRR abs/1705.07681 (2017) - [i13]Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Perfect Edge Domination: Hard and Solvable Cases. CoRR abs/1705.08379 (2017) - [i12]Vadim V. Lozin, Igor Razgon, Victor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
Specifying a positive threshold function via extremal points. CoRR abs/1706.01747 (2017) - [i11]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes. CoRR abs/1711.08837 (2017) - 2016
- [j91]Robert Brignall, Vadim V. Lozin, Juraj Stacho:
Bichain graphs: Geometric model and universal graphs. Discret. Appl. Math. 199: 16-29 (2016) - [j90]Domingos M. Cardoso, Vadim V. Lozin, Carlos J. Luz, Maria F. Pacheco:
Efficient domination through eigenvalues. Discret. Appl. Math. 214: 54-62 (2016) - [j89]Konrad Kazimierz Dabrowski, Vadim V. Lozin, Dominique de Werra, Victor Zamaraev:
Combinatorics and Algorithms for Augmenting Graphs. Graphs Comb. 32(4): 1339-1352 (2016) - [j88]Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin:
Deciding the Bell Number for Hereditary Graph Properties. SIAM J. Discret. Math. 30(2): 1015-1031 (2016) - [c25]Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev:
A Boundary Property for Upper Domination. IWOCA 2016: 229-240 - [c24]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. IWOCA 2016: 253-265 - [i10]Vadim V. Lozin, Raffaele Mosca, Victor Zamaraev:
Independent Domination versus Weighted Independent Domination. CoRR abs/1602.09124 (2016) - [i9]Vadim V. Lozin:
Graph Parameters and Ramsey Theory. CoRR abs/1608.07727 (2016) - [i8]Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev:
Upper Domination: towards a dichotomy through boundary properties. CoRR abs/1609.01510 (2016) - [i7]Konrad Kazimierz Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. CoRR abs/1611.03671 (2016) - 2015
- [b2]Sergey Kitaev, Vadim V. Lozin:
Words and Graphs. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2015, ISBN 978-3-319-25857-7, pp. 1-229 - [j87]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): 2 (2015) - [j86]Vadim V. Lozin, Raffaele Mosca, Christopher Purcell:
Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discret. Appl. Math. 182: 2-14 (2015) - [j85]Konrad K. Dabrowski, Vadim V. Lozin, Juraj Stacho:
Stable-iΠ partitions of graphs. Discret. Appl. Math. 182: 104-114 (2015) - [j84]Aistis Atminas, Andrew Collins, Vadim V. Lozin, Victor Zamaraev:
Implicit representations and factorial properties of graphs. Discret. Math. 338(2): 164-179 (2015) - [j83]Vadim V. Lozin, Jérôme Monnot, Bernard Ries:
On the maximum independent set problem in subclasses of subcubic graphs. J. Discrete Algorithms 31: 104-112 (2015) - [j82]Vadim V. Lozin, Victor Zamaraev:
Boundary Properties of Factorial Classes of Graphs. J. Graph Theory 78(3): 207-218 (2015) - [j81]Aistis Atminas, Vadim V. Lozin:
Labelled Induced Subgraphs and Well-Quasi-Ordering. Order 32(3): 313-328 (2015) - [c23]Vadim V. Lozin, Igor Razgon, Victor Zamaraev:
Well-quasi-ordering Does Not Imply Bounded Clique-width. WG 2015: 351-359 - [e1]Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko:
Surveys in Combinatorics 2015. London Mathematical Society Lecture Note Series 424, Cambridge University Press 2015, ISBN 9781316106853 [contents] - [i6]Vadim V. Lozin, Igor Razgon, Victor Zamaraev:
Well-quasi-ordering does not imply bounded clique-width. CoRR abs/1503.00571 (2015) - [i5]Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho:
Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. CoRR abs/1503.01628 (2015) - [i4]Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra:
Dominating induced matchings in graphs containing no long claw. CoRR abs/1505.02558 (2015) - 2014
- [j80]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: 168 (2014) - [j79]Vadim V. Lozin, Martin Milanic, Christopher Purcell:
Graphs Without Large Apples and the Maximum Weight Independent Set Problem. Graphs Comb. 30(2): 395-410 (2014) - [j78]Nicholas Korpelainen, Vadim V. Lozin, Colin Mayhill:
Split Permutation Graphs. Graphs Comb. 30(3): 633-646 (2014) - [j77]Vadim V. Lozin, Christopher Purcell:
Coloring vertices of claw-free graphs in three colors. J. Comb. Optim. 28(2): 462-479 (2014) - [j76]Nicholas Korpelainen, Vadim V. Lozin, Christopher Purcell:
Dominating induced matchings in graphs without a skew star. J. Discrete Algorithms 26: 45-55 (2014) - [c22]Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries:
A Dichotomy for Upper Domination in Monogenic Classes. COCOA 2014: 258-267 - [c21]Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin:
Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). WG 2014: 69-80 - [i3]Konrad K. Dabrowski, Dominique de Werra, Vadim V. Lozin, Victor Zamaraev:
Combinatorics and algorithms for augmenting graphs. CoRR abs/1410.8774 (2014) - 2013
- [b1]Igor Chikalov, Vadim V. Lozin, Irina Lozina, Mikhail Moshkov, Hung Son Nguyen, Andrzej Skowron, Beata Zielosko:
Three Approaches to Data Analysis - Test Theory, Rough Sets and Logical Analysis of Data. Intelligent Systems Reference Library 41, Springer 2013, ISBN 978-3-642-28666-7, pp. 3-192 - [j75]Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries:
GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discret. Appl. Math. 161(4-5): 453 (2013) - [j74]Vadim V. Lozin, Raffaele Mosca, Christopher Purcell:
Sparse regular induced subgraphs in 2P3-free graphs. Discret. Optim. 10(4): 304-309 (2013) - [j73]Vadim V. Lozin, Martin Milanic:
Critical properties of graphs of bounded clique-width. Discret. Math. 313(9): 1035-1044 (2013) - [j72]Aistis Atminas, Vadim V. Lozin, Sergey Kitaev, Alexandr Valyuzhenich:
Universal graphs and Universal Permutations. Discret. Math. Algorithms Appl. 5(4) (2013) - [j71]Vadim V. Lozin, Christopher Purcell:
Boundary properties of the satisfiability problems. Inf. Process. Lett. 113(9): 313-317 (2013) - [j70]Nicholas Korpelainen, Vadim V. Lozin, Igor Razgon:
Boundary Properties of Well-Quasi-Ordered Sets of Graphs. Order 30(3): 723-735 (2013) - [j69]Konrad K. Dabrowski, Marc Demange, Vadim V. Lozin:
New results on maximum induced matchings in bipartite graphs and beyond. Theor. Comput. Sci. 478: 33-40 (2013) - [c20]Vadim V. Lozin, Jérôme Monnot, Bernard Ries:
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs. IWOCA 2013: 314-326 - [c19]Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov:
Deciding WQO for Factorial Languages. LATA 2013: 68-79 - 2012
- [j68]Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries:
Colouring vertices of triangle-free graphs without forests. Discret. Math. 312(7): 1372-1385 (2012) - [j67]Konrad K. Dabrowski, Vadim V. Lozin, Victor Zamaraev:
On factorial properties of chordal bipartite graphs. Discret. Math. 312(16): 2457-2465 (2012) - [j66]Vadim V. Lozin, Colin Mayhill, Victor Zamaraev:
Locally bounded coverings and factorial properties of graphs. Eur. J. Comb. 33(4): 534-543 (2012) - [j65]Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach:
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. J. Discrete Algorithms 14: 207-213 (2012) - [j64]Vadim V. Lozin, Raffaele Mosca:
Maximum regular induced subgraphs in 2 P3-free graphs. Theor. Comput. Sci. 460: 26-33 (2012) - [c18]Aistis Atminas, Vadim V. Lozin, Igor Razgon:
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. SWAT 2012: 142-152 - 2011
- [j63]Vadim V. Lozin:
Stability preserving transformations of graphs. Ann. Oper. Res. 188(1): 331-341 (2011) - [j62]Vadim V. Lozin, Colin Mayhill, Victor Zamaraev:
A Note on the Speed of Hereditary Graph Properties. Electron. J. Comb. 18(1) (2011) - [j61]Domingos Moreira Cardoso, Nicholas Korpelainen, Vadim V. Lozin:
On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discret. Appl. Math. 159(7): 521-531 (2011) - [j60]Nicholas Korpelainen, Vadim V. Lozin:
Two forbidden induced subgraphs and well-quasi-ordering. Discret. Math. 311(16): 1813-1822 (2011) - [j59]Nicholas Korpelainen, Vadim V. Lozin:
Bipartite induced subgraphs and well-quasi-ordering. J. Graph Theory 67(3): 235-249 (2011) - [j58]Vadim V. Lozin, Colin Mayhill:
Canonical Antichains of Unit Interval and Bipartite Permutation Graphs. Order 28(3): 513-522 (2011) - [j57]Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin:
Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. 412(29): 3545-3554 (2011) - 2010
- [j56]Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca:
On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Algorithmica 56(4): 383-393 (2010) - [j55]Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu:
Deciding k-Colorability of P5-Free Graphs in Polynomial Time. Algorithmica 57(1): 74-81 (2010) - [j54]Vadim V. Lozin, Martin Milanic:
On the Maximum Independent Set Problem in Subclasses of Planar Graphs. J. Graph Algorithms Appl. 14(2): 269-286 (2010) - [j53]Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca:
Independent Sets of Maximum Weight in Apple-Free Graphs. SIAM J. Discret. Math. 24(1): 239-254 (2010) - [j52]Vadim V. Lozin:
A decidability result for the dominating set problem. Theor. Comput. Sci. 411(44-46): 4023-4027 (2010) - [c17]Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach:
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. IWOCA 2010: 1-9 - [c16]Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin:
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. TAMC 2010: 320-327 - [c15]Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries:
Colouring Vertices of Triangle-Free Graphs. WG 2010: 184-195
2000 – 2009
- 2009
- [j51]Peter Allen, Vadim V. Lozin, Michaël Rao:
Clique-Width and the Speed of Hereditary Properties. Electron. J. Comb. 16(1) (2009) - [j50]Marcin Kaminski, Vadim V. Lozin, Martin Milanic:
Recent developments on graphs of bounded clique-width. Discret. Appl. Math. 157(12): 2747-2761 (2009) - [j49]Arie M. C. A. Koster, Vadim V. Lozin:
DIMAP Workshop on Algorithmic Graph Theory. Electron. Notes Discret. Math. 32: 1 (2009) - [j48]Vadim V. Lozin:
Parameterized complexity of the maximum independent set problem and the speed of hereditary properties. Electron. Notes Discret. Math. 34: 127-131 (2009) - [j47]Vadim V. Lozin, Raffaele Mosca:
Maximum independent sets in subclasses of P5-free graphs. Inf. Process. Lett. 109(6): 319-324 (2009) - [c14]Domingos Moreira Cardoso, Vadim V. Lozin:
Dominating Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 77-86 - [c13]Vadim V. Lozin:
A Note on the Parameterized Complexity of the Maximum Independent Set Problem. CTW 2009: 40-43 - [c12]Nicholas Korpelainen, Vadim V. Lozin:
Bipartite Graphs of Large Clique-Width. IWOCA 2009: 385-395 - 2008
- [j46]Vadim V. Lozin:
Boundary Classes of Planar Graphs. Comb. Probab. Comput. 17(2): 287-295 (2008) - [j45]Vadim V. Lozin, Martin Milanic:
On finding augmenting graphs. Discret. Appl. Math. 156(13): 2517-2529 (2008) - [j44]Vadim V. Lozin, Jordan Volz:
The Clique-Width of Bipartite Graphs in Monogenic Classes. Int. J. Found. Comput. Sci. 19(2): 477-494 (2008) - [j43]Vadim V. Lozin:
Graph Representation Functions Computable by Finite Automata. J. Autom. Lang. Comb. 13(1): 73-90 (2008) - [j42]Vadim V. Lozin, Martin Milanic:
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms 6(4): 595-604 (2008) - [c11]Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca:
Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC 2008: 848-858 - [c10]Vadim V. Lozin:
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. ISAAC 2008: 871-882 - [c9]Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic:
The Maximum Independent Set Problem in Planar Graphs. MFCS 2008: 96-107 - [c8]Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu:
A Note on k-Colorability of P5-Free Graphs. MFCS 2008: 387-394 - 2007
- [j41]Marcin Kaminski, Vadim V. Lozin:
Vertex 3-colorability of Claw-free Graphs. Algorithmic Oper. Res. 2(1) (2007) - [j40]Vadim V. Lozin, Gábor Rudolf:
Minimal Universal Bipartite Graphs. Ars Comb. 84 (2007) - [j39]Vadim V. Lozin, Marcin Kaminski:
Coloring edges and vertices of graphs without short or long cycles. Contributions Discret. Math. 2(1) (2007) - [j38]Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin:
Maximum k -regular induced subgraphs. J. Comb. Optim. 14(4): 455-463 (2007) - [j37]Vadim V. Lozin, Dieter Rautenbach:
The relative clique-width of a graph. J. Comb. Theory B 97(5): 846-858 (2007) - [j36]Vladimir E. Alekseev, Rodica Boliac, Dmitry V. Korobitsyn, Vadim V. Lozin:
NP-hard graph problems and boundary classes of graphs. Theor. Comput. Sci. 389(1-2): 219-236 (2007) - [c7]Vadim V. Lozin, Martin Milanic:
On the maximum independent set problem in subclasses of planar and more general graphs. CTW 2007: 107-110 - [c6]Vadim V. Lozin, Martin Milanic:
Maximum independent sets in graphs of low degree. SODA 2007: 874-880 - [c5]Vadim V. Lozin, Martin Milanic:
Tree-Width and Optimization in Bounded Degree Graphs. WG 2007: 45-54 - [i2]Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu:
Deciding k-colourability of P_5-free graphs in polynomial time. CoRR abs/cs/0702043 (2007) - 2006
- [j35]Vadim V. Lozin, Dieter Rautenbach:
The tree- and clique-width of bipartite graphs in special classes. Australas. J Comb. 34: 57-68 (2006) - [j34]Vadim V. Lozin, Raffaele Mosca:
Polar graphs and maximal independent sets. Discret. Math. 306(22): 2901-2908 (2006) - [j33]Michael U. Gerber, Alain Hertz, Vadim V. Lozin:
Augmenting chains in graphs without a skew star. J. Comb. Theory B 96(3): 352-366 (2006) - [j32]Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin:
Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. 39(4): 561-590 (2006) - [c4]Vadim V. Lozin, Martin Milanic:
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. SODA 2006: 26-30 - [i1]Marcin Kaminski, Vadim V. Lozin:
Polynomial-time algorithm for vertex k-colorability of P_5-free graphs. CoRR abs/cs/0607115 (2006) - 2005
- [j31]Vadim V. Lozin, Raffaele Mosca:
Independent sets in extensions of 2K2-free graphs. Discret. Appl. Math. 146(1): 74-80 (2005) - [j30]Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin:
Bisplit graphs. Discret. Math. 299(1-3): 11-32 (2005) - [j29]L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian:
Graphs of low chordality. Discret. Math. Theor. Comput. Sci. 7(1): 25-36 (2005) - [j28]Vadim V. Lozin:
Between 2- and 3-colorability. Inf. Process. Lett. 94(4): 179-182 (2005) - [c3]Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin:
Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196 - 2004
- [j27]Rodica Boliac, Kathie Cameron, Vadim V. Lozin:
On computing the dissociation number and the induced matching number of bipartite graphs. Ars Comb. 72 (2004) - [j26]Vladimir E. Alekseev, Vadim V. Lozin:
Local transformations of graphs preserving independence number. Discret. Appl. Math. 135(1-3): 17-30 (2004) - [j25]Vladimir E. Alekseev, Vadim V. Lozin:
Augmenting graphs for independent sets. Discret. Appl. Math. 145(1): 3-10 (2004) - [j24]Vadim V. Lozin, Dieter Rautenbach:
Chordal bipartite graphs of bounded tree- and clique-width. Discret. Math. 283(1-3): 151-158 (2004) - [j23]Vladimir E. Alekseev, Dmitry V. Korobitsyn, Vadim V. Lozin:
Boundary classes of graphs for the dominating set problem. Discret. Math. 285(1-3): 1-6 (2004) - [j22]Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin:
New Results on Generalized Graph Coloring. Discret. Math. Theor. Comput. Sci. 6(2): 215-222 (2004) - [j21]Vadim V. Lozin, Dieter Rautenbach:
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. SIAM J. Discret. Math. 18(1): 195-206 (2004) - 2003
- [j20]Andreas Brandstädt, Vadim V. Lozin:
On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67 (2003) - [j19]Michael U. Gerber, Vadim V. Lozin:
On the stable set problem in special P5-free graphs. Discret. Appl. Math. 125(2-3): 215-224 (2003) - [j18]Rodica Boliac, Vadim V. Lozin:
An augmenting graph approach to the stable set problem in P5-free graphs. Discret. Appl. Math. 131(3): 567-575 (2003) - [j17]Vadim V. Lozin, Dominique de Werra:
Special issue on stability in graphs and related topics. Discret. Appl. Math. 132(1-3): 1-2 (2003) - [j16]Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra:
Struction revisited. Discret. Appl. Math. 132(1-3): 27-46 (2003) - [j15]Michael U. Gerber, Alain Hertz, Vadim V. Lozin:
Stable sets in two subclasses of banner-free graphs. Discret. Appl. Math. 132(1-3): 121-136 (2003) - [j14]Vladimir E. Alekseev, Vadim V. Lozin:
Independent sets of maximum weight in (p, q)-colorable graphs. Discret. Math. 265(1-3): 351-356 (2003) - [j13]Michael U. Gerber, Vadim V. Lozin:
Robust Algorithms for the Stable Set Problem. Graphs Comb. 19(3): 347-356 (2003) - [j12]Alain Hertz, Vadim V. Lozin, David Schindl:
Finding augmenting chains in extensions of claw-free graphs. Inf. Process. Lett. 86(6): 311-316 (2003) - [j11]Vadim V. Lozin, Dieter Rautenbach:
Some results on graphs without long induced paths. Inf. Process. Lett. 88(4): 167-171 (2003) - [j10]Martin Kochol, Vadim V. Lozin, Bert Randerath:
The 3-Colorability Problem on Graphs with Maximum Degree Four. SIAM J. Comput. 32(5): 1128-1139 (2003) - [j9]Rodica Boliac, Vadim V. Lozin:
Independent domination in finitely defined classes of graphs. Theor. Comput. Sci. 301(1-3): 271-284 (2003) - 2002
- [j8]Vadim V. Lozin:
Bipartite graphs without a skew star. Discret. Math. 257(1): 83-100 (2002) - [j7]Vadim V. Lozin:
On maximum induced matchings in bipartite graphs. Inf. Process. Lett. 81(1): 7-11 (2002) - [c2]Rodica Boliac, Vadim V. Lozin:
On the Clique-Width of Graphs in Hereditary Classes. ISAAC 2002: 44-54 - 2001
- [j6]Andreas Brandstädt, Vadim V. Lozin:
A note on alpha-redundant vertices in graphs. Discret. Appl. Math. 108(3): 301-308 (2001) - [j5]Vladimir E. Alekseev, Vadim V. Lozin:
On orthogonal representations of graphs. Discret. Math. 226(1-3): 359-363 (2001) - [j4]Rodica Boliac, Vadim V. Lozin:
An attractive class of bipartite graphs. Discuss. Math. Graph Theory 21(2): 293-301 (2001) - 2000
- [j3]Vadim V. Lozin:
Conic reduction of graphs for the stable set problem. Discret. Math. 222(1-3): 199-211 (2000) - [j2]Vadim V. Lozin:
Stability in P5- and banner-free graphs. Eur. J. Oper. Res. 125(2): 292-297 (2000) - [j1]Vadim V. Lozin, Michael U. Gerber:
On the Jump Number Problem in Hereditary Classes of Bipartite Graphs. Order 17(4): 377-385 (2000) - [c1]Vadim V. Lozin:
On a Generalization of Bi-Complement Reducible Graphs. MFCS 2000: 528-538
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
