| Publication | Date of Publication | Type |
|---|
| An \(\alpha \)-regret analysis of adversarial bilateral trade | 2025-01-17 | Paper |
| Multi layer peeling for linear arrangement and hierarchical clustering | 2024-11-14 | Paper |
| Distortion-oblivious algorithms for scheduling on multiple machines | 2024-09-11 | Paper |
| Online graph algorithms with predictions | 2024-07-19 | Paper |
| Distortion-oblivious algorithms for minimizing flow time | 2024-07-19 | Paper |
| Competitive vertex recoloring | 2024-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147268 | 2024-01-15 | Paper |
| Flow time scheduling with uncertain processing time | 2023-11-14 | Paper |
| Competitive vertex recoloring. (Online disengagement) | 2023-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874472 | 2023-02-07 | Paper |
| The loss of serving in the dark | 2023-01-30 | Paper |
| Online load balancing of temporary tasks | 2023-01-18 | Paper |
| On two dimensional packing | 2022-12-09 | Paper |
| Online Service with Delay | 2022-02-16 | Paper |
| On-line machine covering | 2021-12-20 | Paper |
| Min-Cost Bipartite Perfect Matching with Delays | 2021-07-28 | Paper |
| Deterministic min-cost matching with delays | 2020-06-02 | Paper |
| An improved algorithm for online machine minimization | 2019-06-11 | Paper |
| Online Mixed Packing and Covering | 2019-05-15 | Paper |
| The Strategy of Experts for Repeated Predictions | 2019-01-30 | Paper |
| Deterministic min-cost matching with delays | 2019-01-15 | Paper |
| 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines | 2018-10-19 | Paper |
| Make-to-Order Integrated Scheduling and Distribution | 2018-07-16 | Paper |
| Packing Small Vectors | 2018-07-16 | Paper |
| Online Lower Bounds via Duality | 2018-07-16 | Paper |
| Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607946 | 2018-03-15 | Paper |
| Liquid price of anarchy | 2018-02-13 | Paper |
| On-line competitive algorithms for call admission in optical networks | 2017-12-05 | Paper |
| Scheduling with deadlines and buffer management with processing requirements | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365100 | 2017-09-29 | Paper |
| Online service with delay | 2017-08-17 | Paper |
| Sequential decision making with vector outcomes | 2017-05-19 | Paper |
| Truthful mechanism design via correlated tree rounding | 2017-05-15 | Paper |
| Dynamic Traveling Repair Problem with an Arbitrary Time Window | 2017-04-04 | Paper |
| Generalized Reordering Buffer Management | 2017-03-03 | Paper |
| Minimizing the flow time without migration | 2016-09-29 | Paper |
| Balanced allocations (extended abstract) | 2016-09-01 | Paper |
| Buffer Management for Packets with Processing Times | 2015-11-19 | Paper |
| Serving in the Dark should be done Non-Uniformly | 2015-10-27 | Paper |
| Distributed error confinement | 2015-09-04 | Paper |
| An improved algorithm for CIOQ switches | 2015-09-02 | Paper |
| A general approach to online network optimization problems | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501827 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501312 | 2015-08-03 | Paper |
| On-line load balancing with applications to machine scheduling and virtual circuit routing | 2015-05-07 | Paper |
| Spectral analysis of data | 2015-02-27 | Paper |
| Multiple intents re-ranking | 2015-02-04 | Paper |
| Distributed error confinement | 2014-11-18 | Paper |
| Admission control to minimize rejections and online set cover with repetitions | 2014-11-18 | Paper |
| Truthful unsplittable flow for large capacity networks | 2014-11-18 | Paper |
| The loss of serving in the dark | 2014-08-07 | Paper |
| Tight bounds for online vector bin packing | 2014-08-07 | Paper |
| Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks | 2014-07-25 | Paper |
| Efficient Submodular Function Maximization under Linear Packing Constraints | 2013-08-12 | Paper |
| The Price of Routing Unsplittable Flow | 2013-07-04 | Paper |
| Buffer management for colored packets with deadlines | 2012-12-10 | Paper |
| Prompt Mechanism for Ad Placement over Time | 2011-10-28 | Paper |
| Submodular Max-SAT | 2011-09-16 | Paper |
| Optimal Discovery Strategies in White Space Networks | 2011-09-16 | Paper |
| Maximum bipartite flow in networks with adaptive channel width | 2011-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002759 | 2011-05-24 | Paper |
| Management of multi-queue switches in QoS networks | 2010-08-16 | Paper |
| Optimal oblivious routing in polynomial time | 2010-08-16 | Paper |
| The Price of Routing Unsplittable Flow | 2010-08-16 | Paper |
| The online set cover problem | 2010-08-16 | Paper |
| Reducing truth-telling online mechanisms to online optimization | 2010-08-16 | Paper |
| Convex programming for scheduling unrelated parallel machines | 2010-08-16 | Paper |
| The zero-one principle for switching networks | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579479 | 2010-08-06 | Paper |
| A preemptive algorithm for maximizing disjoint paths on trees | 2010-05-19 | Paper |
| The Online Set Cover Problem | 2010-04-29 | Paper |
| On Revenue Maximization in Second-Price Ad Auctions | 2009-10-29 | Paper |
| Tell me who I am: An interactive recommendation system | 2009-10-19 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Maximum Bipartite Flow in Networks with Adaptive Channel Width | 2009-07-14 | Paper |
| Improved Approximation Algorithms for Budgeted Allocations | 2008-08-28 | Paper |
| Truthful Unification Framework for Packing Integer Programs with Choices | 2008-08-28 | Paper |
| A Preemptive Algorithm for Maximizing Disjoint Paths on Trees | 2008-07-15 | Paper |
| Optimal Node Routing | 2008-03-19 | Paper |
| Collaborate with strangers to find own preferences | 2008-02-18 | Paper |
| Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms | 2007-12-20 | Paper |
| Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers | 2007-09-07 | Paper |
| Truthful approximation mechanisms for scheduling selfish related machines | 2007-08-23 | Paper |
| Maximizing throughput in multi-queue switches | 2007-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3443151 | 2007-05-31 | Paper |
| Minimizing total flow time and total completion time with immediate dispatching | 2007-04-26 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| An improved algorithm for online coloring of intervals with bandwidth | 2007-01-09 | Paper |
| Tradeoffs in worst-case equilibria | 2006-09-14 | Paper |
| Load balancing of temporary tasks in the \(\ell _{p}\) norm | 2006-09-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Combinatorial algorithms for the unsplittable flow problem | 2006-06-14 | Paper |
| Management of multi-queue switches in QoS networks | 2006-03-21 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| On-Line Load Balancing of Temporary Tasks on Identical Machines | 2005-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828923 | 2004-11-29 | Paper |
| On-line generalized Steiner problem | 2004-11-23 | Paper |
| Optimal oblivious routing in polynomial time | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818855 | 2004-09-24 | Paper |
| All-norm approximation algorithms | 2004-09-08 | Paper |
| All-Norm Approximation Algorithms | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473327 | 2004-08-04 | Paper |
| Temporary tasks assignment resolved | 2003-08-17 | Paper |
| Resource augmentation in load balancing. | 2003-07-27 | Paper |
| On-line restricted assignment of temporary tasks with unknown durations. | 2003-01-21 | Paper |
| Off-line temporary tasks assignment. | 2003-01-21 | Paper |
| Minimizing the Flow Time Without Migration | 2002-09-29 | Paper |
| Fair versus unrestricted bin packing | 2002-09-25 | Paper |
| On-line scheduling with precedence constraints | 2002-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537731 | 2002-06-20 | Paper |
| Maximizing job benefits on-line | 2002-05-14 | Paper |
| Competitive routing of virtual circuits with unknown duration | 2002-04-28 | Paper |
| On-line bin-stretching | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230343 | 2002-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753725 | 2001-11-11 | Paper |
| Ancient and new algorithms for load balancing in the \(\ell_p\) norm | 2001-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721976 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721978 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721979 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252265 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941824 | 2000-03-19 | Paper |
| On capital investment. | 2000-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250210 | 1999-12-07 | Paper |
| Balanced Allocations | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228507 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234074 | 1999-09-15 | Paper |
| Approximating probability distributions using small sample spaces | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400843 | 1999-05-05 | Paper |
| On-line machine covering | 1998-11-01 | Paper |
| Approximation schemes for scheduling on parallel machines | 1998-11-01 | Paper |
| On-line and off-line approximation algorithms for vector covering problems | 1998-10-01 | Paper |
| New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen | 1998-09-21 | Paper |
| On-line routing of virtual circuits with applications to load balancing and machine scheduling | 1998-02-17 | Paper |
| On Two Dimensional Packing | 1997-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128891 | 1997-04-23 | Paper |
| On-Line Load Balancing of Temporary Tasks | 1997-03-18 | Paper |
| Biased random walks | 1996-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875170 | 1996-04-28 | Paper |
| Routing strategies for fast networks | 1996-01-01 | Paper |
| Lower Bounds for Insertion Methods for TSP | 1995-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763408 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763426 | 1995-04-11 | Paper |
| On-line load balancing | 1995-04-04 | Paper |
| The Competitiveness of On-Line Assignments | 1995-01-01 | Paper |
| On the problem of approximating the number of bases of a matroid | 1994-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140447 | 1993-12-15 | Paper |
| On-line Steiner trees in the Euclidean plane | 1993-09-30 | Paper |
| Lower Bounds for Threshold and Symmetric Functions in Parallel Computation | 1992-06-28 | Paper |
| Parallel comparison merging of many-ordered lists | 1991-01-01 | Paper |
| Parallel comparison algorithms for approximation problems | 1991-01-01 | Paper |
| Parallel selection | 1990-01-01 | Paper |
| Universal sequences for complete graphs | 1990-01-01 | Paper |
| Finding an Approximate Maximum | 1989-01-01 | Paper |
| Sorting, Approximate Sorting, and Searching in Rounds | 1988-01-01 | Paper |
| The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms | 1988-01-01 | Paper |
| Tight Comparison Bounds on the Complexity of Parallel Sorting | 1987-01-01 | Paper |
