Vadim V. Lozin

Theor. Comput. Sci., 2025

Vector Spaces of Graphs Closed Under Isomorphism.

[BibT_eX]

[DOI]

D. V. Zakharova

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

Monotone Classes, Even Graphs and the Hamiltonian Cycle Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

2024

Ramsey Numbers and Graph Parameters.

[BibT_eX]

[DOI]

Graphs Comb., April, 2024

The Treewidth and Pathwidth of Graph Unions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

Union-closed sets and Horn Boolean functions.

[BibT_eX]

[DOI]

J. Comb. Theory A, February, 2024

Critical properties of bipartite permutation graphs.

[BibT_eX]

[DOI]

Dmitriy S. Malyshev

J. Graph Theory, January, 2024

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

CoRR, 2024

The Hamiltonian Cycle Problem and Monotone Classes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023

Hereditary classes of graphs: A parametric approach.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

Functionality of box intersection graphs.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Letter Graphs and Geometric Grid Classes of Permutations.

[BibT_eX]

[DOI]

Robert Ferguson

Mamadou Moustapha Kanté

Vincent Vatter

SIAM J. Discret. Math., December, 2022

On Boolean threshold functions with minimum specification number.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Tree-width dichotomy.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Graph Parameters, Implicit Representations and Factorial Properties.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Deciding Atomicity of Subword-Closed Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

Graph classes with linear Ramsey numbers.

[BibT_eX]

[DOI]

Discret. Math., 2021

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Critical Properties and Complexity Measures of Read-Once Boolean Functions.

[BibT_eX]

[DOI]

Mikhail Moshkov

Ann. Math. Artif. Intell., 2021

Combinatorics and Algorithms for Quasi-chain Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Independent domination versus weighted independent domination.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Between clique-width and linear clique-width of bipartite graphs.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Discret. Math., 2020

The Micro-world of Cographs.

[BibT_eX]

[DOI]

Dominique de Werra

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Recent advances in the theory and practice of Logical Analysis of Data.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Maximum Independent Sets in Subcubic Graphs: New Results.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Graph Functionality.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

From Words to Graphs, and Back.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2019

2018

Dominating induced matchings in graphs containing no long claw.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Well-quasi-ordering versus clique-width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Linear read-once and related Boolean functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Infinitely many minimal classes of graphs of unbounded clique-width.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Perfect edge domination: hard and solvable cases.

[BibT_eX]

[DOI]

Min Chih Lin

Veronica A. Moyano

Jayme Luiz Szwarcfiter

Ann. Oper. Res., 2018

Upper Domination: Towards a Dichotomy Through Boundary Properties.

[BibT_eX]

[DOI]

Algorithmica, 2018

Linear Ramsey Numbers.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Linear Clique-Width of Bi-complement Reducible Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017

More results on weighted independent domination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

WQO is decidable for factorial languages.

[BibT_eX]

[DOI]

Mikhail Moshkov

Inf. Comput., 2017

The structure and the number of P7-free bipartite graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Vertex coloring of graphs with few obstructions.

[BibT_eX]

[DOI]

Dmitriy S. Malyshev

Discret. Appl. Math., 2017

From matchings to independent sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

New results on word-representable graphs.

[BibT_eX]

[DOI]

Andrew Collins

Sergey Kitaev

Discret. Appl. Math., 2017

New Results on Weighted Independent Domination.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes.

[BibT_eX]

[DOI]

Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Clique-Width for Graph Classes Closed under Complementation.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Graph Parameters and Ramsey Theory.

[BibT_eX]

[DOI]

Konrad Kazimierz Dabrowski

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Specifying a positive threshold function via extremal points.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016

Deciding the Bell Number for Hereditary Graph Properties.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Combinatorics and Algorithms for Augmenting Graphs.

[BibT_eX]

[DOI]

Dominique de Werra

Graphs Comb., 2016

Efficient domination through eigenvalues.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Bichain graphs: Geometric model and universal graphs.

[BibT_eX]

[DOI]

Robert Brignall

Juraj Stacho

Discret. Appl. Math., 2016

Independent Domination versus Weighted Independent Domination.

[BibT_eX]

[DOI]

CoRR, 2016

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.

[BibT_eX]

[DOI]

Daniël Paulusma

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

A Boundary Property for Upper Domination.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

Words and Graphs

[BibT_eX]

[DOI]

Sergey Kitaev

Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-319-25859-1, 2015

Labelled Induced Subgraphs and Well-Quasi-Ordering.

[BibT_eX]

