| Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds | 0 | 0.34 | 2022 |
| A Linear-Time n0.4-Approximation for Longest Common Subsequence. | 0 | 0.34 | 2021 |
| Fast n-Fold Boolean Convolution via Additive Combinatorics. | 0 | 0.34 | 2021 |
| Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal | 0 | 0.34 | 2021 |
| Faster Minimization of Tardy Processing Time on a Single Machine. | 0 | 0.34 | 2020 |
| Scheduling Lower Bounds via AND Subset Sum | 0 | 0.34 | 2020 |
| Multivariate Analysis of Orthogonal Range Searching and Graph Distances | 0 | 0.34 | 2020 |
| Impossibility Results for Grammar-Compressed Linear Algebra | 0 | 0.34 | 2020 |
| When Lipschitz Walks Your Dog - Algorithm Engineering of the Discrete Fréchet Distance Under Translation. | 0 | 0.34 | 2020 |
| Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. | 0 | 0.34 | 2019 |
| Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. | 0 | 0.34 | 2018 |
| Polyline Simplification has Cubic Complexity. | 0 | 0.34 | 2018 |
| Multivariate Analysis of Orthogonal Range Searching and Graph Distances. | 0 | 0.34 | 2018 |
| Maximum Volume Subset Selection for Anchored Boxes. | 2 | 0.35 | 2018 |
| A PTAS for 𝓁p-Low Rank Approximation. | 0 | 0.34 | 2018 |
| Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. | 0 | 0.34 | 2018 |
| A Note on Hardness of Diameter Approximation. | 1 | 0.36 | 2018 |
| On Algebraic Branching Programs of Small Width | 0 | 0.34 | 2017 |
| Brief Announcement: A Note on Hardness of Diameter Approximation. | 0 | 0.34 | 2017 |
| Sampling Geometric Inhomogeneous Random Graphs in Linear Time. | 3 | 0.39 | 2017 |
| Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. | 0 | 0.34 | 2017 |
| Greedy Routing and the Algorithmic Small-World Phenomenom. | 2 | 0.40 | 2017 |
| Approximability Of The Discrete Frechet Distance | 7 | 0.54 | 2016 |
| Ultra-fast Load Balancing on Scale-free Networks | 0 | 0.34 | 2015 |
| Efficient optimization of many objectives by approximation-guided evolution. | 10 | 0.50 | 2015 |
| Efficient Computation Of Two-Dimensional Solution Sets Maximizing The Epsilon-Indicator | 2 | 0.37 | 2015 |
| Hitting Set in hypergraphs of low VC-dimension | 0 | 0.34 | 2015 |
| Two-dimensional subset selection for hypervolume and epsilon-indicator | 26 | 0.92 | 2014 |
| Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract). | 0 | 0.34 | 2014 |
| Generic Postprocessing Via Subset Selection For Hypervolume And Epsilon-Indicator | 12 | 0.52 | 2014 |
| Convergence of Hypervolume-Based Archiving Algorithms | 5 | 0.41 | 2014 |
| Counting triangulations and other crossing-free structures approximately. | 3 | 0.39 | 2014 |
| Parameterized Complexity Dichotomy for Steiner Multicut. | 1 | 0.37 | 2014 |
| De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. | 2 | 0.38 | 2014 |
| Minimizing maximum (weighted) flow-time on related and unrelated machines | 5 | 0.42 | 2013 |
| Online checkpointing with improved worst-case guarantees | 2 | 0.39 | 2013 |
| Balls into bins via local search: cover time and maximum load. | 4 | 0.50 | 2013 |
| Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. | 1 | 0.37 | 2013 |
| Parameterized average-case complexity of the hypervolume indicator | 11 | 0.56 | 2013 |
| Counting Triangulations and Other Crossing-Free Structures via Onion Layers | 1 | 0.35 | 2013 |
| Approximation quality of the hypervolume indicator | 23 | 0.66 | 2013 |
| Counting Triangulations Approximately. | 0 | 0.34 | 2013 |
| Exact and efficient generation of geometric random variates and random graphs | 4 | 0.43 | 2013 |
| Speeding up many-objective optimization by Monte Carlo approximations | 17 | 0.56 | 2013 |
| Approximating the least hypervolume contributor: NP-hard in general, but fast in practice | 54 | 2.05 | 2012 |
| Counting crossing-free structures | 8 | 0.51 | 2012 |
| Convergence of hypervolume-based archiving algorithms ii: competitiveness | 3 | 0.40 | 2012 |
| Efficient sampling methods for discrete distributions | 2 | 0.38 | 2012 |
| Approximation-guided evolutionary multi-objective optimization | 34 | 1.12 | 2011 |
| The logarithmic hypervolume indicator | 8 | 0.44 | 2011 |
