No. Title Author Year
1 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
2 Fine-Grained Complexity Theory (Tutorial) Bringmann, Karl 2019
3 Multivariate Analysis of Orthogonal Range Searching and Graph Distances Bringmann, Karl et al. 2019
4 Polyline Simplification has Cubic Complexity Bringmann, Karl et al. 2019
5 Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance Bringmann, Karl et al. 2019
6 Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS Bringmann, Karl et al. 2018
7 Tighter Connections Between Formula-SAT and Shaving Logs Abboud, Amir et al. 2018
8 Brief Announcement: A Note on Hardness of Diameter Approximation Bringmann, Karl et al. 2017
9 Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars Bringmann, Karl et al. 2017
10 Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs Bringmann, Karl et al. 2017
Current Page :
Number of result pages: 2
Number of documents: 17


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