No. Title Author Year
1 Computing Treewidth on the GPU van der Zanden, Tom C. et al. 2018
2 A Faster Parameterized Algorithm for Pseudoforest Deletion Bodlaender, Hans L. et al. 2017
3 Cut and Count and Representative Sets on Branch Decompositions Pino, Willem J. A. et al. 2017
4 Front Matter, Table of Contents, Preface, Conference Organization Larsen, Kim G. et al. 2017
5 LIPIcs, Volume 83, MFCS'17, Complete Volume Larsen, Kim G. et al. 2017
6 Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity Bodlaender, Hans L. et al. 2016
7 Subexponential Time Algorithms for Embedding H-Minor Free Graphs Bodlaender, Hans L. et al. 2016
8 Definability Equals Recognizability for k-Outerplanar Graphs Jaffke, Lars et al. 2015
9 Practical Algorithms for Linear Boolean-width ten Brinke, Chiel B. et al. 2015
10 Graph Modification Problems (Dagstuhl Seminar 14071) Bodlaender, Hans L. et al. 2014
Current Page :
Number of result pages: 2
Number of documents: 13


DROPS-Home | Fulltext Search | Imprint Published by LZI