| Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction. | 0 | 0.34 | 2022 |
| Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence. | 0 | 0.34 | 2022 |
| Adaptive Gradient Methods For Constrained Convex Optimization And Variational Inequalities | 0 | 0.34 | 2021 |
| An Efficient Framework for Balancing Submodularity and Cost | 0 | 0.34 | 2021 |
| Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints. | 0 | 0.34 | 2020 |
| Improved Convergence for $\ell_\infty$ and $\ell_1$ Regression via Iteratively Reweighted Least Squares. | 0 | 0.34 | 2019 |
| Submodular Maximization with Matroid and Packing Constraints in Parallel. | 2 | 0.38 | 2019 |
| Parallel Algorithm for Non-Monotone DR-Submodular Maximization. | 0 | 0.34 | 2019 |
| CONSTANT CONGESTION ROUTING OF SYMMETRIC DEMANDS IN PLANAR DIRECTED GRAPHS | 1 | 0.37 | 2018 |
| Submodular Unsplittable Flow on Trees. | 1 | 0.35 | 2018 |
| A Parallel Double Greedy Algorithm for Submodular Maximization. | 1 | 0.36 | 2018 |
| Decomposable Submodular Function Minimization: Discrete and Continuous. | 3 | 0.39 | 2017 |
| A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint. | 1 | 0.35 | 2017 |
| Approximation Algorithms for Stochastic k-TSP. | 0 | 0.34 | 2017 |
| On Approximating Maximum Independent Set of Rectangles | 3 | 0.40 | 2016 |
| Constrained Submodular Maximization: Beyond 1/e | 11 | 0.54 | 2016 |
| A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns. | 5 | 0.43 | 2016 |
| Online Buy-at-Bulk Network Design. | 0 | 0.34 | 2015 |
| Examining User Experiences through a Multimodal BCI Puzzle Game | 2 | 0.37 | 2015 |
| On Routing Disjoint Paths in Bounded Treewidth Graphs | 2 | 0.40 | 2015 |
| The all-or-nothing flow problem in directed graphs with symmetric demand pairs. | 0 | 0.34 | 2015 |
| The Power of Randomization: Distributed Submodular Maximization on Massive Datasets. | 22 | 0.88 | 2015 |
| Online Buy-at-Bulk Network Design | 1 | 0.36 | 2015 |
| A New Framework for Distributed Submodular Maximization | 13 | 0.90 | 2015 |
| Comparing interaction techniques for serious games through brain-computer interfaces:a user perception evaluation study | 4 | 0.42 | 2014 |
| Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements | 0 | 0.34 | 2014 |
| Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture. | 1 | 0.37 | 2014 |
| From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route? | 2 | 0.38 | 2014 |
| Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems | 2 | 0.51 | 2013 |
| Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small | 7 | 0.45 | 2013 |
| Poly-logarithmic approximation for maximum node disjoint paths with constant congestion | 14 | 0.98 | 2013 |
| Local distribution and the symmetry gap: approximability of multiway partitioning problems | 14 | 0.59 | 2013 |
| Assessing Brain-Computer Interfaces for Controlling Serious Games. | 3 | 0.39 | 2013 |
| Prize-Collecting Survivable Network Design in Node-Weighted Graphs. | 4 | 0.41 | 2012 |
| Approximation algorithms and hardness of integral concurrent flow | 1 | 0.36 | 2012 |
| Geometric packing under non-uniform constraints | 7 | 0.52 | 2012 |
| Node-weighted network design in planar and minor-closed families of graphs | 4 | 0.44 | 2012 |
| Fast clustering using MapReduce | 93 | 2.43 | 2011 |
| Approximation Algorithms for Submodular Multiway Partition | 16 | 0.69 | 2011 |
| Prize-collecting Steiner problems on planar graphs | 12 | 0.56 | 2011 |
| Submodular cost allocation problem and applications | 11 | 0.62 | 2011 |
| Prize-Collecting Steiner Tree and Forest in Planar Graphs | 2 | 0.37 | 2010 |
| Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs | 25 | 1.09 | 2009 |
| Fast exact and heuristic methods for role minimization problems | 119 | 3.69 | 2008 |
