Rémi Watrigant

According to our database, Rémi Watrigant authored at least 30 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

1-Extendability of Independent Sets.

Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant

Algorithmica, March, 2024

Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring.

Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant

SIAM J. Comput., 2024

Channel allocation revisited through 1-extendability of graphs.

Anthony Busson, Malory Marin, Rémi Watrigant

CoRR, 2024

Beyond recognizing well-covered graphs.

Carl Feghali, Malory Marin, Rémi Watrigant

CoRR, 2024

2023

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

Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Twin-width I: Tractable FO Model Checking.

Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant

J. ACM, 2022

Overlaying a hypergraph with a graph with bounded maximum degree.

Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant

Discret. Appl. Math., 2022

Twin-width and Polynomial Kernels.

Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant

Algorithmica, 2022

2021

Twin-width II: small classes.

Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

The Authorization Policy Existence Problem.

Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant

IEEE Trans. Dependable Secur. Comput., 2020

Twin-width III: Max Independent Set and Coloring.

Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant

CoRR, 2020

Parameterized Complexity of Independent Set in H-Free Graphs.

Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant

Algorithmica, 2020

An Algorithmic Weakening of the Erdős-Hajnal Conjecture.

Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Parameterized resiliency problems.

Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant

Theor. Comput. Sci., 2019

Comparing Two Clusterings Using Matchings between Clusters of Clusters.

Frédéric Cazals, Dorian Mazauric, Romain Tetley, Rémi Watrigant

ACM J. Exp. Algorithmics, 2019

Constraint Generation Algorithm for the Minimum Connectivity Inference Problem.

Édouard Bonnet, Diana-Elena Falamas, Rémi Watrigant

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

When Maximum Stable Set Can Be Solved in FPT Time.

Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Complexity dichotomies for the MinimumF-Overlay problem.

Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant

J. Discrete Algorithms, 2018

2017

The bi-objective workflow satisfiability problem and workflow resiliency.

Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant

J. Comput. Secur., 2017

Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations.

Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant

Discret. Math. Theor. Comput. Sci., 2017

On the Satisfiability of Workflows with Release Points.

Jason Crampton, Gregory Z. Gutin, Rémi Watrigant

Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies, 2017

Complexity Dichotomies for the Minimum ℱ -Overlay Problem.

Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Parameterized Resiliency Problems via Integer Linear Programming.

Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Approximating the Sparsest k-Subgraph in Chordal Graphs.

Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau

Theory Comput. Syst., 2016

An Approach to Parameterized Resiliency Problems Using Integer Linear Programming.

Jason Crampton, Gregory Z. Gutin, Rémi Watrigant

CoRR, 2016

Resiliency Policies in Access Control Revisited.

Jason Crampton, Gregory Z. Gutin, Rémi Watrigant

Proceedings of the 21st ACM on Symposium on Access Control Models and Technologies, 2016

A Multivariate Approach for Checking Resiliency in Access Control.

Jason Crampton, Gregory Z. Gutin, Rémi Watrigant

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2014

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 ).

Rémi Watrigant

PhD thesis, 2014

On the sum-max graph partitioning problem.

Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König

Theor. Comput. Sci., 2014

Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs.

Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014