No. Title Author Year
1 Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter Baste, Julien et al. 2018
2 Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs Barbero, Florian et al. 2017
3 An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion Kanté, Mamadou Moustapha et al. 2015
4 Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism Kim, Eun Jung et al. 2015
5 Explicit Linear Kernels via Dynamic Programming Garnero, Valentin et al. 2014
6 Obtaining a Bipartite Graph by Contracting Few Edges Heggernes, Pinar et al. 2011
7 Kernels for Feedback Arc Set In Tournaments Bessy, Stéphane et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 7


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