| Publication | Date of Publication | Type |
|---|
Well-indumatched pseudoforests
Discrete Applied Mathematics | 2025-01-06 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Networks | 2023-11-15 | Paper |
Triangle‐free equimatchable graphs
Journal of Graph Theory | 2023-10-05 | Paper |
Equimatchable bipartite graphs
Discussiones Mathematicae Graph Theory | 2022-12-02 | Paper |
Paired domination versus domination and packing number in graphs
Journal of Combinatorial Optimization | 2022-08-19 | Paper |
\((C_3, C_4, C_5, C_7)\)-free almost well-dominated graphs
Discussiones Mathematicae Graph Theory | 2022-07-26 | Paper |
Well-totally-dominated graphs
Ars Mathematica Contemporanea | 2022-03-24 | Paper |
Upper paired domination versus upper domination
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
Upper paired domination versus upper domination
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
Edge-Critical Equimatchable Bipartite Graphs
Mathematical Aspects of Computer and Information Sciences | 2021-12-08 | Paper |
Minimum reload cost graph factors
Theory of Computing Systems | 2021-08-05 | Paper |
Almost well-dominated bipartite graphs with minimum degree at least two
RAIRO - Operations Research | 2021-07-27 | Paper |
On graphs all of whose total dominating sequences have the same length
Discrete Mathematics | 2021-07-08 | Paper |
Minimum reload cost graph factors
Lecture Notes in Computer Science | 2020-10-22 | Paper |
| Total $k$-Uniform Graphs | 2020-10-16 | Paper |
Mind the independence gap
Discrete Mathematics | 2020-07-08 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
(available as arXiv preprint) | 2020-05-27 | Paper |
Minimum reload cost cycle cover in complete graphs
Networks | 2019-10-31 | Paper |
Complexity of edge coloring with minimum reload/changeover costs
Networks | 2019-07-30 | Paper |
On a class of graphs with large total domination number
(available as arXiv preprint) | 2018-12-10 | Paper |
| On a class of graphs with large total domination number | 2018-12-10 | Paper |
On almost well-covered graphs of girth at least 6
(available as arXiv preprint) | 2018-12-10 | Paper |
| On almost well-covered graphs of girth at least 6 | 2018-12-10 | Paper |
On one extension of Dirac's theorem on Hamiltonicity
Discrete Applied Mathematics | 2018-12-10 | Paper |
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
(available as arXiv preprint) | 2018-11-30 | Paper |
| Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs | 2018-11-30 | Paper |
Equimatchable claw-free graphs
Discrete Mathematics | 2018-08-15 | Paper |
On matching extendability of lexicographic products
RAIRO - Operations Research | 2018-02-23 | Paper |
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability
Theoretical Computer Science | 2017-08-24 | Paper |
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
Lecture Notes in Computer Science | 2016-12-22 | Paper |
Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
Discrete Mathematics | 2016-08-16 | Paper |
Constructing minimum changeover cost arborescenses in bounded treewidth graphs
Theoretical Computer Science | 2016-02-26 | Paper |
On the complexity of constructing minimum changeover cost arborescences
Theoretical Computer Science | 2014-06-06 | Paper |
