No. Title Author Year
1 Tighter Connections Between Formula-SAT and Shaving Logs Abboud, Amir et al. 2018
2 Brief Announcement: A Note on Hardness of Diameter Approximation Bringmann, Karl et al. 2017
3 Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars Bringmann, Karl et al. 2017
4 Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs Bringmann, Karl et al. 2017
5 Maximum Volume Subset Selection for Anchored Boxes Bringmann, Karl et al. 2017
6 On Algebraic Branching Programs of Small Width Bringmann, Karl et al. 2017
7 Sampling Geometric Inhomogeneous Random Graphs in Linear Time Bringmann, Karl et al. 2017
8 Hitting Set for Hypergraphs of Low VC-dimension Bringmann, Karl et al. 2016
9 Approximability of the Discrete Fréchet Distance Bringmann, Karl et al. 2015
10 Parameterized Complexity Dichotomy for Steiner Multicut Bringmann, Karl et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 11


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