| Publication | Date of Publication | Type |
|---|
Facility location with dynamic distance functions
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Correlation clustering in data streams
Algorithmica | 2021-06-30 | Paper |
Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| scientific article; zbMATH DE number 7053292 (Why is no real title available?) | 2019-05-10 | Paper |
| Approximation algorithms for restless bandit problems | 2019-05-06 | Paper |
Throughput maximization of real-time scheduling with batching
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Approximation algorithms for connected dominating sets
Algorithms — ESA '96 | 2017-12-05 | Paper |
A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Efficient recovery from power outage (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Approximating the throughput of multiple machines under real-time scheduling
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
| Behavioral Intervention and Non-Uniform Bootstrap Percolation | 2015-12-02 | Paper |
A constant factor approximation for the single sink edge installation problems
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Data-streams and histograms
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
| Model-driven optimization using adaptive probes | 2014-12-18 | Paper |
Sublinear estimation of entropy and information distances
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Improved approximations of crossings in graph drawings
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
How to probe for an extreme value
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Adaptive uncertainty resolution in Bayesian combinatorial optimization problems
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Spectral sparsification in dynamic graph streams
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Approximate indexability and bandit problems with concave rewards and delayed feedback
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Linear programming in the semi-streaming model with application to the maximum matching problem
Information and Computation | 2013-06-06 | Paper |
Linear programming in the semi-streaming model with application to the maximum matching problem
Automata, Languages and Programming | 2011-07-07 | Paper |
Approximation algorithms for restless bandit problems
Journal of the ACM | 2011-05-16 | Paper |
Streaming and sublinear approximation of entropy and information distances
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Approximation algorithms for wavelet transform coding of data streams
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
CONCUR 2003 - Concurrency Theory
Lecture Notes in Computer Science | 2010-03-30 | Paper |
A constant factor approximation for the single sink edge installation problem
SIAM Journal on Computing | 2010-01-06 | Paper |
Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams
SIAM Journal on Computing | 2009-11-06 | Paper |
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Automata, Languages and Programming | 2009-07-14 | Paper |
Multi-armed Bandits with Metric Switching Costs
Automata, Languages and Programming | 2009-07-14 | Paper |
Graph Sparsification in the Semi-streaming Model
Automata, Languages and Programming | 2009-07-14 | Paper |
Sketching information divergences
Machine Learning | 2009-03-31 | Paper |
Approximation Algorithms for Wavelet Transform Coding of Data Streams
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
| Approximation algorithms for budgeted learning problems | 2009-01-05 | Paper |
Asymmetric k -center is log * n -hard to approximate
Journal of the ACM | 2008-12-21 | Paper |
Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination
Automata, Languages and Programming | 2008-08-28 | Paper |
Sketching Information Divergences
Learning Theory | 2008-01-03 | Paper |
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
Automata, Languages and Programming | 2007-11-28 | Paper |
The Steiner k-Cut Problem
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Improved Combinatorial Algorithms for Facility Location Problems
SIAM Journal on Computing | 2005-09-16 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
| scientific article; zbMATH DE number 2119650 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119748 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119735 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119701 (Why is no real title available?) | 2004-11-29 | Paper |
Capacitated vertex covering
Journal of Algorithms | 2004-03-14 | Paper |
A constant factor approximation algorithm for the fault-tolerant facility location problem
Journal of Algorithms | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2038710 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1775395 (Why is no real title available?) | 2004-01-27 | Paper |
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
SIAM Journal on Computing | 2003-06-19 | Paper |
A constant-factor approximation algorithm for the \(k\)-median problem
Journal of Computer and System Sciences | 2003-05-04 | Paper |
Cure: An efficient clustering algorithm for large databases
Information Systems | 2003-02-20 | Paper |
Improved methods for approximating node weighted Steiner trees and connected dominating sets.
Information and Computation | 2003-01-14 | Paper |
Approximating the throughput of multiple machines in real-time scheduling
SIAM Journal on Computing | 2002-04-23 | Paper |
| Improved algorithms for fault tolerant facility location | 2002-01-30 | Paper |
Message Multicasting in Heterogeneous Networks
SIAM Journal on Computing | 2000-10-18 | Paper |
Approximation Algorithms for Directed Steiner Problems
Journal of Algorithms | 2000-05-28 | Paper |
| scientific article; zbMATH DE number 1303608 (Why is no real title available?) | 2000-05-25 | Paper |
Greedy Strikes Back: Improved Facility Location Algorithms
Journal of Algorithms | 2000-01-09 | Paper |
| scientific article; zbMATH DE number 1302025 (Why is no real title available?) | 1999-09-26 | Paper |
| scientific article; zbMATH DE number 1303557 (Why is no real title available?) | 1999-06-17 | Paper |
Facility location with dynamic distance functions
Journal of Combinatorial Optimization | 1999-03-28 | Paper |
| scientific article; zbMATH DE number 1163715 (Why is no real title available?) | 1998-10-01 | Paper |
Approximation algorithms for connected dominating sets
Algorithmica | 1998-09-08 | Paper |
| scientific article; zbMATH DE number 1775430 (Why is no real title available?) | 1998-01-01 | Paper |
