No. Title Author Year
1 Typical Sequences Revisited - Computing Width Parameters of Graphs Bodlaender, Hans L. et al. 2020
2 Computing Treewidth on the GPU van der Zanden, Tom C. et al. 2018
3 On the Exact Complexity of Polyomino Packing Bodlaender, Hans L. et al. 2018
4 A Faster Parameterized Algorithm for Pseudoforest Deletion Bodlaender, Hans L. et al. 2017
5 Cut and Count and Representative Sets on Branch Decompositions Pino, Willem J. A. et al. 2017
6 Front Matter, Table of Contents, Preface, Conference Organization Larsen, Kim G. et al. 2017
7 LIPIcs, Volume 83, MFCS'17, Complete Volume Larsen, Kim G. et al. 2017
8 Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity Bodlaender, Hans L. et al. 2016
9 Subexponential Time Algorithms for Embedding H-Minor Free Graphs Bodlaender, Hans L. et al. 2016
10 Definability Equals Recognizability for k-Outerplanar Graphs Jaffke, Lars et al. 2015
11 Practical Algorithms for Linear Boolean-width ten Brinke, Chiel B. et al. 2015
12 Graph Modification Problems (Dagstuhl Seminar 14071) Bodlaender, Hans L. et al. 2014
13 Cross-Composition: A New Technique for Kernelization Lower Bounds Bodlaender, Hans L. et al. 2011
14 Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter Jansen, Bart M. P. et al. 2011
15 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: 15


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