| Publication | Date of Publication | Type |
|---|
\( \gamma \)-clustering problems: classical and parametrized complexity
Theoretical Computer Science | 2024-10-08 | Paper |
Composing dynamic programming tree-decomposition-based algorithms
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-17 | Paper |
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
Theoretical Computer Science | 2024-02-20 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Networks | 2023-11-15 | Paper |
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
SIAM Journal on Computing | 2023-08-10 | Paper |
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree
Discrete Mathematics & Theoretical Computer Science | 2023-05-30 | Paper |
Contraction Bidimensionality of Geometric Intersection Graphs
| 2022-07-20 | Paper |
Acyclic matchings in graphs of bounded maximum degree
Discrete Mathematics | 2022-05-17 | Paper |
Contraction bidimensionality of geometric intersection graphs
Algorithmica | 2022-03-25 | Paper |
Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
Artificial Intelligence | 2022-03-02 | Paper |
Minimum reload cost graph factors
Theory of Computing Systems | 2021-08-05 | Paper |
A complexity dichotomy for hitting small planar minors parameterized by treewidth
| 2021-08-04 | Paper |
Approximating maximum acyclic matchings by greedy and local search strategies
| 2021-04-21 | Paper |
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Bounding and approximating minimum maximal matchings in regular graphs
Discrete Mathematics | 2021-01-27 | Paper |
Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier
Discrete Optimization | 2021-01-15 | Paper |
Hitting minors on bounded treewidth graphs. I: General upper bounds
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Minimum reload cost graph factors
Lecture Notes in Computer Science | 2020-10-22 | Paper |
Domination versus edge domination
Discrete Applied Mathematics | 2020-08-31 | Paper |
Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
| 2020-05-27 | Paper |
Contraction-bidimensionality of geometric intersection graphs
| 2020-05-27 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
| 2020-05-27 | Paper |
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
Theoretical Computer Science | 2020-03-12 | Paper |
Hitting minors on bounded treewidth graphs. III. Lower bounds
Journal of Computer and System Sciences | 2020-02-24 | Paper |
Temporal matching
Theoretical Computer Science | 2020-01-16 | Paper |
Approximating maximum uniquely restricted matchings in bipartite graphs
Discrete Applied Mathematics | 2019-09-05 | Paper |
Upper bounds on the uniquely restricted chromatic index
Journal of Graph Theory | 2019-08-15 | Paper |
On the number of labeled graphs of bounded treewidth
European Journal of Combinatorics | 2018-05-18 | Paper |
Ruling out FPT algorithms for weighted coloring on forests
Theoretical Computer Science | 2018-05-17 | Paper |
Ruling out FPT algorithms for weighted coloring on forests
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
Degenerate matchings and edge colorings
Discrete Applied Mathematics | 2018-03-21 | Paper |
Uniquely restricted matchings and edge colorings
| 2018-01-04 | Paper |
On the number of labeled graphs of bounded treewidth
Lecture Notes in Computer Science | 2018-01-04 | Paper |
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Bulletin of Mathematical Biology | 2017-10-20 | Paper |
Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
Theory of Computing Systems | 2017-10-12 | Paper |
On the parameterized complexity of the edge monitoring problem
Information Processing Letters | 2017-02-21 | Paper |
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Lecture Notes in Computer Science | 2016-11-09 | Paper |
The role of planarity in connectivity problems parameterized by treewidth
Lecture Notes in Computer Science | 2015-09-15 | Paper |
The role of planarity in connectivity problems parameterized by treewidth
Theoretical Computer Science | 2015-01-30 | Paper |
