| Publication | Date of Publication | Type |
|---|
Online paging with heterogeneous cache slots
Algorithmica | 2025-01-24 | Paper |
| Scheduling under non-uniform job and machine delays | 2024-11-14 | Paper |
| Online paging with heterogeneous cache slots | 2024-10-08 | Paper |
Competitive data-structure dynamization
(available as arXiv preprint) | 2024-01-15 | Paper |
Improved algorithms for scheduling unsplittable flows on paths
Algorithmica | 2023-02-16 | Paper |
Retracting Graphs to Cycles
(available as arXiv preprint) | 2022-07-21 | Paper |
\textsf{HaPPY-Mine}: designing a mining reward function
(available as arXiv preprint) | 2022-06-22 | Paper |
| Symmetric interdiction for matching problems | 2021-07-28 | Paper |
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing | 2020-12-03 | Paper |
scientific article; zbMATH DE number 7278054 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-25 | Paper |
Cache me if you can: capacitated selfish replication games in networks
Theory of Computing Systems | 2020-02-27 | Paper |
Plane gossip: approximating rumor spread in planar graphs
(available as arXiv preprint) | 2020-02-12 | Paper |
On the complexity of information spreading in dynamic networks
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Information spreading in dynamic networks under oblivious adversaries
(available as arXiv preprint) | 2018-08-16 | Paper |
| Multicommodity facility location under group Steiner access cost | 2017-09-29 | Paper |
| Designing Overlapping Networks for Publish-Subscribe Systems | 2017-08-31 | Paper |
| Rumors across radio, wireless, telephone | 2017-07-13 | Paper |
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Essentially Optimal Robust Secret Sharing with Maximal Corruptions
Advances in Cryptology – EUROCRYPT 2016 | 2016-09-09 | Paper |
Balls and funnels: energy efficient group-to-group anycasts
Lecture Notes in Computer Science | 2016-09-02 | Paper |
On contention resolution protocols and associated probabilistic phenomena
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Discovery through gossip
Random Structures & Algorithms | 2016-06-10 | Paper |
Coupled and \(k\)-sided placements: generalizing generalized assignment
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Reducibility among Fractional Stability Problems
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Coupled and k-Sided Placements: Generalizing Generalized Assignment
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Reducibility among fractional stability problems
SIAM Journal on Computing | 2014-04-11 | Paper |
Cache me if you can: capacitated selfish replication games
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
A general approach for incremental approximation and hierarchical clustering
SIAM Journal on Computing | 2011-04-04 | Paper |
Approximation algorithms for multiprocessor scheduling under uncertainty
Theory of Computing Systems | 2010-12-17 | Paper |
Meet and merge: approximation algorithms for confluent flows
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
(Almost) tight bounds and existence theorems for confluent flows
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Approximation Algorithms for Data Placement Problems
SIAM Journal on Computing | 2009-08-20 | Paper |
Approximation Algorithms for Key Management in Secure Multicast
Lecture Notes in Computer Science | 2009-07-23 | Paper |
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM | 2008-12-21 | Paper |
Compact Routing with Name Independence
SIAM Journal on Discrete Mathematics | 2007-09-06 | Paper |
Meet and merge: approximation algorithms for confluent flows
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Journal of Computer and System Sciences | 2004-08-19 | Paper |
Time-constrained scheduling of weighted packets on trees and meshes
Algorithmica | 2003-08-17 | Paper |
Towards more complete models of TCP latency and throughput
The Journal of Supercomputing | 2002-04-11 | Paper |
| Approximation algorithms for data placement in arbitrary networks | 2002-01-30 | Paper |
Placement algorithms for hierarchical cooperative caching
Journal of Algorithms | 2001-04-17 | Paper |
Accessing nearby copies of replicated objects in a distributed environment
Theory of Computing Systems | 2000-01-25 | Paper |
Analysis of a Local Search Heuristic for Facility Location Problems
Journal of Algorithms | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1303535 (Why is no real title available?) | 1999-10-18 | Paper |
Rapid convergence of a local load balancing algorithm for asynchronous rings
Theoretical Computer Science | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1305451 (Why is no real title available?) | 1999-06-17 | Paper |
