| Publication | Date of Publication | Type |
|---|
| On the complexity of locally rainbow path | 2026-02-26 | Paper |
Core stability in additively separable hedonic games of low treewidth
Journal of Computer and System Sciences | 2026-02-11 | Paper |
Faster winner determination algorithms for (colored) Arc Kayles
Journal of Computer and System Sciences | 2025-12-11 | Paper |
On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes
Theoretical Computer Science | 2025-09-16 | Paper |
| Shortest beer path queries based on graph decomposition | 2025-07-24 | Paper |
Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs
Discrete Applied Mathematics | 2025-06-30 | Paper |
| Hedonic games and treewidth revisited | 2025-06-19 | Paper |
An improved spectral lower bound of treewidth
Information Processing Letters | 2025-01-14 | Paper |
Structural parameterizations of vertex integrity
Theoretical Computer Science | 2024-12-12 | Paper |
| Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs | 2024-09-16 | Paper |
| Structural parameterizations of vertex integrity (best paper) | 2024-07-19 | Paper |
| On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes | 2024-07-19 | Paper |
Grouped domination parameterized by vertex cover, twin cover, and beyond
Theoretical Computer Science | 2024-04-04 | Paper |
Winner determination algorithms for graph games with matching structures
Algorithmica | 2024-03-25 | Paper |
| In)approximability of Maximum Minimal FVS | 2023-11-14 | Paper |
Grouped domination parameterized by vertex cover, twin cover, and beyond
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Corrigendum to: ``Complexity and approximability of the happy set problem''
Theoretical Computer Science | 2023-09-21 | Paper |
Exploring the gap between treedepth and vertex cover through vertex integrity
Lecture Notes in Computer Science | 2023-03-22 | Paper |
scientific article; zbMATH DE number 7650221 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Computing densest \(k\)-subgraph with structural parameters
Journal of Combinatorial Optimization | 2022-12-29 | Paper |
Computing L(p,1)-Labeling with Combined Parameters
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
Parameterized Complexity of $$(A,\ell )$$-Path Packing
Lecture Notes in Computer Science | 2022-10-13 | Paper |
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality
Discrete Applied Mathematics | 2022-09-15 | Paper |
| Winner determination algorithms for graph games with matching structures | 2022-08-30 | Paper |
Exploring the gap between treedepth and vertex cover through vertex integrity
Theoretical Computer Science | 2022-05-10 | Paper |
An improved deterministic parameterized algorithm for cactus vertex deletion
Theory of Computing Systems | 2022-05-09 | Paper |
Parameterized complexity of \((A,\ell)\)-path packing
Algorithmica | 2022-03-22 | Paper |
(In)approximability of maximum minimal FVS
Journal of Computer and System Sciences | 2021-11-25 | Paper |
(In)approximability of maximum minimal FVS
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Computing \(L(p, 1)\)-labeling with combined parameters
(available as arXiv preprint) | 2021-10-04 | Paper |
Parameterized algorithms for the happy set problem
Discrete Applied Mathematics | 2021-09-30 | Paper |
New results on directed edge dominating set
(available as arXiv preprint) | 2021-08-04 | Paper |
An optimal algorithm for bisection for bounded-treewidth graph
(available as arXiv preprint) | 2021-07-08 | Paper |
A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs
Theoretical Computer Science | 2021-06-22 | Paper |
| Graph classes and approximability of the happy set problem | 2021-04-21 | Paper |
Computing the largest bond and the maximum connected cut of a graph
Algorithmica | 2021-04-19 | Paper |
Complexity and approximability of the happy set problem
Theoretical Computer Science | 2021-04-14 | Paper |
Finding a maximum minimal separator: graph classes and fixed-parameter tractability
Theoretical Computer Science | 2021-04-08 | Paper |
| On directed covering and domination problems | 2020-11-25 | Paper |
Subgraph isomorphism on graph classes that exclude a substructure
Algorithmica | 2020-11-11 | Paper |
Parameterized complexity of safe set
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
Independent set reconfiguration parameterized by modular-width
Algorithmica | 2020-09-03 | Paper |
| Parameterized orientable deletion | 2020-08-25 | Paper |
Parameterized algorithms for the happy set problem
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Parameterized orientable deletion
Algorithmica | 2020-05-21 | Paper |
Parameterized orientable deletion
Algorithmica | 2020-05-21 | Paper |
Independent set reconfiguration parameterized by modular-width
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Parameterized complexity of safe set
(available as arXiv preprint) | 2020-02-06 | Paper |
Subgraph isomorphism on graph classes that exclude a substructure
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Reconfiguring spanning and induced subgraphs
Theoretical Computer Science | 2020-01-16 | Paper |
On the maximum weight minimal separator
Theoretical Computer Science | 2019-11-13 | Paper |
Optimal partition of a tree with social distance
(available as arXiv preprint) | 2019-10-15 | Paper |
On directed covering and domination problems
Discrete Applied Mathematics | 2019-03-28 | Paper |
Reconfiguring spanning and induced subgraphs
Lecture Notes in Computer Science | 2018-10-04 | Paper |
On the maximum weight minimal separator
Lecture Notes in Computer Science | 2017-05-19 | Paper |
An improved spectral lower bound of treewidth
(available as arXiv preprint) | N/A | Paper |
