No. Title Author Year
1 How Hard Is It to Satisfy (Almost) All Roommates? Chen, Jiehua et al. 2018
2 Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors Guo, Jiong et al. 2017
3 LIPIcs, Volume 63, IPEC'16, Complete Volume Guo, Jiong et al. 2017
4 Lossy Kernels for Hitting Subgraphs Eiben, Eduard et al. 2017
5 Randomization in Parameterized Complexity (Dagstuhl Seminar 17041) Cygan, Marek et al. 2017
6 Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems Fluschnik, Till et al. 2016
7 Parameterized Complexity Dichotomy for Steiner Multicut Bringmann, Karl et al. 2015
8 Parameterized Complexity of Critical Node Cuts Hermelin, Danny et al. 2015
9 Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs Hermelin, Danny et al. 2015
10 A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression Hermelin, Danny et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 10


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