E-LIB Suche - Ergebnisse für: Bonnet, Edouard

1

Sparse graphs with bounded induced cycle packing number hav..:

Bonamy, Marthe ; Bonnet, Édouard ; Déprés, Hugues...
Journal of Combinatorial Theory, Series B. 167 (2024) - p. 215-249 , 2024

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

2

Twin-Width IV: Ordered Graphs and Matrices:

Bonnet, Édouard ; Giocanti, Ugo ; de Mendez, Patrice Ossona...
Journal of the ACM. 71 (2024) 3 - p. 1-45 , 2024

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

3

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
European Journal of Combinatorics. 115 (2024) - p. 103772 , 2024

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

4

Cutting Barnette graphs perfectly is hard:

Bonnet, Édouard ; Chakraborty, Dibyayan ; Duron, Julien
Theoretical Computer Science. 1010 (2024) - p. 114701 , 2024

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

5

Maximum Matchings in Geometric Intersection Graphs:

Bonnet, Édouard ; Cabello, Sergio ; Mulzer, Wolfgang
Discrete & Computational Geometry. 70 (2023) 3 - p. 550-579 , 2023

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

6

Twin-width can be exponential in treewidth:

Bonnet, Édouard ; Déprés, Hugues
Journal of Combinatorial Theory, Series B. 161 (2023) - p. 1-14 , 2023

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

7

Cutting Barnette Graphs Perfectly is Hard:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Bonnet, Édouard ; Chakraborty, Dibyayan ; Duron, Julien - p. 116-129 , 2023

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

8

4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard a..:

Bonnet, Édouard
ACM Transactions on Algorithms (TALG). 18 (2022) 2 - p. 1-14 , 2022

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

9

Grundy Coloring and Friends, Half-Graphs, Bicliques:

Aboulker, Pierre ; Bonnet, Édouard ; Kim, Eun Jung.
Algorithmica. 85 (2022) 1 - p. 1-28 , 2022

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

10

4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard a..:

Bonnet, Édouard
ACM Transactions on Algorithms. 18 (2022) 2 - p. 1-14 , 2022

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

11

Model Checking on Interpretations of Classes of Bounded Loc..:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,

Bonnet, Édouard ; Dreier, Jan ; Gajarský, Jakub... - p. 1-13 , 2022

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

12

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

13

Twin-width IV: ordered graphs and matrices:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,

Bonnet, Édouard ; Giocanti, Ugo ; Ossona de Mendez, Patrice... - p. 924-937 , 2022

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

14

EPTAS and Subexponential Algorithm for Maximum Clique on Di..:

Bonamy, Marthe ; Bonnet, Édouard ; Bousquet, Nicolas...
Journal of the ACM. 68 (2021) 2 - p. 1-38 , 2021

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

15

Parameterized Intractability of Even Set and Shortest Vecto..:

Bhattacharyya, Arnab ; Bonnet, Édouard ; Egri, László...
Journal of the ACM (JACM). 68 (2021) 3 - p. 1-40 , 2021

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