| Publication | Date of Publication | Type |
|---|
A \(d^{1/2+o(1)}\) monotonicity tester for Boolean functions on \(d\)-dimensional hypergrids
SIAM Journal on Computing | 2026-07-08 | Paper |
| Learning partitions using rank queries | 2026-06-12 | Paper |
| Revisiting priority k-center: fairness and outliers | 2026-05-12 | Paper |
A primal-dual algorithm for monotone submodular maximization
Operations Research Letters | 2026-04-24 | Paper |
| Fault-tolerant k-supplier with outliers | 2025-11-10 | Paper |
| A \(d^{1/2+o(1)}\) monotonicity tester for Boolean functions on \(d\)-dimensional hypergrids | 2025-08-15 | Paper |
| Improved lower bounds for submodular function minimization | 2025-08-15 | Paper |
| A polynomial lower bound on the number of rounds for parallel submodular function minimization | 2025-08-13 | Paper |
| Faster matroid intersection | 2025-08-12 | Paper |
| Online buy-at-bulk network design | 2025-08-05 | Paper |
| Approximation algorithms for continuous clustering and facility location problems | 2025-06-19 | Paper |
| Learning spanning forests optimally in weighted undirected graphs with CUT queries | 2025-03-06 | Paper |
| A query algorithm for learning a spanning forest in weighted undirected graphs | 2025-02-24 | Paper |
| On a decentralized ( +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
(available as arXiv preprint) | 2023-09-20 | Paper |
The Non-Uniform <i>k</i> -Center Problem
ACM Transactions on Algorithms | 2023-04-26 | Paper |
Robust \(k\)-center with two types of radii
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Adaptive Boolean Monotonicity Testing in Total Influence Time
(available as arXiv preprint) | 2022-07-18 | Paper |
Simpler and Better Algorithms for Minimum-Norm Load Balancing
(available as arXiv preprint) | 2022-05-11 | Paper |
Robust \(k\)-center with two types of radii
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median
(available as arXiv preprint) | 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
Mathematical Programming. Series A. Series B | 2021-07-02 | Paper |
Domain Reduction for Monotonicity Testing: A <i>o</i>(<i>d</i>) Tester for Boolean Functions in <i>d</i>-Dimensions
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Optimal unateness testers for real-valued functions: adaptivity helps
Theory of Computing | 2020-12-17 | Paper |
Optimal unateness testers for real-valued functions: Adaptivity helps
(available as arXiv preprint) | 2020-05-27 | Paper |
Deterministic dynamic matching in \(O(1)\) update time
Algorithmica | 2020-02-28 | Paper |
Approximation algorithms for minimum norm and ordered optimization problems
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Generalized center problems with outliers
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Generalized center problems with outliers
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
(available as arXiv preprint) | 2019-10-25 | Paper |
Property Testing on Product Distributions
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Online Buy-at-Bulk Network Design
SIAM Journal on Computing | 2018-08-03 | Paper |
scientific article; zbMATH DE number 6850309 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6850309 (Why is no real title available?) | 2018-03-15 | Paper |
A \(o(d) \cdot \operatorname{polylog} n\) monotonicity tester for Boolean functions over the hypergrid \([n]^d\)
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2017-12-19 | Paper |
On (1,)-restricted assignment makespan minimization
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time
(available as arXiv preprint) | 2017-08-31 | Paper |
The heterogeneous capacitated \(k\)-center problem
(available as arXiv preprint) | 2017-08-31 | Paper |
Subquadratic submodular function minimization
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Welfare maximization and truthfulness in mechanism design with ordinal preferences
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Facility location with client latencies: LP-based techniques for minimum-latency problems
Mathematics of Operations Research | 2016-08-10 | Paper |
An o(n) monotonicity tester for Boolean functions over the hypercube
SIAM Journal on Computing | 2016-05-12 | Paper |
Recognizing coverage functions
SIAM Journal on Discrete Mathematics | 2015-09-02 | Paper |
Approximability of capacitated network design
Algorithmica | 2015-07-10 | Paper |
Approximability of capacitated network design
Algorithmica | 2015-07-10 | Paper |
scientific article; zbMATH DE number 6395191 (Why is no real title available?)
Theory of Computing | 2015-02-03 | Paper |
A \(o(n)\) monotonicity tester for Boolean functions over the hypercube
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
On allocating goods to maximize fairness
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Submodularity helps in Nash and nonsymmetric bargaining games
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Capacitated network design on undirected graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
An optimal lower bound for monotonicity testing over hypergrids
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Testing coverage functions
Automata, Languages, and Programming | 2013-08-12 | Paper |
Hypergraphic LP relaxations for Steiner trees
SIAM Journal on Discrete Mathematics | 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
Algorithmica | 2012-04-26 | Paper |
New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
Mathematical Programming. Series A. Series B | 2011-11-23 | Paper |
Optimal lower bounds for universal and differentially private Steiner trees and TSPs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Optimal lower bounds for universal and differentially private Steiner trees and TSPs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Social welfare in one-sided matching markets without money
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Approximability of capacitated network design
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Facility location with client latencies: linear programming based techniques for minimum latency problems
Lecture Notes in Computer Science | 2011-06-24 | Paper |
Rationality and strongly polynomial solvability of Eisenberg-Gale markets with two agents
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Design is as easy as optimization
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP
SIAM Journal on Computing | 2011-01-17 | Paper |
On column-restricted and priority covering integer programs
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Hypergraphic LP relaxations for Steiner trees
Lecture Notes in Computer Science | 2010-06-22 | Paper |
G-parking functions, acyclic orientations and spanning trees
Discrete Mathematics | 2010-04-27 | Paper |
Approximation algorithms for the firefighter problem: cuts over time and submodularity
Algorithms and Computation | 2009-12-17 | Paper |
On competitiveness in uniform utility allocation markets
Operations Research Letters | 2009-08-14 | Paper |
Design Is as Easy as Optimization
Automata, Languages and Programming | 2009-03-12 | Paper |
Efficiency, Fairness and Competitiveness in Nash Bargaining Games
Lecture Notes in Computer Science | 2009-01-22 | Paper |
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
