| Publication | Date of Publication | Type |
|---|
| General dynamic routing with per-packet delay guarantees of \(O (\mathrm{distance} + 1 / \mathrm{session\ rate})\) | 2026-05-21 | Paper |
| Source routing and scheduling in packet networks | 2026-05-08 | Paper |
| Minimum-cost network design with (dis)economies of scale | 2025-04-29 | Paper |
| Approximation algorithms for the edge-disjoint paths problem via Raecke decompositions | 2025-04-29 | Paper |
Improved bounds for on-line load balancing Lecture Notes in Computer Science | 2024-01-29 | Paper |
A simple molecular mathematical model of mammalian hibernation Journal of Theoretical Biology | 2021-01-21 | Paper |
| Capacitated metric labeling | 2017-09-29 | Paper |
Packet routing with arbitrary end-to-end delay requirements Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Minimum-cost network design with (dis)economies of scale SIAM Journal on Computing | 2016-01-20 | Paper |
Logarithmic hardness of the undirected edge-disjoint paths problem Journal of the ACM | 2015-12-04 | Paper |
Almost-tight hardness of directed congestion minimization Journal of the ACM | 2015-11-11 | Paper |
| Routing and scheduling in multihop wireless networks with time-varying channels | 2015-08-03 | Paper |
| scientific article; zbMATH DE number 6381648 (Why is no real title available?) | 2014-12-18 | Paper |
Logarithmic hardness of the directed congestion minimization problem Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Instability of FIFO in the permanent sessions model at arbitrarily small network loads ACM Transactions on Algorithms | 2014-11-18 | Paper |
Rate-adaptive weighted fair queueing for energy-aware scheduling Information Processing Letters | 2014-04-15 | Paper |
Routing and scheduling for energy and delay minimization in the powerdown model Networks | 2013-08-06 | Paper |
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs Combinatorica | 2011-12-19 | Paper |
Hardness of the undirected edge-disjoint paths problem Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Hardness of the undirected congestion minimization problem Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Routing and scheduling in multihop wireless networks with time-varying channels ACM Transactions on Algorithms | 2010-08-14 | Paper |
| scientific article; zbMATH DE number 5485447 (Why is no real title available?) | 2009-01-05 | Paper |
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data Journal of the ACM | 2008-12-21 | Paper |
Hardness of the Undirected Congestion Minimization Problem SIAM Journal on Computing | 2008-03-28 | Paper |
Scheduling protocols for switches with large envelopes Journal of Scheduling | 2007-12-20 | Paper |
| A survey of scheduling theory in wireless data networks | 2007-11-05 | Paper |