No. Title Author Year
1 A Linear-Time n^{0.4}-Approximation for Longest Common Subsequence Bringmann, Karl et al. 2021
2 Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal Bringmann, Karl et al. 2021
3 Fast n-Fold Boolean Convolution via Additive Combinatorics Bringmann, Karl et al. 2021
4 Fine-Grained Completeness for Optimization in P Bringmann, Karl et al. 2021
5 Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation Bringmann, Karl et al. 2021
6 Faster Minimization of Tardy Processing Time on a Single Machine Bringmann, Karl et al. 2020
7 Scheduling Lower Bounds via AND Subset Sum Abboud, Amir et al. 2020
8 When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation Bringmann, Karl et al. 2020
9 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
10 Fine-Grained Complexity Theory (Tutorial) Bringmann, Karl 2019
11 Multivariate Analysis of Orthogonal Range Searching and Graph Distances Bringmann, Karl et al. 2019
12 On Geometric Set Cover for Orthants Bringmann, Karl et al. 2019
13 Polyline Simplification has Cubic Complexity Bringmann, Karl et al. 2019
14 Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance Bringmann, Karl et al. 2019
15 Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS Bringmann, Karl et al. 2018
16 Tighter Connections Between Formula-SAT and Shaving Logs Abboud, Amir et al. 2018
17 Brief Announcement: A Note on Hardness of Diameter Approximation Bringmann, Karl et al. 2017
18 Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars Bringmann, Karl et al. 2017
19 Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs Bringmann, Karl et al. 2017
20 Maximum Volume Subset Selection for Anchored Boxes Bringmann, Karl et al. 2017
21 On Algebraic Branching Programs of Small Width Bringmann, Karl et al. 2017
22 Sampling Geometric Inhomogeneous Random Graphs in Linear Time Bringmann, Karl et al. 2017
23 Hitting Set for Hypergraphs of Low VC-dimension Bringmann, Karl et al. 2016
24 Approximability of the Discrete Fréchet Distance Bringmann, Karl et al. 2015
25 Parameterized Complexity Dichotomy for Steiner Multicut Bringmann, Karl et al. 2015
26 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: 26


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