No. Title Author Year
1 Locality Sensitive Hashing for Efficient Similar Polygon Retrieval Kaplan, Haim et al. 2021
2 How to Find a Point in the Convex Hull Privately Kaplan, Haim et al. 2020
3 Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations Kaplan, Haim et al. 2020
4 Sample Complexity Bounds for Influence Maximization Sadeh, Gal et al. 2020
5 A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games Dorfman, Dani et al. 2019
6 General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem Aiger, Dror et al. 2019
7 Triangles and Girth in Disk Graphs and Transmission Graphs Kaplan, Haim et al. 2019
8 Approximate Minimum-Weight Matching with Outliers Under Translation Agarwal, Pankaj K. et al. 2018
9 Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees Dorfman, Dani et al. 2018
10 Pairing heaps: the forward variant Dorfman, Dani et al. 2018
11 Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps Kaplan, Haim et al. 2018
12 Stabbing Pairwise Intersecting Disks by Five Points Har-Peled, Sariel et al. 2018
13 Union of Hypercubes and 3D Minkowski Sums with Random Sizes Agarwal, Pankaj K. et al. 2018
14 Clustering in Hypergraphs to Minimize Average Edge Service Time Rottenstreich, Ori et al. 2017
15 Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points Kaplan, Haim et al. 2017
16 Min-Cost Bipartite Perfect Matching with Delays Ashlagi, Itai et al. 2017
17 Output Sensitive Algorithms for Approximate Incidences and Their Applications Aiger, Dror et al. 2017
18 Bottleneck Paths and Trees and Deterministic Graphical Games Chechik, Shiri et al. 2016
19 Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees Chechik, Shiri et al. 2015
20 Minimum Cost Flows in Graphs with Unit Capacities Goldberg, Andrew V. et al. 2015
21 Spanners and Reachability Oracles for Directed Transmission Graphs Kaplan, Haim et al. 2015
22 Minimum s-t cut in undirected planar graphs when the source and the sink are close Kaplan, Haim et al. 2011
23 Strong Price of Anarchy for Machine Load Balancing Fiat, Amos et al. 2007
Current Page :
Number of result pages: 1
Number of documents: 23


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