| Publication | Date of Publication | Type |
|---|
| On a decentralized \((\Delta +1)\)-graph coloring algorithm | 2024-05-14 | Paper |
| Directed isoperimetric theorems for Boolean functions on the hypergrid and an \(\widetilde{O}(n\sqrt{d})\) monotonicity tester | 2024-05-08 | Paper |
| Graph connectivity and single element recovery via linear and OR queries | 2023-09-20 | Paper |
| The Non-Uniform k -Center Problem | 2023-04-26 | Paper |
| Robust \(k\)-center with two types of radii | 2023-03-14 | Paper |
| Adaptive Boolean Monotonicity Testing in Total Influence Time | 2022-07-18 | Paper |
| Simpler and Better Algorithms for Minimum-Norm Load Balancing | 2022-05-11 | Paper |
| Robust \(k\)-center with two types of radii | 2021-12-21 | Paper |
| Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median | 2021-07-28 | Paper |
| Generalized center problems with outliers | 2021-07-28 | Paper |
| Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling | 2021-07-02 | Paper |
| Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions | 2021-02-02 | Paper |
| Optimal unateness testers for real-valued functions: adaptivity helps | 2020-12-17 | Paper |
| Optimal unateness testers for real-valued functions: Adaptivity helps | 2020-05-27 | Paper |
| Deterministic dynamic matching in \(O(1)\) update time | 2020-02-28 | Paper |
| Approximation algorithms for minimum norm and ordered optimization problems | 2020-01-30 | Paper |
| Generalized center problems with outliers | 2019-11-25 | Paper |
| Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling | 2019-10-25 | Paper |
| Property Testing on Product Distributions | 2018-11-05 | Paper |
| Online Buy-at-Bulk Network Design | 2018-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607872 | 2018-03-15 | Paper |
| A \(o(d) \cdot \operatorname{polylog} n\) monotonicity tester for Boolean functions over the hypergrid \([n]^d\) | 2018-03-15 | Paper |
| The non-uniform \(k\)-center problem | 2017-12-19 | Paper |
| Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties | 2017-10-05 | Paper |
| On \((1,\varepsilon)\)-restricted assignment makespan minimization | 2017-10-05 | Paper |
| Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time | 2017-08-31 | Paper |
| The heterogeneous capacitated \(k\)-center problem | 2017-08-31 | Paper |
| Subquadratic submodular function minimization | 2017-08-17 | Paper |
| Welfare maximization and truthfulness in mechanism design with ordinal preferences | 2017-05-19 | Paper |
| Facility location with client latencies: LP-based techniques for minimum-latency problems | 2016-08-10 | Paper |
| An \(o(n)\) monotonicity tester for Boolean functions over the hypercube | 2016-05-12 | Paper |
| Recognizing Coverage Functions | 2015-09-02 | Paper |
| Approximability of capacitated network design | 2015-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5497118 | 2015-02-03 | Paper |
| Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids | 2014-08-07 | Paper |
| A \(o(n)\) monotonicity tester for Boolean functions over the hypercube | 2014-08-07 | Paper |
| On allocating goods to maximize fairness | 2014-07-25 | Paper |
| Submodularity helps in Nash and nonsymmetric bargaining games | 2014-06-19 | Paper |
| Capacitated network design on undirected graphs | 2013-10-04 | Paper |
| An optimal lower bound for monotonicity testing over hypergrids | 2013-10-04 | Paper |
| Testing coverage functions | 2013-08-12 | Paper |
| Hypergraphic LP relaxations for Steiner trees | 2013-06-27 | Paper |
| Algorithms for message ferrying on mobile ad hoc networks | 2012-10-24 | Paper |
| Approximability of the firefighter problem. Computing cuts over time | 2012-04-26 | Paper |
| New geometry-inspired relaxations and algorithms for the metric Steiner tree problem | 2011-11-23 | Paper |
| Social welfare in one-sided matching markets without money | 2011-08-17 | Paper |
| Optimal lower bounds for universal and differentially private Steiner trees and TSPs | 2011-08-17 | Paper |
| Approximability of capacitated network design | 2011-06-24 | Paper |
| Facility location with client latencies: linear programming based techniques for minimum latency problems | 2011-06-24 | Paper |
| Rationality and strongly polynomial solvability of Eisenberg-Gale markets with two agents | 2011-06-17 | Paper |
| Design is as easy as optimization | 2011-03-15 | Paper |
| On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP | 2011-01-17 | Paper |
| On column-restricted and priority covering integer programs | 2010-06-22 | Paper |
| Hypergraphic LP relaxations for Steiner trees | 2010-06-22 | Paper |
| \(G\)-parking functions, acyclic orientations and spanning trees | 2010-04-27 | Paper |
| Approximation algorithms for the firefighter problem: cuts over time and submodularity | 2009-12-17 | Paper |
| On competitiveness in uniform utility allocation markets | 2009-08-14 | Paper |
| Design Is as Easy as Optimization | 2009-03-12 | Paper |
| Efficiency, Fairness and Competitiveness in Nash Bargaining Games | 2009-01-22 | Paper |
| New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem | 2008-06-10 | Paper |
