| Publication | Date of Publication | Type |
|---|
Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time
Theoretical Computer Science | 2024-02-20 | Paper |
Combining decomposition approaches for the maximum weight stable set problem
Theoretical Computer Science | 2023-05-19 | Paper |
New results on independent sets in extensions of \(2K_2\)-free graphs
Graphs and Combinatorics | 2022-08-02 | Paper |
Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time
Discussiones Mathematicae Graph Theory | 2022-07-26 | Paper |
Independent sets in \((P_4+P_4\),triangle)-free graphs
Graphs and Combinatorics | 2021-11-30 | Paper |
Maximum weight independent sets for (\(S_{1,2,4}\), triangle)-free graphs in polynomial time
Theoretical Computer Science | 2021-07-22 | Paper |
Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time
Discrete Applied Mathematics | 2020-07-07 | Paper |
Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
Discrete Applied Mathematics | 2020-06-29 | Paper |
On efficient domination for some classes of \(H\)-free chordal graphs
Discrete Applied Mathematics | 2020-05-29 | Paper |
Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs
Discrete Applied Mathematics | 2020-04-21 | Paper |
Independent domination versus weighted independent domination
Information Processing Letters | 2020-02-11 | Paper |
On efficient domination for some classes of \(H\)-free bipartite graphs
Discrete Applied Mathematics | 2019-11-06 | Paper |
Sparse regular induced subgraphs in \(2P_3\)-free graphs
Discrete Optimization | 2018-10-18 | Paper |
On efficient domination for some classes of \(H\)-free chordal graphs
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time
Discrete Applied Mathematics | 2018-02-22 | Paper |
Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
Discrete Applied Mathematics | 2018-01-11 | Paper |
New results on weighted independent domination
| 2018-01-04 | Paper |
More results on weighted independent domination
Theoretical Computer Science | 2017-10-17 | Paper |
Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
Algorithmica | 2017-05-02 | Paper |
Weighted efficient domination for \(P_5\)-free and \(P_6\)-free graphs
SIAM Journal on Discrete Mathematics | 2017-01-04 | Paper |
Weighted efficient domination for \(P_6\)-free and for \(P_5\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
A sufficient condition to extend polynomial results for the maximum independent set problem
Discrete Applied Mathematics | 2016-11-24 | Paper |
Bounded Clique-Width of ($S_{1,2,2}$,Triangle)-Free Graphs
| 2016-08-05 | Paper |
Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
Information Processing Letters | 2016-06-01 | Paper |
Maximum weight independent sets in odd-hole-free graphs without dart or without bull
Graphs and Combinatorics | 2015-09-24 | Paper |
Polynomial time recognition of essential graphs having stability number equal to matching number
Graphs and Combinatorics | 2015-09-24 | Paper |
Independent domination in finitely defined classes of graphs: polynomial algorithms
Discrete Applied Mathematics | 2015-02-06 | Paper |
Dominating induced matchings for \(P_7\)-free graphs in linear time
Algorithmica | 2014-12-02 | Paper |
The stable set polytope of ($P_6$,triangle)-free graphs and new facet-inducing graphs
| 2014-04-30 | Paper |
Some results on stable sets for \(k\)-colorable \(P_{6}\)-free graphs and generalizations
| 2014-03-25 | Paper |
Maximum weight independent sets in (\(P_6\), co-banner)-free graphs
Information Processing Letters | 2013-03-20 | Paper |
Maximum regular induced subgraphs in \(2P_3\)-free graphs
Theoretical Computer Science | 2012-11-27 | Paper |
Stable sets for (P_{6}, K_{2,3})-free graphs
Discussiones Mathematicae Graph Theory | 2012-11-16 | Paper |
Dominating induced matchings for \(P _{7}\)-free graphs in linear time
Algorithms and Computation | 2011-12-16 | Paper |
On distance-3 matchings and induced matchings
Discrete Applied Mathematics | 2011-04-19 | Paper |
Independent sets of maximum weight in apple-free graphs
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
scientific article; zbMATH DE number 5761816 (Why is no real title available?)
| 2010-07-27 | Paper |
Maximum independent sets in subclasses of \(P_{5}\)-free graphs
Information Processing Letters | 2010-06-16 | Paper |
On independent vertex sets in subclasses of apple-free graphs
Algorithmica | 2010-02-23 | Paper |
On distance-3 matchings and induced matchings
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
Independent Sets of Maximum Weight in Apple-Free Graphs
Algorithms and Computation | 2009-01-29 | Paper |
The stable set polytope for some extensions of \(P_4\)-free graphs
Discrete Mathematics | 2009-01-28 | Paper |
On stable cutsets in claw-free graphs and planar graphs
Journal of Discrete Algorithms | 2008-08-08 | Paper |
How to allocate hard candies fairly
Mathematical Social Sciences | 2007-12-14 | Paper |
Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
Discrete Mathematics | 2007-12-12 | Paper |
Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
Discrete Mathematics | 2007-11-27 | Paper |
Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
European Journal of Operational Research | 2007-10-10 | Paper |
Polar graphs and maximal independent sets
Discrete Mathematics | 2007-01-09 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
New graph classes of bounded clique-width
Theory of Computing Systems | 2006-02-08 | Paper |
GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Independent sets in extensions of 2\(K_{2}\)-free graphs
Discrete Applied Mathematics | 2005-02-23 | Paper |
Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics | 2005-02-22 | Paper |
On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
Discrete Applied Mathematics | 2003-12-04 | Paper |
Some results on maximum stable sets in certain \(P_{5}\)-free graphs
Discrete Applied Mathematics | 2003-12-04 | Paper |
On variations of \(P_{4}\)-sparse graphs
Discrete Applied Mathematics | 2003-09-09 | Paper |
scientific article; zbMATH DE number 1953082 (Why is no real title available?)
| 2003-07-25 | Paper |
A property about minimum edge- and minimum clique-cover of a graph
Graphs and Combinatorics | 2003-05-11 | Paper |
On (\(P_{5}\), diamond)-free graphs
Discrete Mathematics | 2002-08-29 | Paper |
A shy invariant of graphs
Graphs and Combinatorics | 2002-07-29 | Paper |
Stable sets in certain \(P_6\)-free graphs
Discrete Applied Mathematics | 2000-01-11 | Paper |
scientific article; zbMATH DE number 1339492 (Why is no real title available?)
| 1999-11-23 | Paper |
