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


DROPS-Home | Imprint | Privacy Published by LZI