2009 |
41 | EE | Moshe Babaioff,
Michael Dinitz,
Anupam Gupta,
Nicole Immorlica,
Kunal Talwar:
Secretary problems: weights and discounts.
SODA 2009: 1245-1254 |
40 | EE | Anupam Gupta,
Katrina Ligett,
Frank McSherry,
Aaron Roth,
Kunal Talwar:
Differentially Private Approximation Algorithms
CoRR abs/0903.4510: (2009) |
2008 |
39 | EE | Rina Panigrahy,
Kunal Talwar,
Udi Wieder:
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match.
FOCS 2008: 414-423 |
38 | EE | David B. Shmoys,
Kunal Talwar:
A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem.
IPCO 2008: 331-343 |
37 | EE | Anupam Gupta,
Kunal Talwar:
How to Complete a Doubling Metric.
LATIN 2008: 36-47 |
36 | EE | Maleq Khan,
Fabian Kuhn,
Dahlia Malkhi,
Gopal Pandurangan,
Kunal Talwar:
Efficient distributed approximation algorithms via probabilistic tree embeddings.
PODC 2008: 263-272 |
35 | EE | T.-H. Hubert Chan,
Anupam Gupta,
Kunal Talwar:
Ultra-low-dimensional embeddings for doubling metrics.
SODA 2008: 333-342 |
34 | EE | Jittat Fakcharoenphol,
Satish Rao,
Kunal Talwar:
Approximating Metric Spaces by Tree Metrics.
Encyclopedia of Algorithms 2008 |
2007 |
33 | EE | Nicole Immorlica,
Anna R. Karlin,
Mohammad Mahdian,
Kunal Talwar:
Balloon Popping With Applications to Ascending Auctions.
FOCS 2007: 104-112 |
32 | EE | Frank McSherry,
Kunal Talwar:
Mechanism Design via Differential Privacy.
FOCS 2007: 94-103 |
31 | EE | Ittai Abraham,
Mahesh Balakrishnan,
Fabian Kuhn,
Dahlia Malkhi,
Venugopalan Ramasubramanian,
Kunal Talwar:
Reconstructing approximate tree metrics.
PODC 2007: 43-52 |
30 | EE | Boaz Barak,
Kamalika Chaudhuri,
Cynthia Dwork,
Satyen Kale,
Frank McSherry,
Kunal Talwar:
Privacy, accuracy, and consistency too: a holistic solution to contingency table release.
PODS 2007: 273-282 |
29 | EE | Julia Chuzhoy,
Venkatesan Guruswami,
Sanjeev Khanna,
Kunal Talwar:
Hardness of routing with congestion in directed graphs.
STOC 2007: 165-178 |
28 | EE | Kunal Talwar,
Udi Wieder:
Balanced allocations: the weighted case.
STOC 2007: 256-265 |
27 | EE | Cynthia Dwork,
Frank McSherry,
Kunal Talwar:
The price of privacy and the limits of LP decoding.
STOC 2007: 85-94 |
26 | EE | Anupam Gupta,
Kunal Talwar:
How to Complete a Doubling Metric
CoRR abs/0712.3331: (2007) |
25 | EE | Matthew Andrews,
Julia Chuzhoy,
Venkatesan Guruswami,
Sanjeev Khanna,
Kunal Talwar,
Lisa Zhang:
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs.
Electronic Colloquium on Computational Complexity (ECCC) 14(113): (2007) |
24 | EE | Dinesh Garg,
Kamal Jain,
Kunal Talwar,
Vijay V. Vazirani:
A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property.
Theor. Comput. Sci. 378(2): 143-152 (2007) |
2006 |
23 | EE | Kamalika Chaudhuri,
Satish Rao,
Samantha Riesenfeld,
Kunal Talwar:
A Push-Relabel Algorithm for Approximating Degree Bounded MSTs.
ICALP (1) 2006: 191-201 |
22 | EE | Anupam Gupta,
Kunal Talwar:
Approximating unique games.
SODA 2006: 99-106 |
21 | EE | Venkatesan Guruswami,
Kunal Talwar:
Hardness of Low Congestion Routing in Directed Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 13(141): (2006) |
2005 |
20 | EE | Kamalika Chaudhuri,
Satish Rao,
Samantha Riesenfeld,
Kunal Talwar:
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.
APPROX-RANDOM 2005: 26-39 |
19 | EE | Uriel Feige,
Kunal Talwar:
Approximating the Bandwidth of Caterpillars.
APPROX-RANDOM 2005: 62-73 |
18 | EE | Kamal Jain,
Mohammad Taghi Hajiaghayi,
Kunal Talwar:
The Generalized Deadlock Resolution Problem.
ICALP 2005: 853-865 |
17 | EE | Shuchi Chawla,
Cynthia Dwork,
Frank McSherry,
Kunal Talwar:
On Privacy-Preserving Histograms.
UAI 2005 |
16 | EE | Kamal Jain,
Aranyak Mehta,
Kunal Talwar,
Vijay V. Vazirani:
A Simple Characterization for Truth-Revealing Single-Item Auctions.
WINE 2005: 122-128 |
15 | EE | Dinesh Garg,
Kamal Jain,
Kunal Talwar,
Vijay V. Vazirani:
A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property.
WINE 2005: 24-33 |
14 | EE | Nicole Immorlica,
Kamal Jain,
Mohammad Mahdian,
Kunal Talwar:
Click Fraud Resistant Methods for Learning Click-Through Rates.
WINE 2005: 34-45 |
2004 |
13 | EE | Aaron Archer,
Jittat Fakcharoenphol,
Chris Harrelson,
Robert Krauthgamer,
Kunal Talwar,
Éva Tardos:
Approximate classification via earthmover metrics.
SODA 2004: 1079-1087 |
12 | EE | Kunal Talwar:
Bypassing the embedding: algorithms for low dimensional metrics.
STOC 2004: 281-290 |
11 | EE | Alex Fabrikant,
Christos H. Papadimitriou,
Kunal Talwar:
The complexity of pure Nash equilibria.
STOC 2004: 604-612 |
10 | EE | Jittat Fakcharoenphol,
Satish Rao,
Kunal Talwar:
A tight bound on approximating arbitrary metrics by tree metrics.
J. Comput. Syst. Sci. 69(3): 485-497 (2004) |
9 | EE | Jittat Fakcharoenphol,
Satish Rao,
Kunal Talwar:
Approximating metrics by tree metrics.
SIGACT News 35(2): 60-70 (2004) |
2003 |
8 | EE | Kamalika Chaudhuri,
Brighten Godfrey,
Satish Rao,
Kunal Talwar:
Paths, Trees, and Minimum Latency Tours.
FOCS 2003: 36-45 |
7 | EE | Jittat Fakcharoenphol,
Kunal Talwar:
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.
RANDOM-APPROX 2003: 36-46 |
6 | EE | Aaron Archer,
Christos H. Papadimitriou,
Kunal Talwar,
Éva Tardos:
An approximate truthful mechanism for combinatorial auctions with single parameter agents.
SODA 2003: 205-214 |
5 | EE | Jittat Fakcharoenphol,
Chris Harrelson,
Satish Rao,
Kunal Talwar:
An improved approximation algorithm for the 0-extension problem.
SODA 2003: 257-265 |
4 | EE | Kunal Talwar:
The Price of Truth: Frugality in Truthful Mechanisms.
STACS 2003: 608-619 |
3 | EE | Jittat Fakcharoenphol,
Satish Rao,
Kunal Talwar:
A tight bound on approximating arbitrary metrics by tree metrics.
STOC 2003: 448-455 |
2 | | Aaron Archer,
Christos H. Papadimitriou,
Kunal Talwar,
Éva Tardos:
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents.
Internet Mathematics 1(2): (2003) |
2002 |
1 | EE | Kunal Talwar:
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap.
IPCO 2002: 475-486 |