No. Title Author Year
1 Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Bonnet, Édouard et al. 2019
2 Metric Dimension Parameterized by Treewidth Bonnet, Édouard et al. 2019
3 Parameterized Complexity of Independent Set in H-Free Graphs Bonnet, Édouard et al. 2019
4 Parameterized Streaming Algorithms for Min-Ones d-SAT Agrawal, Akanksha et al. 2019
5 The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration Bonnet, Édouard et al. 2019
6 When Maximum Stable Set Can Be Solved in FPT Time Bonnet, Édouard et al. 2019
7 Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms Bonnet, Édouard et al. 2018
8 On the Parameterized Complexity of Red-Blue Points Separation Bonnet, Édouard et al. 2018
9 Orthogonal Terrain Guarding is NP-complete Bonnet, Édouard et al. 2018
10 QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs Bonnet, Édouard et al. 2018
11 An Approximation Algorithm for the Art Gallery Problem Bonnet, Édouard et al. 2017
12 Complexity of Token Swapping and its Variants Bonnet, Édouard et al. 2017
13 Fine-Grained Complexity of Coloring Unit Disks and Balls Biró, Csaba et al. 2017
14 The Parameterized Complexity of Positional Games Bonnet, Édouard et al. 2017
15 Fixed-Parameter Approximability of Boolean MinCSPs Bonnet, Édouard et al. 2016
16 Parameterized Hardness of Art Gallery Problems Bonnet, Édouard et al. 2016
17 Time-Approximation Trade-offs for Inapproximable Problems Bonnet, Édouard et al. 2016
18 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: 18


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