| Publication | Date of Publication | Type |
|---|
Online paging with heterogeneous cache slots
Algorithmica | 2025-01-24 | Paper |
Online paging with heterogeneous cache slots
| 2024-10-08 | Paper |
Approximating latin square extensions
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Service-constrained network design problems
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Retracting Graphs to Cycles
| 2022-07-21 | Paper |
Symmetric interdiction for matching problems
| 2021-07-28 | Paper |
Realization problems on reachability sequences
Lecture Notes in Computer Science | 2021-04-21 | Paper |
Realization problems on reachability sequences
Theoretical Computer Science | 2021-04-14 | 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
| 2020-02-12 | Paper |
Small-Support Uncertainty Principles on $\mathbb{Z}/p$ over Finite Fields
| 2019-06-12 | Paper |
Bicriteria network design problems
Lecture Notes in Computer Science | 2019-01-10 | Paper |
Markovian hitters and the complexity of blind rendezvous
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improving spanning trees by upgrading nodes
Automata, Languages and Programming | 2018-07-04 | Paper |
Designing Overlapping Networks for Publish-Subscribe Systems
| 2017-08-31 | Paper |
Rumors across radio, wireless, telephone
| 2017-07-13 | Paper |
Balls and funnels: energy efficient group-to-group anycasts
Lecture Notes in Computer Science | 2016-09-02 | Paper |
A note on optical routing on trees
Information Processing Letters | 2016-05-26 | 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 |
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 |
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | 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 |
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM | 2008-12-21 | Paper |
On Completing Latin Squares
STACS 2007 | 2007-09-03 | Paper |
Meet and merge: approximation algorithms for confluent flows
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Alternation in interaction
Computational Complexity | 2002-06-02 | Paper |
On embedding complete graphs into hypercubes
Discrete Mathematics | 2000-11-02 | Paper |
Improving Minimum Cost Spanning Trees by Upgrading Nodes
Journal of Algorithms | 2000-02-06 | Paper |
Symmetric alternation captures BPP
Computational Complexity | 1999-01-03 | Paper |
scientific article; zbMATH DE number 1163719 (Why is no real title available?)
| 1998-06-11 | Paper |
A note on the asymptotic and computational complexity of graph distinguishability
The Electronic Journal of Combinatorics | 1998-04-29 | Paper |
scientific article; zbMATH DE number 1002205 (Why is no real title available?)
| 1997-11-12 | Paper |
scientific article; zbMATH DE number 1003287 (Why is no real title available?)
| 1997-08-04 | Paper |
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
Information Processing Letters | 1997-02-28 | Paper |
Spanning Trees—Short or Small
SIAM Journal on Discrete Mathematics | 1996-07-24 | Paper |
Treewidth of Circular-Arc Graphs
SIAM Journal on Discrete Mathematics | 1994-12-20 | Paper |
Bicriteria network design problems
Journal of Algorithms | 0001-01-03 | Paper |
