Rémi Watrigant

64 papers A* 3A 2B 9C 7Journal 38Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Fair radio channel assignment in WLANs via graph subcoloring. Comput. Networks Malory Marin, Joachim Cendrier, Loïc Chassin de Kergommeaux, Rémi Watrigant, Thomas Begin, Anthony Busson
2025	B	`conf`	A Structural Description of Zykov and Blanche Descartes Graphs. WG Malory Marin, Stéphan Thomassé, Nicolas Trotignon, Rémi Watrigant
2025	J	`jnl`	Channel allocation revisited through 1-extendability of graphs. Theor. Comput. Sci. Anthony Busson, Malory Marin, Rémi Watrigant
2025	J	`jnl`	Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs. CoRR Malory Marin, Jean-Florent Raymond, Rémi Watrigant
2025	B	`conf`	Subcoloring of (Unit) Disk Graphs. MFCS Malory Marin, Rémi Watrigant
2025	J	`jnl`	Subcoloring of (Unit) Disk Graphs. CoRR Malory Marin, Rémi Watrigant
2024	J	`jnl`	1-Extendability of Independent Sets. Algorithmica Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
2024	J	`jnl`	A structural description of Zykov and Blanche Descartes graphs. CoRR Malory Marin, Stéphan Thomassé, Nicolas Trotignon, Rémi Watrigant
2024	B	`conf`	Beyond Recognizing Well-Covered Graphs. WG Carl Feghali, Malory Marin, Rémi Watrigant
2024	J	`jnl`	Beyond recognizing well-covered graphs. CoRR Carl Feghali, Malory Marin, Rémi Watrigant
2024	—	`conf`	Channel Allocation Revisited Through 1-Extendability of Graphs. ALGOWIN Anthony Busson, Malory Marin, Rémi Watrigant
2024	J	`jnl`	Channel allocation revisited through 1-extendability of graphs. CoRR Anthony Busson, Malory Marin, Rémi Watrigant
2024	J	`jnl`	Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring. SIAM J. Comput. Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2023	A	`conf`	Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. STACS Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant
2022	C	`conf`	1-Extendability of Independent Sets. IWOCA Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
2022	J	`jnl`	1-Extendability of independent sets. CoRR Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
2022	J	`jnl`	Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. CoRR Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant
2022	J	`jnl`	Overlaying a hypergraph with a graph with bounded maximum degree. Discret. Appl. Math. Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant
2022	J	`jnl`	Twin-width I: Tractable FO Model Checking. J. ACM Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2022	J	`jnl`	Twin-width II: small classes. Comb. Theory Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2022	J	`jnl`	Twin-width and Polynomial Kernels. Algorithmica Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2021	B	`conf`	Twin-Width and Polynomial Kernels. IPEC Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2021	A*	`conf`	Twin-width II: small classes. SODA Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2021	A*	`conf`	Twin-width III: Max Independent Set, Min Dominating Set, and Coloring. ICALP Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2021	J	`jnl`	Twin-width and polynomial kernels. CoRR Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2020	A	`conf`	An Algorithmic Weakening of the Erdős-Hajnal Conjecture. ESA Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant
2020	J	`jnl`	An algorithmic weakening of the Erdős-Hajnal conjecture. CoRR Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant
2020	—	`conf`	Overlaying a Hypergraph with a Graph with Bounded Maximum Degree. CALDAM Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant
2020	J	`jnl`	Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	The Authorization Policy Existence Problem. IEEE Trans. Dependable Secur. Comput. Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2020	A*	`conf`	Twin-width I: tractable FO model checking. FOCS Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Twin-width I: tractable FO model checking. CoRR Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Twin-width II: small classes. CoRR Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Twin-width III: Max Independent Set and Coloring. CoRR Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2019	J	`jnl`	Comparing Two Clusterings Using Matchings between Clusters of Clusters. ACM J. Exp. Algorithmics Frédéric Cazals, Dorian Mazauric, Romain Tetley, Rémi Watrigant
2019	—	`conf`	Constraint Generation Algorithm for the Minimum Connectivity Inference Problem. SEA² Édouard Bonnet, Diana-Elena Falamas, Rémi Watrigant
2019	J	`jnl`	Constraint Generation Algorithm for the Minimum Connectivity Inference Problem. CoRR Édouard Bonnet, Diana-Elena Falamas, Rémi Watrigant
2019	J	`jnl`	Parameterized resiliency problems. Theor. Comput. Sci. Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant
2019	B	`conf`	When Maximum Stable Set Can Be Solved in FPT Time. ISAAC Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant
2019	J	`jnl`	When Maximum Stable Set can be solved in FPT time. CoRR Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant
2018	J	`jnl`	Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
2018	B	`conf`	Parameterized Complexity of Independent Set in H-Free Graphs. IPEC Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2018	J	`jnl`	Parameterized Complexity of Independent Set in H-Free Graphs. CoRR Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2017	J	`jnl`	Complexity Dichotomies for the Minimum F-Overlay Problem. CoRR Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
2017	C	`conf`	Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
2017	J	`jnl`	Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. Discret. Math. Theor. Comput. Sci. Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
2017	C	`conf`	On the Satisfiability of Workflows with Release Points. SACMAT Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2017	C	`conf`	Parameterized Resiliency Problems via Integer Linear Programming. CIAC Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant
2017	—	`conf`	The Authorization Policy Existence Problem. CODASPY Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2017	J	`jnl`	The bi-objective workflow satisfiability problem and workflow resiliency. J. Comput. Secur. Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant
2016	C	`conf`	A Multivariate Approach for Checking Resiliency in Access Control. AAIM Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2016	J	`jnl`	A Multivariate Approach for Checking Resiliency in Access Control. CoRR Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2016	J	`jnl`	An Approach to Parameterized Resiliency Problems Using Integer Linear Programming. CoRR Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2016	J	`jnl`	Approximating the Sparsest k-Subgraph in Chordal Graphs. Theory Comput. Syst. Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
2016	C	`conf`	Resiliency Policies in Access Control Revisited. SACMAT Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2016	J	`jnl`	The Authorization Policy Existence Problem. CoRR Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2015	B	`conf`	Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. FCT Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
2015	J	`jnl`	Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. CoRR Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
2015	J	`jnl`	The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency. CoRR Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant
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
2014	J	`jnl`	On the sum-max graph partitioning problem. Theor. Comput. Sci. Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König
2014	B	`conf`	Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant
2013	B	`conf`	Approximating the Sparsest k-Subgraph in Chordal Graphs. WAOA Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
2012	C	`conf`	Sum-Max Graph Partitioning Problem. ISCO Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König