[DOI]

Order, 2015

Boundary Properties of Factorial Classes of Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Implicit representations and factorial properties of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Independent domination in finitely defined classes of graphs: Polynomial algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Stable-iΠ partitions of graphs.

[BibT_eX]

[DOI]

Juraj Stacho

Discret. Appl. Math., 2015

Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering.

[BibT_eX]

[DOI]

CoRR, 2015

Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Well-quasi-ordering Does Not Imply Bounded Clique-width.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

Dominating induced matchings in graphs without a skew star.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Coloring vertices of claw-free graphs in three colors.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Graphs Without Large Apples and the Maximum Weight Independent Set Problem.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Split Permutation Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Corrigendum to "Locally bounded coverings and factorial properties of graphs" [European J. Combin. 33(2012) 534-543].

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

A Dichotomy for Upper Domination in Monogenic Classes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Three Approaches to Data Analysis - Test Theory, Rough Sets and Logical Analysis of Data

[BibT_eX]

[DOI]

Intelligent Systems Reference Library 41, Springer, ISBN: 978-3-642-28666-7, 2013

New results on maximum induced matchings in bipartite graphs and beyond.

[BibT_eX]

[DOI]

Marc Demange

Theor. Comput. Sci., 2013

Boundary Properties of Well-Quasi-Ordered Sets of Graphs.

[BibT_eX]

[DOI]

Order, 2013

Boundary properties of the satisfiability problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Universal graphs and Universal Permutations.

[BibT_eX]

[DOI]

Sergey Kitaev

Alexandr Valyuzhenich

Discret. Math. Algorithms Appl., 2013

Critical properties of graphs of bounded clique-width.

[BibT_eX]

[DOI]

Discret. Math., 2013

Sparse regular induced subgraphs in 2P3-free graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2013

GO VII Meeting, Ovronnaz (CH), June 13-17, 2010.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Deciding WQO for Factorial Languages.

[BibT_eX]

[DOI]

Mikhail Moshkov

Proceedings of the Language and Automata Theory and Applications, 2013

On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs.

[BibT_eX]

[DOI]

Jérôme Monnot

Bernard Ries

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

Maximum regular induced subgraphs in 2 P3-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Locally bounded coverings and factorial properties of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

On factorial properties of chordal bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Colouring vertices of triangle-free graphs without forests.

[BibT_eX]

[DOI]

Discret. Math., 2012

Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011

Boundary properties of graphs for algorithmic graph problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Canonical Antichains of Unit Interval and Bipartite Permutation Graphs.

[BibT_eX]

[DOI]

Order, 2011

Bipartite induced subgraphs and well-quasi-ordering.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Two forbidden induced subgraphs and well-quasi-ordering.

[BibT_eX]

[DOI]

Discret. Math., 2011

On the complexity of the dominating induced matching problem in hereditary classes of graphs.

[BibT_eX]

[DOI]

Domingos Moreira Cardoso

Discret. Appl. Math., 2011

A Note on the Speed of Hereditary Graph Properties.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

Stability preserving transformations of graphs.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

2010

A decidability result for the dominating set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Independent Sets of Maximum Weight in Apple-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

On the Maximum Independent Set Problem in Subclasses of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Deciding k-Colorability of P5-Free Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Algorithmica, 2010

On Independent Vertex Sets in Subclasses of Apple-Free Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2010

Colouring Vertices of Triangle-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult.

[BibT_eX]

[DOI]

Alexander Tiskin

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Maximum independent sets in subclasses of P5-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Parameterized complexity of the maximum independent set problem and the speed of hereditary properties.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

DIMAP Workshop on Algorithmic Graph Theory.

[BibT_eX]

[DOI]

Arie M. C. A. Koster

Electron. Notes Discret. Math., 2009

Recent developments on graphs of bounded clique-width.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Clique-Width and the Speed of Hereditary Properties.

[BibT_eX]

[DOI]

Peter Allen

Michaël Rao

Electron. J. Comb., 2009

Bipartite Graphs of Large Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

A Note on the Parameterized Complexity of the Maximum Independent Set Problem.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Dominating Induced Matchings.

[BibT_eX]

[DOI]

Domingos Moreira Cardoso

Proceedings of the Graph Theory, 2009

2008

Graph Representation Functions Computable by Finite Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2008

The Clique-Width of Bipartite Graphs in Monogenic Classes.

[BibT_eX]

[DOI]

Jordan Volz

Int. J. Found. Comput. Sci., 2008

