| Publication | Date of Publication | Type |
|---|
| Online weighted matching with a sample | 2024-07-19 | Paper |
| Almost tight bounds for online facility location in the random-order model | 2024-05-14 | Paper |
General Knapsack Problems in a Dynamic Setting
(available as arXiv preprint) | 2023-11-20 | Paper |
| A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650243 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7561426 (Why is no real title available?) | 2022-07-21 | Paper |
An almost optimal approximation algorithm for monotone submodular multiple knapsack
Journal of Computer and System Sciences | 2022-01-31 | Paper |
Competitive Analysis with a Sample and the Secretary Problem
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Algorithms for dynamic NFV workload | 2019-01-15 | Paper |
Upward max-min fairness
Journal of the ACM | 2018-08-02 | Paper |
On slender context-free languages
STACS 95 | 2017-12-04 | Paper |
Exact Worst Case TCAM Rule Expansion
IEEE Transactions on Computers | 2017-07-12 | Paper |
Approximating min-sum k -clustering in metric spaces
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Time-dependent multi-scheduling of multicast
ACM Transactions on Algorithms | 2014-11-18 | Paper |
An efficient approximation for the generalized assignment problem
Information Processing Letters | 2010-01-29 | Paper |
Coping with Interference: From Maximum Coverage to Planning Cellular Networks
Approximation and Online Algorithms | 2008-02-21 | Paper |
Approximating total flow time on parallel machines
Journal of Computer and System Sciences | 2007-08-23 | Paper |
Building edge-failure resilient networks
Algorithmica | 2006-03-21 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2086939 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2013205 (Why is no real title available?) | 2003-12-04 | Paper |
| scientific article; zbMATH DE number 1559527 (Why is no real title available?) | 2001-02-28 | Paper |
Length considerations in context-free languages
Theoretical Computer Science | 1998-07-22 | Paper |
Deciding emptiness for stack automata on infinite trees
Information and Computation | 1994-09-13 | Paper |
Deciding Properties of Nonregular Programs
SIAM Journal on Computing | 1993-10-10 | Paper |
