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


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