No. Title Author Year
1 List Colouring Trees in Logarithmic Space Bodlaender, Hans L. et al. 2022
2 Parameterized Complexities of Dominating and Independent Set Reconfiguration Bodlaender, Hans L. et al. 2021
3 Parameterized Complexity of Scheduling Chains of Jobs with Delays Bodlaender, Hans L. et al. 2020
4 Typical Sequences Revisited - Computing Width Parameters of Graphs Bodlaender, Hans L. et al. 2020
5 Computing Treewidth on the GPU van der Zanden, Tom C. et al. 2018
6 On the Exact Complexity of Polyomino Packing Bodlaender, Hans L. et al. 2018
7 A Faster Parameterized Algorithm for Pseudoforest Deletion Bodlaender, Hans L. et al. 2017
8 Cut and Count and Representative Sets on Branch Decompositions Pino, Willem J. A. et al. 2017
9 Front Matter, Table of Contents, Preface, Conference Organization Larsen, Kim G. et al. 2017
10 LIPIcs, Volume 83, MFCS'17, Complete Volume Larsen, Kim G. et al. 2017
11 Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity Bodlaender, Hans L. et al. 2016
12 Subexponential Time Algorithms for Embedding H-Minor Free Graphs Bodlaender, Hans L. et al. 2016
13 Definability Equals Recognizability for k-Outerplanar Graphs Jaffke, Lars et al. 2015
14 Practical Algorithms for Linear Boolean-width ten Brinke, Chiel B. et al. 2015
15 Graph Modification Problems (Dagstuhl Seminar 14071) Bodlaender, Hans L. et al. 2014
16 Cross-Composition: A New Technique for Kernelization Lower Bounds Bodlaender, Hans L. et al. 2011
17 Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter Jansen, Bart M. P. et al. 2011
18 Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set van Rooij, Johan M. M. et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 18


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