Person:317397: Difference between revisions

From MaRDI portal
Person:317397
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Vadim V. Lozin to Vadim V. Lozin: Duplicate
 
(No difference)

Latest revision as of 12:26, 8 December 2023

Available identifiers

zbMath Open lozin.vadim-vMaRDI QIDQ317397

List of research outcomes





PublicationDate of PublicationType
Deciding atomicity of subword-closed languages2024-06-04Paper
Ramsey numbers and graph parameters2024-03-26Paper
Union-closed sets and Horn Boolean functions2024-01-29Paper
The Treewidth and Pathwidth of Graph Unions2024-01-23Paper
Functionality of box intersection graphs2024-01-19Paper
Critical properties of bipartite permutation graphs2024-01-04Paper
Graph parameters, implicit representations and factorial properties2023-07-19Paper
Combinatorics and algorithms for quasi-chain graphs2023-03-09Paper
Cliques, colouring and satisfiability: from structure to algorithms2022-12-21Paper
Hereditary classes of graphs: a parametric approach2022-12-08Paper
On Boolean threshold functions with minimum specification number2022-12-08Paper
Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision2022-11-25Paper
Letter Graphs and Geometric Grid Classes of Permutations2022-11-15Paper
The Micro-world of Cographs2022-10-13Paper
Graph parameters, implicit representations and factorial properties2022-08-30Paper
Deciding atomicity of subword-closed languages2022-08-11Paper
A dichotomy for graphs of bounded degeneracy2022-06-18Paper
Tree-width dichotomy2022-05-10Paper
The micro-world of cographs2022-03-24Paper
Combinatorics and algorithms for quasi-chain graphs2022-03-22Paper
Critical properties and complexity measures of read-once Boolean functions2021-08-02Paper
Understanding lettericity I: a structural hierarchy2021-06-06Paper
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs2021-04-01Paper
Graph classes with linear Ramsey numbers2021-03-25Paper
Graph functionality2021-02-03Paper
Maximum independent sets in subcubic graphs: new results2020-11-06Paper
Letter graphs and geometric grid classes of permutations: characterization and recognition2020-06-29Paper
Clique-Width for Graph Classes Closed under Complementation2020-06-09Paper
Between clique-width and linear clique-width of bipartite graphs2020-06-08Paper
https://portal.mardi4nfdi.de/entity/Q51112902020-05-26Paper
Maximum independent sets in subcubic graphs: new results2020-02-24Paper
Graph functionality2020-02-24Paper
Independent domination versus weighted independent domination2020-02-11Paper
From words to graphs, and back2019-12-04Paper
Clique-width and well-quasi-ordering of triangle-free graph classes2019-11-29Paper
Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation2019-01-28Paper
Recent advances in the theory and practice of logical analysis of data2019-01-18Paper
Specifying a positive threshold function via extremal points2019-01-10Paper
Linear read-once and related Boolean functions2018-10-26Paper
Sparse regular induced subgraphs in \(2P_3\)-free graphs2018-10-18Paper
Infinitely many minimal classes of graphs of unbounded clique-width2018-09-17Paper
Linear clique-width of bi-complement reducible graphs2018-09-06Paper
Linear Ramsey numbers2018-09-06Paper
Well-quasi-ordering versus clique-width: new results on bigenic classes2018-07-27Paper
Upper domination: towards a dichotomy through boundary properties2018-07-26Paper
Dominating induced matchings in graphs containing no long claw2018-07-13Paper
Graph parameters and Ramsey theory2018-06-15Paper
Letter graphs and geometric grid classes of permutations: characterization and recognition2018-06-15Paper
Perfect edge domination: hard and solvable cases2018-06-12Paper
Well-quasi-ordering versus clique-width2018-04-18Paper
The structure and the number of \(P_7\)-free bipartite graphs2018-01-18Paper
New results on weighted independent domination2018-01-04Paper
Clique-width and well-quasi-ordering of triangle-free graph classes2018-01-04Paper
More results on weighted independent domination2017-10-17Paper
WQO is decidable for factorial languages2017-09-28Paper
From matchings to independent sets2017-09-12Paper
The structure and the number of \(P_7\)-free bipartite graphs2017-08-31Paper
New results on word-representable graphs2016-11-24Paper
Vertex coloring of graphs with few obstructions2016-11-24Paper
Well-quasi-ordering Does Not Imply Bounded Clique-width2016-10-21Paper
Efficient domination through eigenvalues2016-09-30Paper
A Boundary Property for Upper Domination2016-09-29Paper
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes2016-09-29Paper
Graph parameters, Ramsey theory and the speed of hereditary properties2016-08-27Paper
Combinatorics and algorithms for augmenting graphs2016-07-28Paper
Deciding the Bell Number for Hereditary Graph Properties2016-05-26Paper
Words and graphs2015-12-16Paper
Bichain graphs: geometric model and universal graphs2015-12-10Paper
Labelled induced subgraphs and well-quasi-ordering2015-11-09Paper
A Dichotomy for Upper Domination in Monogenic Classes2015-09-11Paper
Deciding the Bell Number for Hereditary Graph Properties2015-09-09Paper
Well-quasi-order for permutation graphs omitting a path and a clique2015-05-18Paper
On the maximum independent set problem in subclasses of subcubic graphs2015-03-24Paper
Boundary Properties of Factorial Classes of Graphs2015-03-24Paper
Independent domination in finitely defined classes of graphs: polynomial algorithms2015-02-06Paper
Stable-\(\Pi\) partitions of graphs2015-02-06Paper
https://portal.mardi4nfdi.de/entity/Q29346762014-12-18Paper
Implicit representations and factorial properties of graphs2014-11-20Paper
Graphs without large apples and the maximum weight independent set problem2014-09-19Paper
Corrigendum to ``Locally bounded coverings and factorial properties of graphs2014-08-28Paper
Coloring vertices of claw-free graphs in three colors2014-07-11Paper
Split permutation graphs2014-06-16Paper
Boundary properties of the satisfiability problems2014-05-26Paper
Dominating induced matchings in graphs without a skew star2014-04-28Paper
UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS2014-01-28Paper
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs2014-01-17Paper
Boundary properties of well-quasi-ordered sets of graphs2013-11-22Paper
Parameterized complexity of the maximum independent set problem and the speed of hereditary properties2013-10-10Paper
New results on maximum induced matchings in bipartite graphs and beyond2013-06-06Paper
Critical properties of graphs of bounded clique-width2013-04-11Paper
Deciding WQO for Factorial Languages2013-03-18Paper
On hereditary properties of the class of graphs with convex quadratic stability number2012-11-28Paper
Maximum regular induced subgraphs in \(2P_3\)-free graphs2012-11-27Paper
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number2012-09-13Paper
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths2012-08-14Paper
On factorial properties of chordal bipartite graphs2012-08-10Paper
Locally bounded coverings and factorial properties of graphs2012-05-04Paper
Three approaches to data analysis. Test theory, rough sets and logical analysis of data.2012-04-23Paper
A decidability result for the dominating set problem2012-04-03Paper
Colouring vertices of triangle-free graphs without forests2012-03-16Paper
Minimal classes of graphs of unbounded clique-width2012-01-24Paper
Canonical antichains of unit interval and bipartite permutation graphs2011-12-13Paper
Stability preserving transformations of graphs2011-11-17Paper
A note on the speed of hereditary graph properties2011-10-18Paper
Two forbidden induced subgraphs and well-quasi-ordering2011-08-08Paper
Bipartite induced subgraphs and well-quasi-ordering2011-07-21Paper
Boundary properties of graphs for algorithmic graph problems2011-07-14Paper
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes2011-05-19Paper
On the complexity of the dominating induced matching problem in hereditary classes of graphs2011-04-19Paper
Independent Sets of Maximum Weight in Apple-Free Graphs2011-03-15Paper
On the Maximum Independent Set Problem in Subclasses of Planar Graphs2011-02-16Paper
Colouring Vertices of Triangle-Free Graphs2010-11-16Paper
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph2010-08-16Paper
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult2010-06-17Paper
Maximum independent sets in subclasses of \(P_{5}\)-free graphs2010-06-16Paper
https://portal.mardi4nfdi.de/entity/Q35687532010-06-15Paper
https://portal.mardi4nfdi.de/entity/Q35585982010-05-05Paper
Recent developments on graphs of bounded clique-width2010-04-28Paper
Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time2010-03-04Paper
On independent vertex sets in subclasses of apple-free graphs2010-02-23Paper
Dominating Induced Matchings2010-01-07Paper
Bipartite Graphs of Large Clique-Width2009-12-11Paper
Between 2- and 3-colorability2009-12-04Paper
Gearing optimization2009-08-12Paper
Some results on graphs without long induced paths2009-07-09Paper
Finding augmenting chains in extensions of claw-free graphs2009-03-23Paper
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph2009-02-23Paper
The Maximum Independent Set Problem in Planar Graphs2009-02-03Paper
A Note on k-Colorability of P 5-Free Graphs2009-02-03Paper
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph2009-01-29Paper
Independent Sets of Maximum Weight in Apple-Free Graphs2009-01-29Paper
https://portal.mardi4nfdi.de/entity/Q55034412009-01-15Paper
On finding augmenting graphs2008-11-19Paper
THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES2008-09-25Paper
Boundary Classes of Planar Graphs2008-07-21Paper
Tree-Width and Optimization in Bounded Degree Graphs2008-07-01Paper
Maximum \(k\)-regular induced subgraphs2008-04-23Paper
NP-hard graph problems and boundary classes of graphs2008-01-07Paper
Clique-width of unit interval graphs2007-09-12Paper
The relative clique-width of a graph2007-08-20Paper
https://portal.mardi4nfdi.de/entity/Q57555262007-08-13Paper
Polar graphs and maximal independent sets2007-01-09Paper
Clique-width for 4-vertex forbidden subgraphs2006-10-25Paper
Fundamentals of Computation Theory2006-10-20Paper
https://portal.mardi4nfdi.de/entity/Q54879032006-09-13Paper
Augmenting chains in graphs without a skew star.2006-05-18Paper
https://portal.mardi4nfdi.de/entity/Q57179532006-01-13Paper
Bisplit graphs2005-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54633592005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54634982005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q46676042005-04-20Paper
https://portal.mardi4nfdi.de/entity/Q46676252005-04-20Paper
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree2005-02-28Paper
Independent sets in extensions of 2\(K_{2}\)-free graphs2005-02-23Paper
Augmenting graphs for independent sets2005-01-31Paper
Boundary classes of graphs for the dominating set problem2004-08-19Paper
Chordal bipartite graphs of bounded tree- and clique-width2004-08-06Paper
Foreword: Special issue on stability in graphs and related topics2003-12-04Paper
Struction revisited2003-12-04Paper
Stable sets in two subclasses of banner-free graphs2003-12-04Paper
An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs2003-11-20Paper
Robust algorithms for the stable set problem2003-10-16Paper
The 3-Colorability Problem on Graphs with Maximum Degree Four2003-09-28Paper
https://portal.mardi4nfdi.de/entity/Q44259392003-09-14Paper
Independent domination in finitely defined classes of graphs2003-07-30Paper
On maximum induced matchings in bipartite graphs2003-06-24Paper
Independent sets of maximum weight in (\(p,q\))-colorable graphs.2003-05-25Paper
On the stable set problem in special \(P_{5}\)-free graphs2003-03-09Paper
Bipartite graphs without a skew star2002-12-02Paper
An attractive class of bipartite graphs2002-09-22Paper
https://portal.mardi4nfdi.de/entity/Q45363882002-06-25Paper
A note on \(\alpha\)-redundant vertices in graphs2001-09-03Paper
On orthogonal representations of graphs2001-06-04Paper
Conic reduction of graphs for the stable set problem2001-03-12Paper
On minimal universal graphs for hereditary classes2001-01-04Paper
https://portal.mardi4nfdi.de/entity/Q45174432000-11-21Paper
Stability in \(P_5\)- and banner-free graphs2000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q49492802000-05-08Paper
On the jump number problem in hereditary classes of bipartite graphs2000-01-01Paper
Local transformations of graphs preserving independence number1999-05-11Paper
https://portal.mardi4nfdi.de/entity/Q48528611996-03-17Paper
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructionsN/APaper

Research outcomes over time

This page was built for person: Vadim V. Lozin