No. Title Author Year
1 A Faster Parameterized Algorithm for Pseudoforest Deletion Bodlaender, Hans L. et al. 2017
2 Cut and Count and Representative Sets on Branch Decompositions Pino, Willem J. A. et al. 2017
3 Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity Bodlaender, Hans L. et al. 2016
4 Subexponential Time Algorithms for Embedding H-Minor Free Graphs Bodlaender, Hans L. et al. 2016
5 Definability Equals Recognizability for k-Outerplanar Graphs Jaffke, Lars et al. 2015
6 Practical Algorithms for Linear Boolean-width ten Brinke, Chiel B. et al. 2015
7 Graph Modification Problems (Dagstuhl Seminar 14071) Bodlaender, Hans L. et al. 2014
8 Cross-Composition: A New Technique for Kernelization Lower Bounds Bodlaender, Hans L. et al. 2011
9 Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter Jansen, Bart M. P. et al. 2011
10 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: 10

DROPS-Home | Fulltext Search | Imprint Published by LZI