Rémi Watrigant

Available identifiers

zbMath Open watrigant.remiMaRDI QIDQ260264

List of research outcomes

Publication	Date of Publication	Type
Twin-width. III: Max independent set, min dominating set, and coloring	2024-11-01	Paper
Approximating highly inapproximable problems on graphs of bounded twin-width	2024-10-08	Paper
1-extendability of independent sets	2024-03-25	Paper
Twin-width and polynomial kernels	2024-02-12	Paper
Twin-width. II: Small classes	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q5874491	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5875613	2023-02-03	Paper
Twin-width II: small classes	2022-11-23	Paper
Twin-width and polynomial kernels	2022-10-27	Paper
1-extendability of independent sets	2022-08-30	Paper
Overlaying a hypergraph with a graph with bounded maximum degree	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	2022-03-31	Paper
Parameterized complexity of independent set in \(H\)-free graphs	2021-08-04	Paper
Twin-width and polynomial kernels	2021-07-06	Paper
Parameterized complexity of independent set in H-free graphs	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	2020-07-21	Paper
Parameterized resiliency problems	2019-10-18	Paper
Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem	2019-01-18	Paper
Multidimensional binary vector assignment problem: standard, structural and above guarantee parameterizations	2018-12-10	Paper
Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem	2018-06-15	Paper
Parameterized resiliency problems via integer linear programming	2017-07-21	Paper
A multivariate approach for checking resiliency in access control	2016-11-09	Paper
Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs	2016-03-21	Paper
Multidimensional binary vector assignment problem: standard, structural and above guarantee parameterizations	2015-09-29	Paper
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs	2015-01-13	Paper
Approximating the sparsest \(k\)-subgraph in chordal graphs	2014-09-02	Paper
On the sum-max graph partitioning problem	2014-06-06	Paper
Sum-max graph partitioning problem	2012-11-02	Paper
Beyond recognizing well-covered graphs	N/A	Paper

Research outcomes over time

This page was built for person: Rémi Watrigant