No. Title Author Year
1 Union of Hypercubes and 3D Minkowski Sums with Random Sizes Agarwal, Pankaj K. et al. 2018
2 Clustering in Hypergraphs to Minimize Average Edge Service Time Rottenstreich, Ori et al. 2017
3 Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points Kaplan, Haim et al. 2017
4 Min-Cost Bipartite Perfect Matching with Delays Ashlagi, Itai et al. 2017
5 Output Sensitive Algorithms for Approximate Incidences and Their Applications Aiger, Dror et al. 2017
6 Bottleneck Paths and Trees and Deterministic Graphical Games Chechik, Shiri et al. 2016
7 Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees Chechik, Shiri et al. 2015
8 Minimum Cost Flows in Graphs with Unit Capacities Goldberg, Andrew V. et al. 2015
9 Spanners and Reachability Oracles for Directed Transmission Graphs Kaplan, Haim et al. 2015
10 Minimum s-t cut in undirected planar graphs when the source and the sink are close Kaplan, Haim et al. 2011
Current Page :
Number of result pages: 2
Number of documents: 11


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