No. Title Author Year
1 Chordless Cycle Packing Is Fixed-Parameter Tractable Marx, Dániel 2020
2 Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction Künnemann, Marvin et al. 2020
3 Hitting Long Directed Cycles Is Fixed-Parameter Tractable Göke, Alexander et al. 2020
4 Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy Marx, Dániel et al. 2020
5 Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs Cohen-Addad, Vincent et al. 2019
6 Finding and Counting Permutations via CSPs Berendsohn, Benjamin Aram et al. 2019
7 How Does Object Fatness Impact the Complexity of Packing in d Dimensions? Kisfaludi-Bak, Sándor et al. 2019
8 Multi-Budgeted Directed Cuts Kratsch, Stefan et al. 2019
9 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
10 Parameterized Streaming Algorithms for Min-Ones d-SAT Agrawal, Akanksha et al. 2019
11 Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization Egri, László et al. 2018
12 Front Matter, Table of Contents, Preface, Conference Organization Chatzigiannakis, Ioannis et al. 2018
13 Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms Bonnet, Édouard et al. 2018
14 LIPIcs, Volume 107, ICALP'18, Complete Volume Chatzigiannakis, Ioannis et al. 2018
15 The Parameterized Hardness of the k-Center Problem in Transportation Networks Feldmann, Andreas Emil et al. 2018
16 Fine-Grained Complexity of Coloring Unit Disks and Balls Biró, Csaba et al. 2017
17 Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk) Marx, Dániel 2017
18 H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms Bacsó, Gábor et al. 2017
19 Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix Chen, Lin et al. 2017
20 Subexponential Parameterized Algorithms for Graphs of Polynomial Growth Marx, Dániel et al. 2017
21 Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221) Erickson, Jeff et al. 2016
22 Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs Marx, Dániel et al. 2016
23 Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth Marx, Dániel et al. 2016
24 Fixed-Parameter Approximability of Boolean MinCSPs Bonnet, Édouard et al. 2016
25 Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems Marx, Dániel et al. 2016
26 Routing with Congestion in Acyclic Digraphs Amiri, Saeed Akhoondian et al. 2016
27 The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems Feldmann, Andreas Emil et al. 2016
28 The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk) Marx, Dániel 2016
29 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301) Bulatov, Andrei A. et al. 2016
30 Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451) Kratsch, Stefan et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 44

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