No. Title Author Year
1 Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs Cohen-Addad, Vincent et al. 2019
2 Multi-Budgeted Directed Cuts Kratsch, Stefan et al. 2019
3 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
4 Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization Egri, László et al. 2018
5 Front Matter, Table of Contents, Preface, Conference Organization Chatzigiannakis, Ioannis et al. 2018
6 Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms Bonnet, Édouard et al. 2018
7 LIPIcs, Volume 107, ICALP'18, Complete Volume Chatzigiannakis, Ioannis et al. 2018
8 The Parameterized Hardness of the k-Center Problem in Transportation Networks Feldmann, Andreas Emil et al. 2018
9 Fine-Grained Complexity of Coloring Unit Disks and Balls Biró, Csaba et al. 2017
10 Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk) Marx, Dániel 2017
Current Page :
Number of result pages: 4
Number of documents: 37


DROPS-Home | Imprint | Privacy Published by LZI