No. Title Author Year
1 Brief Announcement: A Note on Hardness of Diameter Approximation Bringmann, Karl et al. 2017
2 Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars Bringmann, Karl et al. 2017
3 Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs Bringmann, Karl et al. 2017
4 Maximum Volume Subset Selection for Anchored Boxes Bringmann, Karl et al. 2017
5 On Algebraic Branching Programs of Small Width Bringmann, Karl et al. 2017
6 Sampling Geometric Inhomogeneous Random Graphs in Linear Time Bringmann, Karl et al. 2017
7 Hitting Set for Hypergraphs of Low VC-dimension Bringmann, Karl et al. 2016
8 Approximability of the Discrete Fréchet Distance Bringmann, Karl et al. 2015
9 Parameterized Complexity Dichotomy for Steiner Multicut Bringmann, Karl et al. 2015
10 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: 10


DROPS-Home | Fulltext Search | Imprint Published by LZI