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


DROPS-Home | Fulltext Search | Imprint Published by LZI