| Publication | Date of Publication | Type |
|---|
| On the maximum number of maximum dissociation sets in trees with given dissociation number | 2024-03-27 | Paper |
| The maximum number of maximum dissociation sets in trees | 2023-09-29 | Paper |
| Maximum dissociation sets in subcubic trees | 2023-08-22 | Paper |
| Edge-diameter of a graph and its longest cycles | 2023-08-21 | Paper |
| Maximizing the number of independent sets in claw-free cubic graphs | 2023-04-21 | Paper |
| Maximal and maximum dissociation sets in general and triangle-free graphs | 2022-05-23 | Paper |
| Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree | 2022-04-25 | Paper |
| A Survey on the k-Path Vertex Cover Problem | 2022-01-10 | Paper |
| On tree-connectivity and path-connectivity of graphs | 2021-11-30 | Paper |
| On graph entropy measures based on the number of independent sets and matchings | 2021-03-31 | Paper |
| Maximal and Maximum Dissociation Sets in General and Triangle-Free Graphs | 2021-03-01 | Paper |
| An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth | 2020-01-13 | Paper |
| Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs | 2020-01-09 | Paper |
| The Turán number of star forests | 2019-11-26 | Paper |
| A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem | 2019-11-26 | Paper |
| Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth | 2019-11-12 | Paper |
| Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index | 2019-09-02 | Paper |
| On the complexity of \(k\)-rainbow cycle colouring problems | 2019-06-20 | Paper |
| Efficient algorithm for the vertex cover \(P_k\) problem on cacti | 2019-04-29 | Paper |
| A kind of conditional connectivity of Cayley graphs generated by wheel graphs | 2019-03-28 | Paper |
| The generalized 3-connectivity of star graphs and bubble-sort graphs | 2019-03-19 | Paper |
| The unicyclic graphs with maximum degree resistance distance | 2019-03-18 | Paper |
| An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs | 2018-12-05 | Paper |
| Inertia of complex unit gain graphs | 2018-08-24 | Paper |
| The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles | 2017-12-12 | Paper |
| On the vertex cover \(P_3\) problem parameterized by treewidth | 2017-10-17 | Paper |
| Bicyclic graphs with maximum degree resistance distance | 2017-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2828866 | 2016-10-26 | Paper |
| An FPT algorithm for the vertex cover \(P_4\) problem | 2016-01-21 | Paper |
| The degree resistance distance of cacti | 2015-05-22 | Paper |
| A fixed-parameter algorithm for the vertex cover \(P_3\) problem | 2014-12-09 | Paper |
| A 2-approximation algorithm for the vertex coverP4problem in cubic graphs | 2014-11-28 | Paper |
| An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem | 2014-08-29 | Paper |
| Rainbow numbers for matchings in plane triangulations | 2014-08-08 | Paper |
| The vertex cover \(P_3\) problem in cubic graphs | 2014-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5408295 | 2014-04-09 | Paper |
| A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem | 2013-04-04 | Paper |
| A primal-dual approximation algorithm for the vertex cover \(P^3\) problem | 2011-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3403696 | 2010-02-12 | Paper |
| Complete solution for the rainbow numbers of matchings | 2009-06-23 | Paper |
| Bipartite rainbow numbers of matchings | 2009-06-19 | Paper |
| Heterochromatic tree partition numbers for complete bipartite graphs | 2008-07-11 | Paper |
| NP-completeness of 4-incidence colorability of semi-cubic graphs | 2008-02-11 | Paper |
| Heterochromatic tree partition number of a complete multipartite graph | 2005-11-22 | Paper |
