No. Title Author Year
1 Approximating Min-Diameter: Standard and Bichromatic Berger, Aaron et al. 2023
2 Faster Detours in Undirected Graphs Akmal, Shyan et al. 2023
3 On Diameter Approximation in Directed Graphs Abboud, Amir et al. 2023
4 Dynamic Matching Algorithms Under Vertex Updates Le, Hung et al. 2022
5 Hardness of Token Swapping on Trees Aichholzer, Oswin et al. 2022
6 Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds Mathialagan, Surya et al. 2022
7 New Additive Approximations for Shortest Paths and Cycles Deng, Mingyang et al. 2022
8 New Lower Bounds and Upper Bounds for Listing Avoidable Vertices Deng, Mingyang et al. 2022
9 3SUM and Related Problems in Fine-Grained Complexity (Invited Talk) Vassilevska Williams, Virginia 2021
10 Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths Chan, Timothy M. et al. 2021
11 Distributed Distance Approximation Ancona, Bertie et al. 2021
12 Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths Gu, Yuzhou et al. 2021
13 Fine-Grained Hardness for Edit Distance to a Fixed Sequence Abboud, Amir et al. 2021
14 Improved Approximation for Longest Common Subsequence over Small Alphabets Akmal, Shyan et al. 2021
15 Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph Dalirrooyfard, Mina et al. 2020
16 Monochromatic Triangles, Intermediate Matrix Products, and Convolutions Lincoln, Andrea et al. 2020
17 OV Graphs Are (Probably) Hard Instances Alman, Josh et al. 2020
18 Towards Optimal Set-Disjointness and Set-Intersection Data Structures Kopelowitz, Tsvi et al. 2020
19 Fine-grained Algorithms and Complexity Vassilevska Williams, Virginia 2018
20 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
21 Further Limitations of the Known Approaches for Matrix Multiplication Alman, Josh et al. 2018
22 Conditional Hardness for Sensitivity Problems Henzinger, Monika et al. 2017
23 Dynamic Parameterized Problems and Algorithms Alman, Josh et al. 2017
24 Metatheorems for Dynamic Weighted Matching Stubbs, Daniel et al. 2017
25 Preserving Distances in Very Faulty Graphs Bodwin, Greg et al. 2017
26 Structure and Hardness in P (Dagstuhl Seminar 16451) Lewenstein, Moshe et al. 2017
27 A 7/3-Approximation for Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2016
28 Deterministic Time-Space Trade-Offs for k-SUM Lincoln, Andrea et al. 2016
29 Fine-Grained Algorithms and Complexity (Invited Talk) Vassilevska Williams, Virginia 2016
30 RNA-Folding - From Hardness to Algorithms (Invited Talk) Vassilevska Williams, Virginia 2016
31 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: 31

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