No. Title Author Year
1 Front Matter, Table of Contents, Preface, Conference Organization Paul, Christophe et al. 2019
2 Front Matter, Table of Contents, Preface, Conference Organization Niedermeier, Rolf et al. 2019
3 LIPIcs, Volume 115, IPEC'18, Complete Volume Paul, Christophe et al. 2019
4 LIPIcs, Volume 126, STACS'19, Complete Volume Niedermeier, Rolf et al. 2019
5 Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter Baste, Julien et al. 2018
6 Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs Barbero, Florian et al. 2017
7 An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion Kanté, Mamadou Moustapha et al. 2015
8 Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism Kim, Eun Jung et al. 2015
9 Explicit Linear Kernels via Dynamic Programming Garnero, Valentin et al. 2014
10 Obtaining a Bipartite Graph by Contracting Few Edges Heggernes, Pinar et al. 2011
Current Page :
Number of result pages: 2
Number of documents: 11


DROPS-Home | Imprint | Privacy Published by LZI