| Publication | Date of Publication | Type |
|---|
| Breaking the barrier of 2 for the competitiveness of longest queue drop | 2026-05-12 | Paper |
| Polylogarithmic guarantees for generalized reordering buffer management | 2025-08-12 | Paper |
| Approximation guarantees for shortest superstrings: simpler and better | 2025-07-24 | Paper |
Breaking the barrier of 2 for the competitiveness of longest queue drop
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
The Reachability Problem for Two-Dimensional Vector Addition Systems with States
Journal of the ACM | 2022-12-08 | Paper |
Almost Tight Bounds for Reordering Buffer Management
SIAM Journal on Computing | 2022-06-08 | Paper |
Online makespan scheduling with job migration on uniform machines
Algorithmica | 2022-01-18 | Paper |
| Online Makespan Scheduling with Job Migration on Uniform Machines | 2021-08-04 | Paper |
A lower bound for the coverability problem in acyclic pushdown VAS
Information Processing Letters | 2021-03-11 | Paper |
| An \(O(\log k)\)-competitive algorithm for generalized caching | 2019-05-10 | Paper |
An \(O(\log k)\)-competitive algorithm for generalized caching
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Smoothed analysis of the 2-Opt algorithm for the general TSP
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Online packet scheduling for CIOQ and buffered crossbar switches
Algorithmica | 2018-10-18 | Paper |
Reordering buffers with logarithmic diameter dependency for trees
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Reachability in two-dimensional unary vector addition systems with states is NL-complete
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Comparison-based buffer management in QoS switches
Algorithmica | 2018-04-11 | Paper |
Catch them if you can
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
| Generalized Reordering Buffer Management | 2017-03-03 | Paper |
Comparison-based FIFO buffer management in QoS switches
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Economical caching
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
| Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (extended abstract) | 2014-12-18 | Paper |
| Considering suppressed packets improves buffer management in QoS switches | 2014-12-18 | Paper |
Vertex sparsifiers: new results from old techniques
SIAM Journal on Computing | 2014-11-14 | Paper |
The Power of Reordering for Online Minimum Makespan Scheduling
SIAM Journal on Computing | 2014-09-18 | Paper |
Oblivious Routing for the Lp-norm
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Almost tight bounds for reordering buffer management
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Optimal online buffer scheduling for block devices
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Evaluation of online strategies for reordering buffers
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
New bounds for online packing LPs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
Algorithmica | 2014-03-25 | Paper |
Considering suppressed packets improves buffer management in quality of service switches
SIAM Journal on Computing | 2013-02-04 | Paper |
Multiple-choice balanced allocation in (almost) parallel
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
| Economical caching | 2012-04-24 | Paper |
scientific article; zbMATH DE number 5899288 (Why is no real title available?)
Theory of Computing | 2011-05-24 | Paper |
Vertex Sparsifiers: New Results from Old Techniques
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Sensitivity of Wardrop equilibria
Theory of Computing Systems | 2010-08-13 | Paper |
Economical Caching with Stochastic Prices
Stochastic Algorithms: Foundations and Applications | 2009-11-19 | Paper |
Lower and upper bounds on FIFO buffer management in QoS switches
Algorithmica | 2009-05-06 | Paper |
| scientific article; zbMATH DE number 5485491 (Why is no real title available?) | 2009-01-05 | Paper |
Sensitivity of Wardrop Equilibria
Algorithmic Game Theory | 2008-05-02 | Paper |
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Evaluation of Online Strategies for Reordering Buffers
Experimental Algorithms | 2007-09-14 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
