The following pages link to Édouard Bonnet (Q307767):
Displaying 50 items.
- On the complexity of connection games (Q307770) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Parameterized (in)approximability of subset problems (Q1785218) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- Metric dimension parameterized by treewidth (Q2041987) (← links)
- The complexity of mixed-connectivity (Q2070706) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- The inverse Voronoi problem in graphs. II: Trees (Q2663704) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs (Q2802943) (← links)
- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (Q2867073) (← links)
- Havannah and TwixT are PSPACE-complete (Q2947922) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
- Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property (Q3181061) (← links)
- (Q4580091) (← links)
- (Q4580094) (← links)
- (Q4601874) (← links)
- Fixed-parameter Approximability of Boolean MinCSPs (Q4606287) (← links)
- Parameterized Hardness of Art Gallery Problems (Q4606288) (← links)
- (Q4626304) (← links)
- (Q4636614) (← links)
- Parameterized Complexity of Independent Set in H-Free Graphs. (Q5009479) (← links)
- (Q5009490) (← links)
- Twin-width II: small classes (Q5051371) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem (Q5056405) (← links)
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs (Q5056440) (← links)
- Twin-width I: Tractable FO Model Checking (Q5066940) (← links)
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
- The Parameterized Complexity of Positional Games (Q5111422) (← links)
- (Q5111866) (← links)
- On the Parameterized Complexity of Red-Blue Points Separation (Q5111867) (← links)
- (Q5115778) (← links)
- (Q5115779) (← links)
- Orthogonal Terrain Guarding is NP-complete (Q5207871) (← links)
- (Q5224479) (← links)
- A Note on Edge Isoperimetric Numbers and Regular Graphs (Q5298314) (← links)
- The Graph Motif Problem Parameterized by the Structure of the Input Graph (Q5363785) (← links)
- (Q5874304) (← links)
- (Q5874335) (← links)