default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRémi Watrigant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of Independent Sets. Algorithmica 86(3): 757-781 (2024)- [j14]Édouard Bonnet
, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring. SIAM J. Comput. 53(5): 1602-1640 (2024) - [c22]Anthony Busson, Malory Marin, Rémi Watrigant:
Channel Allocation Revisited Through 1-Extendability of Graphs. ALGOWIN 2024: 46-60 - [i19]Carl Feghali, Malory Marin, Rémi Watrigant:
Beyond recognizing well-covered graphs. CoRR abs/2404.07853 (2024) - [i18]Anthony Busson, Malory Marin, Rémi Watrigant:
Channel allocation revisited through 1-extendability of graphs. CoRR abs/2408.14633 (2024) - [i17]Malory Marin, Stéphan Thomassé, Nicolas Trotignon, Rémi Watrigant:
A structural description of Zykov and Blanche Descartes graphs. CoRR abs/2410.06917 (2024) - 2023
- [c21]Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant:
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. STACS 2023: 10:1-10:15 - 2022
- [j13]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-width and Polynomial Kernels. Algorithmica 84(11): 3300-3337 (2022) - [j12]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. Comb. Theory 2(2) (2022) - [j11]Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant:
Overlaying a hypergraph with a graph with bounded maximum degree. Discret. Appl. Math. 319: 394-406 (2022) - [j10]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: Tractable FO Model Checking. J. ACM 69(1): 3:1-3:46 (2022) - [c20]Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of Independent Sets. IWOCA 2022: 172-185 - [i16]Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of independent sets. CoRR abs/2204.05809 (2022) - [i15]Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant:
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. CoRR abs/2207.07708 (2022) - 2021
- [c19]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring. ICALP 2021: 35:1-35:20 - [c18]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-Width and Polynomial Kernels. IPEC 2021: 10:1-10:16 - [c17]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. SODA 2021: 1977-1996 - [i14]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-width and polynomial kernels. CoRR abs/2107.02882 (2021) - 2020
- [j9]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica 82(8): 2360-2394 (2020) - [j8]Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
The Authorization Policy Existence Problem. IEEE Trans. Dependable Secur. Comput. 17(6): 1333-1344 (2020) - [c16]Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant:
Overlaying a Hypergraph with a Graph with Bounded Maximum Degree. CALDAM 2020: 403-414 - [c15]Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant:
An Algorithmic Weakening of the Erdős-Hajnal Conjecture. ESA 2020: 23:1-23:18 - [c14]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: tractable FO model checking. FOCS 2020: 601-612 - [i13]Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant:
An algorithmic weakening of the Erdős-Hajnal conjecture. CoRR abs/2004.12166 (2020) - [i12]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: tractable FO model checking. CoRR abs/2004.14789 (2020) - [i11]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. CoRR abs/2006.09877 (2020) - [i10]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width III: Max Independent Set and Coloring. CoRR abs/2007.14161 (2020)
2010 – 2019
- 2019
- [j7]Frédéric Cazals, Dorian Mazauric, Romain Tetley, Rémi Watrigant:
Comparing Two Clusterings Using Matchings between Clusters of Clusters. ACM J. Exp. Algorithmics 24(1): 1.17:1-1.17:41 (2019) - [j6]Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant:
Parameterized resiliency problems. Theor. Comput. Sci. 795: 478-491 (2019) - [c13]Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant:
When Maximum Stable Set Can Be Solved in FPT Time. ISAAC 2019: 49:1-49:22 - [c12]Édouard Bonnet, Diana-Elena Falamas, Rémi Watrigant:
Constraint Generation Algorithm for the Minimum Connectivity Inference Problem. SEA² 2019: 167-183 - [i9]Édouard Bonnet, Diana-Elena Falamas, Rémi Watrigant:
Constraint Generation Algorithm for the Minimum Connectivity Inference Problem. CoRR abs/1908.09586 (2019) - [i8]Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant:
When Maximum Stable Set can be solved in FPT time. CoRR abs/1909.08426 (2019) - 2018
- [j5]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms 52-53: 133-142 (2018) - [c11]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. IPEC 2018: 17:1-17:13 - [i7]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. CoRR abs/1810.04620 (2018) - 2017
- [j4]Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant:
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. Discret. Math. Theor. Comput. Sci. 19(4) (2017) - [j3]Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant:
The bi-objective workflow satisfiability problem and workflow resiliency. J. Comput. Secur. 25(1): 83-115 (2017) - [c10]Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant:
Parameterized Resiliency Problems via Integer Linear Programming. CIAC 2017: 164-176 - [c9]Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
The Authorization Policy Existence Problem. CODASPY 2017: 163-165 - [c8]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA 2017: 116-127 - [c7]Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
On the Satisfiability of Workflows with Release Points. SACMAT 2017: 207-217 - [i6]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum F-Overlay Problem. CoRR abs/1703.05156 (2017) - 2016
- [j2]Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau:
Approximating the Sparsest k-Subgraph in Chordal Graphs. Theory Comput. Syst. 58(1): 111-132 (2016) - [c6]Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
A Multivariate Approach for Checking Resiliency in Access Control. AAIM 2016: 173-184 - [c5]Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
Resiliency Policies in Access Control Revisited. SACMAT 2016: 101-111 - [i5]Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
A Multivariate Approach for Checking Resiliency in Access Control. CoRR abs/1604.01550 (2016) - [i4]Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
An Approach to Parameterized Resiliency Problems Using Integer Linear Programming. CoRR abs/1605.08738 (2016) - [i3]Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
The Authorization Policy Existence Problem. CoRR abs/1612.06191 (2016) - 2015
- [c4]Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant:
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. FCT 2015: 189-201 - [i2]Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant:
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. CoRR abs/1506.03282 (2015) - [i1]Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant:
The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency. CoRR abs/1512.07019 (2015) - 2014
- [b1]Rémi Watrigant:
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 ). Montpellier 2 University, France, 2014 - [j1]Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König:
On the sum-max graph partitioning problem. Theor. Comput. Sci. 540: 143-155 (2014) - [c3]Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant:
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM 2014: 150-161 - 2013
- [c2]Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau:
Approximating the Sparsest k-Subgraph in Chordal Graphs. WAOA 2013: 73-84 - 2012
- [c1]Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König:
Sum-Max Graph Partitioning Problem. ISCO 2012: 297-308
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-10 18:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
