
A o(n) monotonicity tester for Boolean functions on the hypercube.
(eccc).
ACM Symposium on Theory of Computing (STOC), 2013.
We give a o(n) tester for monotonocity

Optimal bounds for monotonicity and Lipschitz testing over the hypercube
(eccc).
ACM Symposium on Theory of Computing (STOC), 2013.

Testing Coverage Functions.
(arxiv).
International Colloquium on Automata, Programming and Languages (ICALP), 2012.

Social Welfare in OneSided Matching Markets without Money.
(arxiv).
Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2011

Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs.
(arxiv).
Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2011

Approximability of Sparse Integer Programs.
(arxiv)
Algorithmica, 2011

Facility Location with Client Latencies: LinearProgramming based Techniques for MinimumLatency Problems.
(arxiv).
Integer Programming and Combinatorial Optimization (IPCO), 2011.

Approximability of Capacitated Network Design.
(arxiv).
Integer Programming and Combinatorial Optimization (IPCO), 2011.

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound.
(orl) (arxiv).
Operations Research Letters (ORL), 2010.

Hypergraphic LP Relaxations for Steiner Trees.
(preprint).
Integer Programming and Combinatorial Optimization (IPCO), 2010.

On Columnrestricted and Priority Covering Integer Programs.
(preprint).
Integer Programming and Combinatorial Optimization (IPCO), 2010.

Gparking functions, acyclic orientations and spanning trees.
(preprint)
Discrete Mathematics, 2010.

Foundations of Computer Science (FOCS), 2009.

Approximation Algorithms for the Firefighter
Problem:Computing Cuts over Time.
(conf) (journal)
Algorithmica, 2012.
International Symposium on
Algorithms And Computation (ISAAC), 2009.

Algorithms for Message Ferrying on Sparse and Disconnected Mobile ad hoc Networks.
(conf)
Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2009.

On the Approximability of Budgeted Allocations and
Improved Lower Bounds for Submodular Welfare Maximization and GAP.
(preprint)
(conf)
SIAM Journal of Computing, 2010.
Foundations of Computer Science (FOCS), 2008.

Efficiency, Fairness and Competitiveness in Nash Bargaining Games.
(preprint)(conf).
Workshop on Internet and Network Economics (WINE),2008.

Workshop on Internet and Network Economics (WINE),2008.

New GeometryInspired Relaxations and Algorithms for the Metric Steiner Tree Problem.
(journal)
Math Programming, Series A, 2009.
Integer Programming and Combinatorial Optimization (IPCO), 2008.

On Competitiveness in Uniform Utility Allocation Markets.
(preprint)
Operations Research Letters, 2009.
Workshop on Internet and Network
Economic (WINE), 2007.

Rationality and Strongly Polynomial Solvability of Two Agent EisenbergGale Markets.
(preprint)
SIAM Journal of Discrete Math, 2010.
Workshop on Internet and Network Economics (WINE), 2006.

SIAM Journal of Discrete Math (SIDMA), 2010.
International Colloquium on Automata, Programming and Languages (ICALP), 2006.

Fairness and Optimality in Congestion Games.
(conf)
ACM Conference on Electronic Commerce (EC), 2005.