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

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