No. Title Author Year
1 Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity Andoni, Alexandr et al. 2019
2 Approximate Matchings in Massive Graphs via Local Structure (Invited Talk) Stein, Clifford 2018
3 Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms Arar, Moab et al. 2018
4 Scheduling (Dagstuhl Seminar 18101) Halldórson, Magnús M. et al. 2018
5 Submodular Secretary Problem with Shortlists Agrawal, Shipra et al. 2018
6 Extending Search Phases in the Micali-Vazirani Algorithm Huang, Michael et al. 2017
7 Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing Im, Sungjin et al. 2017
8 Simultaneously Load Balancing for Every p-norm, With Reassignments Bernstein, Aaron et al. 2017
9 A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems Marasevic, Jelena et al. 2016
10 Scheduling (Dagstuhl Seminar 16081) Bansal, Nikhil et al. 2016
11 A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs Bansal, Nikhil et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 11


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