default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÉdouard Bonnet
Edouard Bonnet
Person information
- affiliation: ENS de Lyon, France
- affiliation: Paris Dauphine University, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä
, Aline Parreau:
Neighbourhood complexity of graphs of bounded twin-width. Eur. J. Comb. 115: 103772 (2024)- [j38]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-Width IV: Ordered Graphs and Matrices. J. ACM 71(3): 21 (2024) - [j37]Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek:
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. J. Comb. Theory B 167: 215-249 (2024) - [j36]Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. Log. Methods Comput. Sci. 20(3) (2024) - [j35]Édouard Bonnet, Dibyayan Chakraborty, Julien Duron:
Cutting Barnette graphs perfectly is hard. Theor. Comput. Sci. 1010: 114701 (2024) - [c61]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Tight Bounds on Adjacency Labels for Monotone Graph Classes. ICALP 2024: 31:1-31:20 - [c60]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Symmetric-Difference (Degeneracy) and Signed Tree Models. MFCS 2024: 32:1-32:16 - [c59]Edouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé:
Factoring Pattern-Free Permutations into Separable ones. SODA 2024: 752-779 - [c58]Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SODA 2024: 1147-1165 - [i73]Édouard Bonnet, Carl Feghali, Stéphan Thomassé, Nicolas Trotignon:
Graphs without a 3-connected subgraph are 4-colorable. CoRR abs/2402.06338 (2024) - [i72]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Symmetric-Difference (Degeneracy) and Signed Tree Models. CoRR abs/2405.09011 (2024) - [i71]Édouard Bonnet:
Sparse Induced Subgraphs of Large Treewidth. CoRR abs/2405.13797 (2024) - [i70]Édouard Bonnet:
Treewidth Inapproximability and Tight ETH Lower Bound. CoRR abs/2406.11628 (2024) - [i69]Édouard Bonnet, Kristóf Huszár:
On the twin-width of smooth manifolds. CoRR abs/2407.10174 (2024) - 2023
- [j34]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring and Friends, Half-Graphs, Bicliques. Algorithmica 85(1): 1-28 (2023) - [j33]Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. Discret. Comput. Geom. 70(3): 550-579 (2023) - [j32]Édouard Bonnet, Hugues Déprés:
Twin-width can be exponential in treewidth. J. Comb. Theory B 161: 1-14 (2023) - [c57]Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek:
Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. ESA 2023: 23:1-23:15 - [c56]Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth Is NP-Complete on Cubic Graphs. IPEC 2023: 7:1-7:13 - [c55]Édouard Bonnet, Julien Duron:
Stretch-Width. IPEC 2023: 8:1-8:15 - [c54]Édouard Bonnet, Julien Duron:
PACE Solver Description: RedAlert - Heuristic Track. IPEC 2023: 40:1-40:5 - [c53]Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek:
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA 2023: 3006-3028 - [c52]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 - [c51]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé:
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. STACS 2023: 15:1-15:16 - [c50]Édouard Bonnet, Dibyayan Chakraborty, Julien Duron:
Cutting Barnette Graphs Perfectly is Hard. WG 2023: 116-129 - [i68]Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau:
Neighbourhood complexity of graphs of bounded twin-width. CoRR abs/2301.04217 (2023) - [i67]Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR abs/2301.10031 (2023) - [i66]Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek:
Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4. CoRR abs/2302.08182 (2023) - [i65]Édouard Bonnet, Dibyayan Chakraborty, Julien Duron:
Cutting Barnette graphs perfectly is hard. CoRR abs/2302.11667 (2023) - [i64]Édouard Bonnet, Julien Duron:
Stretch-width. CoRR abs/2305.12023 (2023) - [i63]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Small But Unwieldy. CoRR abs/2307.11225 (2023) - [i62]Édouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé:
Factoring Pattern-Free Permutations into Separable ones. CoRR abs/2308.02981 (2023) - [i61]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Tight bounds on adjacency labels for monotone graph classes. CoRR abs/2310.20522 (2023) - [i60]Édouard Bonnet, Jedrzej Hodor, Tuukka Korhonen, Tomás Masarík:
Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor. CoRR abs/2312.07962 (2023) - 2022
- [j31]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-width and Polynomial Kernels. Algorithmica 84(11): 3300-3337 (2022) - [j30]É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) - [j29]Édouard Bonnet:
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n4/3. ACM Trans. Algorithms 18(2): 11:1-11:14 (2022) - [c49]Pierre Bergé, Édouard Bonnet, Hugues Déprés:
Deciding Twin-Width at Most 4 Is NP-Complete. ICALP 2022: 18:1-18:20 - [c48]Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-Width VIII: Delineation and Win-Wins. IPEC 2022: 9:1-9:18 - [c47]Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk:
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. LICS 2022: 54:1-54:13 - [c46]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé:
Twin-width VI: the lens of contraction sequences. SODA 2022: 1036-1056 - [c45]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-width IV: ordered graphs and matrices. STOC 2022: 924-937 - [i59]Édouard Bonnet, O-joung Kwon, David R. Wood:
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond). CoRR abs/2202.11858 (2022) - [i58]Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk:
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. CoRR abs/2202.13014 (2022) - [i57]Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-width VIII: delineation and win-wins. CoRR abs/2204.00722 (2022) - [i56]Édouard Bonnet, Hugues Déprés:
Twin-width can be exponential in treewidth. CoRR abs/2204.07670 (2022) - [i55]Édouard Bonnet, Colin Geniet, Romain Tessera, Stéphan Thomassé:
Twin-width VII: groups. CoRR abs/2204.12330 (2022) - [i54]Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek:
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. CoRR abs/2206.00594 (2022) - [i53]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) - [i52]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé:
Twin-width V: linear minors, modular counting, and matrix multiplication. CoRR abs/2209.12023 (2022) - 2021
- [j28]Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés:
The Inverse Voronoi Problem in Graphs II: Trees. Algorithmica 83(5): 1165-1200 (2021) - [j27]Édouard Bonnet, Nidhi Purohit:
Metric Dimension Parameterized By Treewidth. Algorithmica 83(8): 2606-2633 (2021) - [j26]Édouard Bonnet, Sergio Cabello:
The complexity of mixed-connectivity. Ann. Oper. Res. 307(1): 25-35 (2021) - [j25]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé:
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68(2): 9:1-9:38 (2021) - [j24]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. J. ACM 68(3): 16:1-16:40 (2021) - [c44]Édouard Bonnet:
4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3}. ICALP 2021: 34:1-34:15 - [c43]É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 - [c42]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-Width and Polynomial Kernels. IPEC 2021: 10:1-10:16 - [c41]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. SODA 2021: 1977-1996 - [c40]Édouard Bonnet:
Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio. STACS 2021: 17:1-17:13 - [i51]Édouard Bonnet:
4 vs 7 sparse undirected unweighted Diameter is SETH-hard at time n4/3. CoRR abs/2101.02312 (2021) - [i50]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-width IV: ordered graphs and matrices. CoRR abs/2102.03117 (2021) - [i49]Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. CoRR abs/2102.06880 (2021) - [i48]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-width and polynomial kernels. CoRR abs/2107.02882 (2021) - [i47]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé:
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR abs/2110.15419 (2021) - [i46]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé:
Twin-width VI: the lens of contraction sequences. CoRR abs/2111.00282 (2021) - [i45]Pierre Bergé, Édouard Bonnet, Hugues Déprés:
Deciding twin-width at most 4 is NP-complete. CoRR abs/2112.08953 (2021) - 2020
- [j23]É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) - [j22]Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés:
The Inverse Voronoi Problem in Graphs I: Hardness. Algorithmica 82(10): 3018-3040 (2020) - [j21]Édouard Bonnet, Pawel Rzazewski, Florian Sikora:
Designing RNA Secondary Structures Is Hard. J. Comput. Biol. 27(3): 302-316 (2020) - [j20]Édouard Bonnet, Tillmann Miltzow:
Parameterized Hardness of Art Gallery Problems. ACM Trans. Algorithms 16(4): 42:1-42:23 (2020) - [c39]É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 - [c38]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: tractable FO model checking. FOCS 2020: 601-612 - [c37]Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow:
Maximum Clique in Disk-Like Intersection Graphs. FSTTCS 2020: 17:1-17:18 - [c36]Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon:
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. IPEC 2020: 3:1-3:17 - [c35]Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. STACS 2020: 31:1-31:17 - [c34]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring & Friends, Half-Graphs, Bicliques. STACS 2020: 58:1-58:18 - [i44]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring & friends, Half-Graphs, Bicliques. CoRR abs/2001.03794 (2020) - [i43]Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow:
Maximum Clique in Disk-Like Intersection Graphs. CoRR abs/2003.02583 (2020) - [i42]É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) - [i41]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: tractable FO model checking. CoRR abs/2004.14789 (2020) - [i40]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. CoRR abs/2006.09877 (2020) - [i39]É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) - [i38]Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon:
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth. CoRR abs/2007.14179 (2020) - [i37]Édouard Bonnet:
Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio. CoRR abs/2008.11315 (2020) - [i36]Édouard Bonnet, Sergio Cabello:
The Complexity of Mixed-Connectivity. CoRR abs/2010.04799 (2020)
2010 – 2019
- 2019
- [j19]Édouard Bonnet, Pawel Rzazewski:
Optimality Program in Segment and String Graphs. Algorithmica 81(7): 3047-3073 (2019) - [j18]Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. Algorithmica 81(10): 3890-3935 (2019) - [j17]Edouard Bonnet, Panos Giannopoulos, Michael Lampis:
On the parameterized complexity of red-blue points separation. J. Comput. Geom. 10(1): 181-206 (2019) - [j16]Édouard Bonnet, Panos Giannopoulos:
Orthogonal Terrain Guarding is NP-complete. J. Comput. Geom. 10(2): 21-44 (2019) - [c33]Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik:
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. ESA 2019: 23:1-23:14 - [c32]Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh:
Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS 2019: 8:1-8:20 - [c31]É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 - [c30]Édouard Bonnet, Nidhi Purohit:
Metric Dimension Parameterized by Treewidth. IPEC 2019: 5:1-5:15 - [c29]Édouard Bonnet, Diana-Elena Falamas, Rémi Watrigant:
Constraint Generation Algorithm for the Minimum Connectivity Inference Problem. SEA² 2019: 167-183 - [i35]Édouard Bonnet, Nidhi Purohit:
Metric Dimension Parameterized by Treewidth. CoRR abs/1907.08093 (2019) - [i34]Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik:
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. CoRR abs/1908.09325 (2019) - [i33]Édouard Bonnet, Diana-Elena Falamas, Rémi Watrigant:
Constraint Generation Algorithm for the Minimum Connectivity Inference Problem. CoRR abs/1908.09586 (2019) - [i32]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. CoRR abs/1909.01986 (2019) - [i31]É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) - [i30]Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. CoRR abs/1910.02123 (2019) - [i29]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j15]Édouard Bonnet, Vangelis Th. Paschos:
Sparsification and subexponential approximation. Acta Informatica 55(1): 1-15 (2018) - [j14]Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski:
Complexity of Token Swapping and Its Variants. Algorithmica 80(9): 2656-2682 (2018) - [j13]Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy coloring and its variants. Discret. Appl. Math. 243: 99-114 (2018) - [j12]Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. Discret. Optim. 27: 26-56 (2018) - [j11]Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos:
Time-approximation trade-offs for inapproximable problems. J. Comput. Syst. Sci. 92: 171-180 (2018) - [j10]Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-grained complexity of coloring unit disks and balls. J. Comput. Geom. 9(2): 47-80 (2018) - [c28]Édouard Bonnet, Panos Giannopoulos:
Orthogonal Terrain Guarding is NP-complete. SoCG 2018: 11:1-11:15 - [c27]Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora:
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG 2018: 12:1-12:15 - [c26]Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. FOCS 2018: 568-579 - [c25]É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 - [c24]Édouard Bonnet, Florian Sikora:
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. IPEC 2018: 26:1-26:15 - [c23]Édouard Bonnet, Pawel Rzazewski, Florian Sikora:
Designing RNA Secondary Structures Is Hard. RECOMB 2018: 248-250 - [c22]Édouard Bonnet, Pawel Rzazewski:
Optimality Program in Segment and String Graphs. WG 2018: 79-90 - [i28]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. CoRR abs/1803.01822 (2018) - [i27]É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) - [i26]Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés:
The inverse Voronoi problem in graphs. CoRR abs/1811.12547 (2018) - 2017
- [j9]Édouard Bonnet, Florian Sikora:
The Graph Motif problem parameterized by the structure of the input graph. Discret. Appl. Math. 231: 78-94 (2017) - [j8]Édouard Bonnet, Vangelis Th. Paschos:
Dual parameterization and parameterized approximability of subset graph problems. RAIRO Oper. Res. 51(1): 261-266 (2017) - [j7]Faisal N. Abu-Khzam, Édouard Bonnet, Florian Sikora:
On the complexity of various parameterizations of common induced subgraph isomorphism. Theor. Comput. Sci. 697: 69-78 (2017) - [c21]Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-Grained Complexity of Coloring Unit Disks and Balls. SoCG 2017: 18:1-18:16 - [c20]Édouard Bonnet, Tillmann Miltzow:
An Approximation Algorithm for the Art Gallery Problem. SoCG 2017: 20:1-20:15 - [c19]Édouard Bonnet, Serge Gaspers, Ant