No. Title Author Year
1 Approximate Minimum-Weight Matching with Outliers Under Translation Agarwal, Pankaj K. et al. 2018
2 Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees Dorfman, Dani et al. 2018
3 Pairing heaps: the forward variant Dorfman, Dani et al. 2018
4 Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps Kaplan, Haim et al. 2018
5 Stabbing Pairwise Intersecting Disks by Five Points Har-Peled, Sariel et al. 2018
6 Union of Hypercubes and 3D Minkowski Sums with Random Sizes Agarwal, Pankaj K. et al. 2018
7 Clustering in Hypergraphs to Minimize Average Edge Service Time Rottenstreich, Ori et al. 2017
8 Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points Kaplan, Haim et al. 2017
9 Min-Cost Bipartite Perfect Matching with Delays Ashlagi, Itai et al. 2017
10 Output Sensitive Algorithms for Approximate Incidences and Their Applications Aiger, Dror et al. 2017
Current Page :
Number of result pages: 2
Number of documents: 16


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