| Publication | Date of Publication | Type |
|---|
| 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 |
| https://portal.mardi4nfdi.de/entity/Q5002699 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002700 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5140837 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5240418 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4608033 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598206 | 2017-12-19 | Paper |
| On (1,∊)-Restricted Assignment Makespan Minimization | 2017-10-05 | Paper |
| Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties | 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: Linear Programming 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 |
| A o(n) monotonicity tester for boolean functions over the hypercube | 2014-08-07 | Paper |
| Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids | 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 |
| 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 |
| Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs | 2011-08-17 | Paper |
| Social Welfare in One-Sided Matching Markets without Money | 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 |
| \(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 |
