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


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