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 A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties Bringmann, Karl et al. 2019
4 Fine-Grained Complexity Theory (Tutorial) Bringmann, Karl 2019
5 Multivariate Analysis of Orthogonal Range Searching and Graph Distances Bringmann, Karl et al. 2019
6 On Geometric Set Cover for Orthants Bringmann, Karl et al. 2019
7 Polyline Simplification has Cubic Complexity Bringmann, Karl et al. 2019
8 Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance Bringmann, Karl et al. 2019
9 Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS Bringmann, Karl et al. 2018
10 Tighter Connections Between Formula-SAT and Shaving Logs Abboud, Amir et al. 2018
11 Brief Announcement: A Note on Hardness of Diameter Approximation Bringmann, Karl et al. 2017
12 Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars Bringmann, Karl et al. 2017
13 Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs Bringmann, Karl et al. 2017
14 Maximum Volume Subset Selection for Anchored Boxes Bringmann, Karl et al. 2017
15 On Algebraic Branching Programs of Small Width Bringmann, Karl et al. 2017
16 Sampling Geometric Inhomogeneous Random Graphs in Linear Time Bringmann, Karl et al. 2017
17 Hitting Set for Hypergraphs of Low VC-dimension Bringmann, Karl et al. 2016
18 Approximability of the Discrete Fréchet Distance Bringmann, Karl et al. 2015
19 Parameterized Complexity Dichotomy for Steiner Multicut Bringmann, Karl et al. 2015
20 Balls into bins via local search: cover time and maximum load Bringmann, Karl et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 20


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