Rémi Watrigant

From MaRDI portal
Person:260264

Available identifiers

zbMath Open watrigant.remiMaRDI QIDQ260264

List of research outcomes





PublicationDate of PublicationType
Twin-width. III: Max independent set, min dominating set, and coloring2024-11-01Paper
Approximating highly inapproximable problems on graphs of bounded twin-width2024-10-08Paper
1-extendability of independent sets2024-03-25Paper
https://portal.mardi4nfdi.de/entity/Q61924782024-02-12Paper
https://portal.mardi4nfdi.de/entity/Q61473742024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q58744912023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58756132023-02-03Paper
Twin-width II: small classes2022-11-23Paper
Twin-width and polynomial kernels2022-10-27Paper
1-extendability of independent sets2022-08-30Paper
Overlaying a hypergraph with a graph with bounded maximum degree2022-08-04Paper
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width2022-07-15Paper
Twin-width I: Tractable FO Model Checking2022-03-31Paper
Parameterized Complexity of Independent Set in H-Free Graphs.2021-08-04Paper
Twin-width and polynomial kernels2021-07-06Paper
Parameterized complexity of independent set in H-free graphs2020-08-12Paper
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring2020-07-28Paper
Overlaying a hypergraph with a graph with bounded maximum degree2020-07-21Paper
Parameterized resiliency problems2019-10-18Paper
Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem2019-01-18Paper
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations2018-12-10Paper
Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem2018-06-15Paper
Parameterized Resiliency Problems via Integer Linear Programming2017-07-21Paper
A Multivariate Approach for Checking Resiliency in Access Control2016-11-09Paper
Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs2016-03-21Paper
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations2015-09-29Paper
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs2015-01-13Paper
Approximating the Sparsest k-Subgraph in Chordal Graphs2014-09-02Paper
On the sum-max graph partitioning problem2014-06-06Paper
Sum-Max Graph Partitioning Problem2012-11-02Paper
Beyond recognizing well-covered graphsN/APaper

Research outcomes over time

This page was built for person: Rémi Watrigant