| Publication | Date of Publication | Type |
|---|
| On complexity of 1-center in various metrics | 2025-01-14 | Paper |
| Optimal fully dynamic \(k\)-center clustering for adaptive and oblivious adversaries | 2024-05-14 | Paper |
Fair resource allocation in a volatile marketplace
Operations Research | 2022-02-18 | Paper |
| Brief announcement: MapReduce algorithms for massive trees | 2021-07-28 | Paper |
| Streaming Belief Propagation for Community Detection | 2021-06-09 | Paper |
Distributed balanced partitioning via linear embedding
Algorithms | 2020-10-08 | Paper |
Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Polynomial-time approximation scheme for minimum \(k\)-cut in planar and minor-free graphs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Fast algorithms for knapsack via convolution and prediction
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| A polynomial-time approximation scheme for planar multiway cut | 2019-05-10 | Paper |
| Assignment problem in content distribution networks: unsplittable hard-capacitated facility location | 2019-05-06 | Paper |
Improved approximation algorithms for (budgeted) node-weighted Steiner problems
SIAM Journal on Computing | 2018-07-06 | Paper |
| scientific article; zbMATH DE number 6783450 (Why is no real title available?) | 2017-09-29 | Paper |
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
An analytical approach for thermal stability analysis of two-layer Timoshenko beams
International Journal of Structural Stability and Dynamics | 2017-04-07 | Paper |
Revenue maximization for selling multiple correlated items
Algorithms - ESA 2015 | 2015-11-19 | Paper |
MaxMin allocation via degree lower-bounded arborescences
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Revenue maximization with nonexcludable goods
Web and Internet Economics | 2015-01-12 | Paper |
Network Cournot competition
Web and Internet Economics | 2015-01-07 | Paper |
Concise bid optimization strategies with multiple budget constraints
Web and Internet Economics | 2015-01-07 | Paper |
Submodular secretary problem and extensions
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Assignment problem in content distribution networks, unsplittable hard-capacitated facility location
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM | 2014-02-17 | Paper |
Improved approximation algorithms for (budgeted) node-weighted Steiner problems
Automata, Languages, and Programming | 2013-08-06 | Paper |
Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
Algorithmica | 2013-08-05 | Paper |
Scheduling to minimize staleness and stretch in real-time data warehouses
Theory of Computing Systems | 2012-12-10 | Paper |
Euclidean prize-collecting Steiner forest
Algorithmica | 2012-04-26 | Paper |
Improved approximation algorithms for prize-collecting Steiner tree and TSP
SIAM Journal on Computing | 2011-07-29 | Paper |
Submodular secretary problem and extensions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Approximation algorithms for the directed \(k\)-tour and \(k\)-stroll problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
The cooperative game theory foundations of network bargaining games
Automata, Languages and Programming | 2010-09-07 | Paper |
Euclidean Prize-Collecting Steiner Forest
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
A note on the subadditive network design problem
Operations Research Letters | 2009-11-17 | Paper |
| Plane embeddings of planar graph metrics | 2009-02-10 | Paper |
Plane embeddings of planar graph metrics
Discrete & Computational Geometry | 2008-01-04 | Paper |