On finding augmenting graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Boundary Classes of Planar Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

A Note on k-Colorability of P5-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

The Maximum Independent Set Problem in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

From Tree-Width to Clique-Width: Excluding a Unit Interval Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Independent Sets of Maximum Weight in Apple-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

NP-hard graph problems and boundary classes of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

The relative clique-width of a graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Maximum k -regular induced subgraphs.

[BibT_eX]

[DOI]

Domingos Moreira Cardoso

J. Comb. Optim., 2007

Deciding k-colourability of P_5-free graphs in polynomial time

[BibT_eX]

[DOI]

CoRR, 2007

Coloring edges and vertices of graphs without short or long cycles.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2007

Minimal Universal Bipartite Graphs.

[BibT_eX]

Gábor Rudolf

Ars Comb., 2007

Vertex 3-colorability of Claw-free Graphs.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2007

Tree-Width and Optimization in Bounded Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Maximum independent sets in graphs of low degree.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On the maximum independent set problem in subclasses of planar and more general graphs.

[BibT_eX]

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006

Clique-Width for 4-Vertex Forbidden Subgraphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Augmenting chains in graphs without a skew star.

[BibT_eX]

[DOI]

Alain Hertz

J. Comb. Theory B, 2006

Polar graphs and maximal independent sets.

[BibT_eX]

[DOI]

Discret. Math., 2006

Polynomial-time algorithm for vertex k-colorability of P_5-free graphs

[BibT_eX]

[DOI]

CoRR, 2006

The tree- and clique-width of bipartite graphs in special classes.

[BibT_eX]

[DOI]

Australas. J Comb., 2006

A polynomial algorithm to find an independent set of maximum weight in a fork-free graph.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Between 2- and 3-colorability.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Graphs of low chordality.

[BibT_eX]

[DOI]

L. Sunil Chandran

C. R. Subramanian

Discret. Math. Theor. Comput. Sci., 2005

Bisplit graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

Independent sets in extensions of 2K2-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Clique-Width for Four-Vertex Forbidden Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

New Results on Generalized Graph Coloring.

[BibT_eX]

[DOI]

Alastair Farrugia

Discret. Math. Theor. Comput. Sci., 2004

Chordal bipartite graphs of bounded tree- and clique-width.

[BibT_eX]

[DOI]

Discret. Math., 2004

Boundary classes of graphs for the dominating set problem.

[BibT_eX]

[DOI]

Dmitry V. Korobitsyn

Discret. Math., 2004

Augmenting graphs for independent sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Local transformations of graphs preserving independence number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

On computing the dissociation number and the induced matching number of bipartite graphs.

[BibT_eX]

Kathie Cameron

Ars Comb., 2004

2003

Independent domination in finitely defined classes of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

The 3-Colorability Problem on Graphs with Maximum Degree Four.

[BibT_eX]

[DOI]

Martin Kochol

Bert Randerath

SIAM J. Comput., 2003

Some results on graphs without long induced paths.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Finding augmenting chains in extensions of claw-free graphs.

[BibT_eX]

[DOI]

Alain Hertz

David Schindl

Inf. Process. Lett., 2003

Robust Algorithms for the Stable Set Problem.

[BibT_eX]

[DOI]

Graphs Comb., 2003

Independent sets of maximum weight in (p, q)-colorable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

Special issue on stability in graphs and related topics.

[BibT_eX]

[DOI]

Dominique de Werra

Discret. Appl. Math., 2003

On the stable set problem in special P5-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Stable sets in two subclasses of banner-free graphs.

[BibT_eX]

[DOI]

Alain Hertz

Discret. Appl. Math., 2003

An augmenting graph approach to the stable set problem in P5-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Struction revisited.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

On the linear structure and clique-width of bipartite permutation graphs.

[BibT_eX]

Ars Comb., 2003

2002

On maximum induced matchings in bipartite graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Bipartite graphs without a skew star.

[BibT_eX]

[DOI]

Discret. Math., 2002

On the Clique-Width of Graphs in Hereditary Classes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

An attractive class of bipartite graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2001

On orthogonal representations of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

A note on alpha-redundant vertices in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

On the Jump Number Problem in Hereditary Classes of Bipartite Graphs.

[BibT_eX]

[DOI]

Order, 2000

Stability in P5- and banner-free graphs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

Conic reduction of graphs for the stable set problem.

[BibT_eX]

[DOI]

Discret. Math., 2000

On a Generalization of Bi-Complement Reducible Graphs.

[BibT_eX]

[DOI]