| Publication | Date of Publication | Type |
|---|
Improved bounds for on-line load balancing
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Information, inattention, perception, and discounting
| 2021-12-02 | Paper |
Path decomposition under a new cost measure with applications to optical network design
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Egalitarian graph orientations
Journal of Graph Algorithms and Applications | 2017-07-13 | 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 |
Improving robustness of next-hop routing
Journal of Combinatorial Optimization | 2016-04-13 | 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 |
Logarithmic hardness of the directed congestion minimization problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | 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 |
Approximation algorithms for grooming in optical network design
Theoretical Computer Science | 2011-07-14 | Paper |
Buy-at-bulk network design with protection
Mathematics of Operations Research | 2011-04-27 | Paper |
A note on generalized rank aggregation
Information Processing Letters | 2010-08-20 | 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 |
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data
Journal of the ACM | 2008-12-21 | Paper |
Exact algorithms for the master ring problem
Networks | 2008-10-08 | 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 |
The master ring problem
| 2006-08-29 | Paper |
Minimizing maximum fiber requirement in optical networks
Journal of Computer and System Sciences | 2006-01-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
The Effects of Temporary Sessions on Network Performance
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2119695 (Why is no real title available?)
| 2004-11-29 | Paper |
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
Journal of Algorithms | 2004-11-23 | Paper |
scientific article; zbMATH DE number 2079419 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 1775422 (Why is no real title available?)
| 2004-01-27 | Paper |
An improved FPTAS for Restricted Shortest Path.
Information Processing Letters | 2003-01-21 | Paper |
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
Discrete Applied Mathematics | 2002-10-29 | Paper |
Approximation algorithms for access network design
Algorithmica | 2002-09-25 | Paper |
New algorithms for disk scheduling
Algorithmica | 2002-08-14 | Paper |
Fast, fair and frugal bandwidth allocation in ATM networks
Algorithmica | 2002-06-17 | Paper |
Managing software reuse economics: An integrated ROI-based model
Annals of Software Engineering | 2002-04-15 | Paper |
General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
SIAM Journal on Computing | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1445333 (Why is no real title available?)
| 2000-05-10 | Paper |
Automatic Methods for Hiding Latency in Parallel and Distributed Computation
SIAM Journal on Computing | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1305396 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1256742 (Why is no real title available?)
| 1999-05-18 | Paper |
Efficient execution of nondeterministic parallel programs on asynchronous systems
Information and Computation | 1998-07-27 | Paper |
