E-LIB Suche - Ergebnisse für: Watrigant, Rémi

1

1-Extendability of Independent Sets:

Bergé, Pierre ; Busson, Anthony ; Feghali, Carl.
Algorithmica. 86 (2023) 3 - p. 757-781 , 2023

Link: https://doi.org/10.1007/..

2

Overlaying a hypergraph with a graph with bounded maximum d..:

Havet, Frédéric ; Mazauric, Dorian ; Nguyen, Viet-Ha.
Discrete Applied Mathematics. 319 (2022) - p. 394-406 , 2022

Link: https://doi.org/10.1016/..

3

1-Extendability of Independent Sets:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Bergé, Pierre ; Busson, Anthony ; Feghali, Carl. - p. 172-185 , 2022

Link: https://doi.org/10.1007/..

4

Twin-width and Polynomial Kernels:

Bonnet, Édouard ; Kim, Eun Jung ; Reinald, Amadeus..
Algorithmica. 84 (2022) 11 - p. 3300-3337 , 2022

Link: https://doi.org/10.1007/..

5

Twin-width II: small classes:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Bonnet, Édouard ; Geniet, Colin ; Kim, Eun Jung.. - p. 1977-1996 , 2021

Link: https://doi.org/10.1137/..

6

Twin-width I: Tractable FO Model Checking:

Bonnet, Édouard ; Kim, Eun Jung ; Thomassé, Stéphan.
ACM Journal of the ACM (JACM). 69 (2021) 1 - p. 1-46 , 2021

Link: https://dl.acm.org/doi/1..

7

Twin-width I: Tractable FO Model Checking:

Bonnet, Édouard ; Kim, Eun Jung ; Thomassé, Stéphan.
Journal of the ACM. 69 (2021) 1 - p. 1-46 , 2021

Link: https://doi.org/10.1145/..

8

Twin-width II : small classes:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Bonnet, Édouard ; Geniet, Colin ; Kim, Eun Jung.. - p. 1977-1996 , 2021

Link: https://dl.acm.org/doi/1..

9

Parameterized Complexity of Independent Set in H-Free Graph:

Bonnet, Édouard ; Bousquet, Nicolas ; Charbit, Pierre..
Algorithmica. 82 (2020) 8 - p. 2360-2394 , 2020

Link: https://doi.org/10.1007/..

10

Overlaying a Hypergraph with a Graph with Bounded Maximum D..:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Havet, Frédéric ; Mazauric, Dorian ; Nguyen, Viet-Ha. - p. 403-414 , 2020

Link: https://doi.org/10.1007/..

11

The Authorization Policy Existence Problem:

Berge, Pierre ; Crampton, Jason ; Gutin, Gregory.
IEEE Transactions on Dependable and Secure Computing. 17 (2020) 6 - p. 1333-1344 , 2020

Link: https://doi.org/10.1109/..

12

Twin-width I: tractable FO model checking:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),

Bonnet, Edouard ; Kim, Eun Jung ; Thomasse, Stephan. - p. 601-612 , 2020

Link: https://doi.org/10.1109/..

13

Parameterized resiliency problems:

Crampton, Jason ; Gutin, Gregory ; Koutecký, Martin.
Theoretical Computer Science. 795 (2019) - p. 478-491 , 2019

Link: https://doi.org/10.1016/..

14

Constraint Generation Algorithm for the Minimum Connectivit..:

, In: Lecture Notes in Computer Science; Analysis of Experimental Algorithms,

Bonnet, Édouard ; Fălămaş, Diana-Elena ; Watrigant, Rémi - p. 167-183 , 2019

Link: https://doi.org/10.1007/..

15

Complexity dichotomies for the Minimum F-Overlay problem:

Cohen, Nathann ; Havet, Frédéric ; Mazauric, Dorian..
Journal of Discrete Algorithms. 52-53 (2018) - p. 133-142 , 2018

Link: https://doi.org/10.1016/..