No. Title Author Year
1 Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms Bonnet, Édouard et al. 2018
2 On the Parameterized Complexity of Red-Blue Points Separation Bonnet, Édouard et al. 2018
3 An Approximation Algorithm for the Art Gallery Problem Bonnet, Édouard et al. 2017
4 Complexity of Token Swapping and its Variants Bonnet, Édouard et al. 2017
5 Fine-Grained Complexity of Coloring Unit Disks and Balls Biró, Csaba et al. 2017
6 The Parameterized Complexity of Positional Games Bonnet, Édouard et al. 2017
7 Fixed-Parameter Approximability of Boolean MinCSPs Bonnet, Édouard et al. 2016
8 Parameterized Hardness of Art Gallery Problems Bonnet, Édouard et al. 2016
9 Time-Approximation Trade-offs for Inapproximable Problems Bonnet, Édouard et al. 2016
10 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: 10


DROPS-Home | Fulltext Search | Imprint Published by LZI