 | 2012 |
| 24 |  | Anna Adamaszek,
Artur Czumaj,
Matthias Englert,
Harald Räcke:
An O(log k)-competitive algorithm for generalized caching.
SODA 2012: 1681-1689 |
| 23 |  | Anna Adamaszek,
Artur Czumaj,
Matthias Englert,
Harald Räcke:
Optimal online buffer scheduling for block devices.
STOC 2012: 589-598 |
| 2011 |
| 22 |  | Anna Adamaszek,
Artur Czumaj,
Matthias Englert,
Harald Räcke:
Almost tight bounds for reordering buffer management.
STOC 2011: 607-616 |
| 2010 |
| 21 |  | Matthias Englert,
Anupam Gupta,
Robert Krauthgamer,
Harald Räcke,
Inbal Talgam-Cohen,
Kunal Talwar:
Vertex Sparsifiers: New Results from Old Techniques.
APPROX-RANDOM 2010: 152-165 |
| 20 |  | Matthias Englert,
Anupam Gupta,
Robert Krauthgamer,
Harald Räcke,
Inbal Talgam-Cohen,
Kunal Talwar:
Vertex Sparsifiers: New Results from Old Techniques
CoRR abs/1006.4586: (2010) |
| 19 |  | Matthias Englert,
Thomas Franke,
Lars Olbrich:
Sensitivity of Wardrop Equilibria.
Theory Comput. Syst. 47(1): 3-14 (2010) |
| 18 |  | Matthias Englert,
Harald Räcke,
Matthias Westermann:
Reordering Buffers for General Metric Spaces.
Theory of Computing 6(1): 27-46 (2010) |
| 2009 |
| 17 |  | Matthias Englert,
Harald Räcke:
Oblivious Routing for the Lp-norm.
FOCS 2009: 32-40 |
| 16 |  | Matthias Englert,
Berthold Vöcking,
Melanie Winkler:
Economical Caching with Stochastic Prices.
SAGA 2009: 179-190 |
| 15 |  | Matthias Englert,
Heiko Röglin,
Jacob Spönemann,
Berthold Vöcking:
Economical Caching.
STACS 2009: 385-396 |
| 14 |  | Matthias Englert,
Heiko Röglin,
Matthias Westermann:
Evaluation of online strategies for reordering buffers.
ACM Journal of Experimental Algorithmics 14: (2009) |
| 13 |  | Matthias Englert,
Matthias Westermann:
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches.
Algorithmica 53(4): 523-548 (2009) |
| 2008 |
| 12 |  | Matthias Englert,
Deniz Özmen,
Matthias Westermann:
The Power of Reordering for Online Minimum Makespan Scheduling.
FOCS 2008: 603-612 |
| 11 |  | Matthias Englert,
Thomas Franke,
Lars Olbrich:
Sensitivity of Wardrop Equilibria.
SAGT 2008: 158-169 |
| 10 |  | Matthias Englert:
Online scheduling for buffering problems.
RWTH Aachen University 2008 |
| 2007 |
| 9 |  | Matthias Englert,
Heiko Röglin,
Berthold Vöcking:
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.
SODA 2007: 1295-1304 |
| 8 |  | Matthias Englert,
Matthias Westermann:
Considering suppressed packets improves buffer management in QoS switches.
SODA 2007: 209-218 |
| 7 |  | Matthias Englert,
Harald Räcke,
Matthias Westermann:
Reordering buffers for general metric spaces.
STOC 2007: 556-564 |
| 2006 |
| 6 |  | Matthias Englert,
Matthias Westermann:
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches.
ESA 2006: 352-363 |
| 5 |  | Matthias Englert,
Heiko Röglin,
Matthias Westermann:
Evaluation of Online Strategies for Reordering Buffers.
WEA 2006: 183-194 |
| 4 |  | Matthias Englert,
Heiko Röglin,
Berthold Vöcking:
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Electronic Colloquium on Computational Complexity (ECCC) 13(092): (2006) |
| 2005 |
| 3 |  | Matthias Englert,
Matthias Westermann:
Reordering Buffer Management for Non-uniform Cost Models.
ICALP 2005: 627-638 |
| 2004 |
| 2 |  | Patrick Briest,
Dimo Brockhoff,
Bastian Degener,
Matthias Englert,
Christian Gunia,
Oliver Heering,
Thomas Jansen,
Michael Leifhelm,
Kai Plociennik,
Heiko Röglin,
Andrea Schweer,
Dirk Sudholt,
Stefan Tannenbaum,
Ingo Wegener:
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.
PPSN 2004: 21-30 |
| 1 |  | Patrick Briest,
Dimo Brockhoff,
Bastian Degener,
Matthias Englert,
Christian Gunia,
Oliver Heering,
Thomas Jansen,
Michael Leifhelm,
Kai Plociennik,
Heiko Röglin,
Andrea Schweer,
Dirk Sudholt,
Stefan Tannenbaum,
Ingo Wegener:
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.
PPSN 2004: 31-40 |