| Publication | Date of Publication | Type |
|---|
| Online paging with heterogeneous cache slots | 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 |
| https://portal.mardi4nfdi.de/entity/Q6147391 | 2024-01-15 | Paper |
| Improved algorithms for scheduling unsplittable flows on paths | 2023-02-16 | Paper |
| Retracting Graphs to Cycles | 2022-07-21 | Paper |
| \textsf{HaPPY-Mine}: designing a mining reward function | 2022-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002612 | 2021-07-28 | Paper |
| An efficient distributed algorithm for constructing small dominating sets | 2020-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136269 | 2020-11-25 | Paper |
| Cache me if you can: capacitated selfish replication games in networks | 2020-02-27 | Paper |
| Plane gossip: approximating rumor spread in planar graphs | 2020-02-12 | Paper |
| On the Complexity of Information Spreading in Dynamic Networks | 2019-05-15 | Paper |
| Information spreading in dynamic networks under oblivious adversaries | 2018-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365096 | 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 | 2016-09-29 | Paper |
| Essentially Optimal Robust Secret Sharing with Maximal Corruptions | 2016-09-09 | Paper |
| Balls and Funnels: Energy Efficient Group-to-Group Anycasts | 2016-09-02 | Paper |
| On contention resolution protocols and associated probabilistic phenomena | 2016-09-01 | Paper |
| Discovery through gossip | 2016-06-10 | Paper |
| Coupled and \(k\)-sided placements: generalizing generalized assignment | 2015-12-09 | Paper |
| Bounded budget connection (BBC) games or how to make friends and influence people, on a budget | 2014-12-12 | Paper |
| Reducibility among Fractional Stability Problems | 2014-07-25 | Paper |
| Bounded budget connection (BBC) games or how to make friends and influence people, on a budget | 2014-06-10 | Paper |
| Coupled and k-Sided Placements: Generalizing Generalized Assignment | 2014-06-02 | Paper |
| Reducibility among Fractional Stability Problems | 2014-04-11 | Paper |
| Cache Me If You Can: Capacitated Selfish Replication Games | 2012-06-29 | Paper |
| A General Approach for Incremental Approximation and Hierarchical Clustering | 2011-04-04 | Paper |
| Approximation algorithms for multiprocessor scheduling under uncertainty | 2010-12-17 | Paper |
| Meet and merge | 2010-08-16 | Paper |
| (Almost) tight bounds and existence theorems for confluent flows | 2010-08-15 | Paper |
| Approximation Algorithms for Data Placement Problems | 2009-08-20 | Paper |
| Approximation Algorithms for Key Management in Secure Multicast | 2009-07-23 | Paper |
| (Almost) Tight bounds and existence theorems for single-commodity confluent flows | 2008-12-21 | Paper |
| Compact Routing with Name Independence | 2007-09-06 | Paper |
| Meet and merge: approximation algorithms for confluent flows | 2006-06-30 | Paper |
| Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems | 2004-08-19 | Paper |
| Time-constrained scheduling of weighted packets on trees and meshes | 2003-08-17 | Paper |
| Towards more complete models of TCP latency and throughput | 2002-04-11 | Paper |
| Approximation algorithms for data placement in arbitrary networks | 2002-01-30 | Paper |
| Placement algorithms for hierarchical cooperative caching | 2001-04-17 | Paper |
| Accessing nearby copies of replicated objects in a distributed environment | 2000-01-25 | Paper |
| Analysis of a Local Search Heuristic for Facility Location Problems | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250157 | 1999-10-18 | Paper |
| Rapid convergence of a local load balancing algorithm for asynchronous rings | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252337 | 1999-06-17 | Paper |
