| Publication | Date of Publication | Type |
|---|
Channel allocation revisited through 1-extendability of graphs
Theoretical Computer Science | 2025-09-16 | Paper |
| Twin-width. I: Tractable FO model checking | 2025-08-12 | Paper |
| Beyond recognizing well-covered graphs | 2025-05-02 | Paper |
Twin-width. III: Max independent set, min dominating set, and coloring
SIAM Journal on Computing | 2024-11-01 | Paper |
| Approximating highly inapproximable problems on graphs of bounded twin-width | 2024-10-08 | Paper |
1-extendability of independent sets
Algorithmica | 2024-03-25 | Paper |
| Twin-width and polynomial kernels | 2024-02-12 | Paper |
| Twin-width. II: Small classes | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7651162 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650282 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Twin-width II: small classes
Combinatorial Theory | 2022-11-23 | Paper |
Twin-width and polynomial kernels
Algorithmica | 2022-10-27 | Paper |
1-extendability of independent sets
(available as arXiv preprint) | 2022-08-30 | Paper |
Overlaying a hypergraph with a graph with bounded maximum degree
Discrete Applied Mathematics | 2022-08-04 | Paper |
| Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width | 2022-07-15 | Paper |
Twin-width. I: Tractable FO model checking
Journal of the ACM | 2022-03-31 | Paper |
| Parameterized complexity of independent set in \(H\)-free graphs | 2021-08-04 | Paper |
Twin-width and polynomial kernels
(available as arXiv preprint) | 2021-07-06 | Paper |
Parameterized complexity of independent set in H-free graphs
Algorithmica | 2020-08-12 | Paper |
| Twin-width III: Max Independent Set, Min Dominating Set, and Coloring | 2020-07-28 | Paper |
Overlaying a hypergraph with a graph with bounded maximum degree
Algorithms and Discrete Applied Mathematics | 2020-07-21 | Paper |
Parameterized resiliency problems
Theoretical Computer Science | 2019-10-18 | Paper |
Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
Journal of Discrete Algorithms | 2019-01-18 | Paper |
Multidimensional binary vector assignment problem: standard, structural and above guarantee parameterizations
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2018-12-10 | Paper |
Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem
(available as arXiv preprint) | 2018-06-15 | Paper |
Parameterized resiliency problems via integer linear programming
Lecture Notes in Computer Science | 2017-07-21 | Paper |
A multivariate approach for checking resiliency in access control
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs
Theory of Computing Systems | 2016-03-21 | Paper |
Multidimensional binary vector assignment problem: standard, structural and above guarantee parameterizations
Lecture Notes in Computer Science | 2015-09-29 | Paper |
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Approximating the sparsest \(k\)-subgraph in chordal graphs
Approximation and Online Algorithms | 2014-09-02 | Paper |
On the sum-max graph partitioning problem
Theoretical Computer Science | 2014-06-06 | Paper |
Sum-max graph partitioning problem
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Beyond recognizing well-covered graphs
(available as arXiv preprint) | N/A | Paper |
