The following pages link to Rémi Watrigant (Q260264):
Displaying 19 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem (Q1642689) (← links)
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- On the sum-max graph partitioning problem (Q2453173) (← links)
- A Multivariate Approach for Checking Resiliency in Access Control (Q2830068) (← links)
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)
- Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
- Sum-Max Graph Partitioning Problem (Q3167634) (← links)
- Approximating the Sparsest k-Subgraph in Chordal Graphs (Q3188867) (← links)
- Parameterized Complexity of Independent Set in H-Free Graphs. (Q5009479) (← links)
- Twin-width I: Tractable FO Model Checking (Q5066940) (← links)
- (Q5874491) (← links)
- (Q5875613) (← links)
- 1-extendability of independent sets (Q6119830) (← links)
- (Q6192478) (← links)
