No. Title Author Year
1 Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees Dorfman, Dani et al. 2018
2 Pairing heaps: the forward variant Dorfman, Dani et al. 2018
3 Union of Hypercubes and 3D Minkowski Sums with Random Sizes Agarwal, Pankaj K. et al. 2018
4 Clustering in Hypergraphs to Minimize Average Edge Service Time Rottenstreich, Ori et al. 2017
5 Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points Kaplan, Haim et al. 2017
6 Min-Cost Bipartite Perfect Matching with Delays Ashlagi, Itai et al. 2017
7 Output Sensitive Algorithms for Approximate Incidences and Their Applications Aiger, Dror et al. 2017
8 Bottleneck Paths and Trees and Deterministic Graphical Games Chechik, Shiri et al. 2016
9 Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees Chechik, Shiri et al. 2015
10 Minimum Cost Flows in Graphs with Unit Capacities Goldberg, Andrew V. et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 13


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