No. Title Author Year
1 Dynamic Parameterized Problems and Algorithms Alman, Josh et al. 2017
2 Preserving Distances in Very Faulty Graphs Bodwin, Greg et al. 2017
3 Structure and Hardness in P (Dagstuhl Seminar 16451) Lewenstein, Moshe et al. 2017
4 A 7/3-Approximation for Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2016
5 Deterministic Time-Space Trade-Offs for k-SUM Lincoln, Andrea et al. 2016
6 Fine-Grained Algorithms and Complexity (Invited Talk) Vassilevska Williams, Virginia 2016
7 RNA-Folding - From Hardness to Algorithms (Invited Talk) Vassilevska Williams, Virginia 2016
8 Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) Vassilevska Williams, Virginia 2015
Current Page :
Number of result pages: 1
Number of documents: 8

DROPS-Home | Fulltext Search | Imprint Published by LZI