No. Title Author Year
1 Multi-Budgeted Directed Cuts Kratsch, Stefan et al. 2019
2 Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization Egri, László et al. 2018
3 Front Matter, Table of Contents, Preface, Conference Organization Chatzigiannakis, Ioannis et al. 2018
4 Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms Bonnet, Édouard et al. 2018
5 LIPIcs, Volume 107, ICALP'18, Complete Volume Chatzigiannakis, Ioannis et al. 2018
6 The Parameterized Hardness of the k-Center Problem in Transportation Networks Feldmann, Andreas Emil et al. 2018
7 Fine-Grained Complexity of Coloring Unit Disks and Balls Biró, Csaba et al. 2017
8 Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk) Marx, Dániel 2017
9 H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms Bacsó, Gábor et al. 2017
10 Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix Chen, Lin et al. 2017
Current Page :
Number of result pages: 4
Number of documents: 35


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