No. Title Author Year
1 4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3} Bonnet, Édouard 2021
2 Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio Bonnet, Édouard 2021
3 Twin-width III: Max Independent Set, Min Dominating Set, and Coloring Bonnet, Édouard et al. 2021
4 An Algorithmic Weakening of the Erdős-Hajnal Conjecture Bonnet, Édouard et al. 2020
5 Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth Bergougnoux, Benjamin et al. 2020
6 Grundy Coloring & Friends, Half-Graphs, Bicliques Aboulker, Pierre et al. 2020
7 Maximum Clique in Disk-Like Intersection Graphs Bonnet, Édouard et al. 2020
8 Maximum Matchings in Geometric Intersection Graphs Bonnet, Édouard et al. 2020
9 Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Bonnet, Édouard et al. 2019
10 Metric Dimension Parameterized by Treewidth Bonnet, Édouard et al. 2019
11 Parameterized Complexity of Independent Set in H-Free Graphs Bonnet, Édouard et al. 2019
12 Parameterized Streaming Algorithms for Min-Ones d-SAT Agrawal, Akanksha et al. 2019
13 The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration Bonnet, Édouard et al. 2019
14 When Maximum Stable Set Can Be Solved in FPT Time Bonnet, Édouard et al. 2019
15 Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms Bonnet, Édouard et al. 2018
16 On the Parameterized Complexity of Red-Blue Points Separation Bonnet, Édouard et al. 2018
17 Orthogonal Terrain Guarding is NP-complete Bonnet, Édouard et al. 2018
18 QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs Bonnet, Édouard et al. 2018
19 An Approximation Algorithm for the Art Gallery Problem Bonnet, Édouard et al. 2017
20 Complexity of Token Swapping and its Variants Bonnet, Édouard et al. 2017
21 Fine-Grained Complexity of Coloring Unit Disks and Balls Biró, Csaba et al. 2017
22 The Parameterized Complexity of Positional Games Bonnet, Édouard et al. 2017
23 Fixed-Parameter Approximability of Boolean MinCSPs Bonnet, Édouard et al. 2016
24 Parameterized Hardness of Art Gallery Problems Bonnet, Édouard et al. 2016
25 Time-Approximation Trade-offs for Inapproximable Problems Bonnet, Édouard et al. 2016
26 The Graph Motif Problem Parameterized by the Structure of the Input Graph Bonnet, Édouard et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 26


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI