Rémi Watrigant

According to our database1, Rémi Watrigant authored at least 28 papers between 2014 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Twin-width I: Tractable FO Model Checking.
J. ACM, 2022

Overlaying a hypergraph with a graph with bounded maximum degree.
Discret. Appl. Math., 2022

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width.
CoRR, 2022

1-Extendability of Independent Sets.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Twin-width II: small classes.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Twin-Width and Polynomial Kernels.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Twin-width III: Max Independent Set, Min Dominating Set, and Coloring.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

The Authorization Policy Existence Problem.
IEEE Trans. Dependable Secur. Comput., 2020

Twin-width III: Max Independent Set and Coloring.
CoRR, 2020

Parameterized Complexity of Independent Set in H-Free Graphs.
Algorithmica, 2020

An Algorithmic Weakening of the Erdős-Hajnal Conjecture.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Parameterized resiliency problems.
Theor. Comput. Sci., 2019

Comparing Two Clusterings Using Matchings between Clusters of Clusters.
ACM J. Exp. Algorithmics, 2019

Constraint Generation Algorithm for the Minimum Connectivity Inference Problem.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

When Maximum Stable Set Can Be Solved in FPT Time.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Complexity dichotomies for the MinimumF-Overlay problem.
J. Discrete Algorithms, 2018

The bi-objective workflow satisfiability problem and workflow resiliency.
J. Comput. Secur., 2017

Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations.
Discret. Math. Theor. Comput. Sci., 2017

On the Satisfiability of Workflows with Release Points.
Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies, 2017

Complexity Dichotomies for the Minimum ℱ -Overlay Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Parameterized Resiliency Problems via Integer Linear Programming.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Approximating the Sparsest k-Subgraph in Chordal Graphs.
Theory Comput. Syst., 2016

An Approach to Parameterized Resiliency Problems Using Integer Linear Programming.
CoRR, 2016

Resiliency Policies in Access Control Revisited.
Proceedings of the 21st ACM on Symposium on Access Control Models and Technologies, 2016

A Multivariate Approach for Checking Resiliency in Access Control.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

Approximation et complexité paramétrée de problèmes d'optimisation dans les graphes : partitions et sous-graphes. (Approximation and parameterized complexity for combinatorial optimization problem in graph : partition and subgraph ).
PhD thesis, 2014

On the sum-max graph partitioning problem.
Theor. Comput. Sci., 2014

Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014