No. Title Author Year
1 An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility Cardinal, Jean et al. 2021
2 Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model Aronov, Boris et al. 2021
3 Worst-Case Efficient Dynamic Geometric Independent Set Cardinal, Jean et al. 2021
4 Geometric Pattern Matching Reduces to k-SUM Aronov, Boris et al. 2020
5 Sparse Regression via Range Counting Cardinal, Jean et al. 2020
6 Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems Cardinal, Jean et al. 2018
7 Subquadratic Encodings for Point Configurations Cardinal, Jean et al. 2018
8 Subquadratic Algorithms for Algebraic Generalizations of 3SUM Barba, Luis et al. 2017
9 Solving k-SUM Using Few Linear Queries Cardinal, Jean et al. 2016
10 Arc Diagrams, Flip Distances, and Hamiltonian Triangulations Cardinal, Jean et al. 2015
11 Recognition and Complexity of Point Visibility Graphs Cardinal, Jean et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 11

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