No. Title Author Year
1 Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk) Marx, Dániel 2017
2 H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms Bacsó, Gábor et al. 2017
3 Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix Chen, Lin et al. 2017
4 Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221) Erickson, Jeff et al. 2016
5 Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs Marx, Dániel et al. 2016
6 Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth Marx, Dániel et al. 2016
7 Fixed-Parameter Approximability of Boolean MinCSPs Bonnet, Édouard et al. 2016
8 Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems Marx, Dániel et al. 2016
9 Routing with Congestion in Acyclic Digraphs Amiri, Saeed Akhoondian et al. 2016
10 The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems Feldmann, Andreas Emil et al. 2016
Current Page :
Number of result pages: 3
Number of documents: 27


DROPS-Home | Fulltext Search | Imprint Published by LZI