| Publication | Date of Publication | Type |
|---|
The loss of serving in the dark
Information Processing Letters | 2023-01-30 | Paper |
A polynomial-time approximation scheme for the airplane refueling problem
Journal of Scheduling | 2019-10-08 | Paper |
Approximation algorithms for sequential batch-testing of series systems
Naval Research Logistics | 2019-05-02 | Paper |
| scientific article; zbMATH DE number 6783452 (Why is no real title available?) | 2017-09-29 | Paper |
scientific article; zbMATH DE number 6783452 (Why is no real title available?)
(available as arXiv preprint) | 2017-09-29 | Paper |
A sublogarithmic approximation for tollbooth pricing on trees
Mathematics of Operations Research | 2017-06-02 | Paper |
| Generalized Reordering Buffer Management | 2017-03-03 | Paper |
Improved approximation for orienting mixed graphs
Algorithmica | 2016-03-23 | Paper |
Multiple intents re-ranking
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
The asymmetric matrix partition problem
Web and Internet Economics | 2015-01-12 | Paper |
Improved online algorithms for the sorting buffer problem on line metrics
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Truthful unsplittable flow for large capacity networks
ACM Transactions on Algorithms | 2014-11-18 | Paper |
The loss of serving in the dark
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Mobile facility location: combinatorial filtering via weighted occupancy
Journal of Combinatorial Optimization | 2014-07-11 | Paper |
Efficient Submodular Function Maximization under Linear Packing Constraints
Automata, Languages, and Programming | 2013-08-12 | Paper |
Buffer management for colored packets with deadlines
Theory of Computing Systems | 2012-12-10 | Paper |
Improved approximation for orienting mixed graphs
Structural Information and Communication Complexity | 2012-09-26 | Paper |
On the approximability of reachability-preserving network orientations
Internet Mathematics | 2012-08-29 | Paper |
A polylogarithmic approximation for computing non-metric terminal Steiner trees
Information Processing Letters | 2012-03-27 | Paper |
Submodular Max-SAT
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Improved lower bounds for non-utilitarian truthfulness
Theoretical Computer Science | 2011-02-21 | Paper |
Improved Orientations of Physical Networks
Lecture Notes in Computer Science | 2010-10-05 | Paper |
A sublogarithmic approximation for highway and tollbooth pricing
Automata, Languages and Programming | 2010-09-07 | Paper |
Truthful Mechanisms via Greedy Iterative Packing
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Truthful Unification Framework for Packing Integer Programs with Choices
Automata, Languages and Programming | 2008-08-28 | Paper |
Improved Lower Bounds for Non-utilitarian Truthfulness
Approximation and Online Algorithms | 2008-02-20 | Paper |
Improved Online Algorithms for the Sorting Buffer Problem
STACS 2007 | 2007-09-03 | Paper |
