Matthias Englert
Matthias Englert
Verified email at warwick.ac.uk
Title
Cited by
Cited by
Year
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
M Englert, H Röglin, B Vöcking
Algorithmica 68 (1), 190-264, 2014
155*2014
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
M Englert, M Westermann
SIAM Journal on Computing 41 (5), 1166-1192, 2012
93*2012
Lower and upper bounds on FIFO buffer management in QoS switches
M Englert, M Westermann
Algorithmica 53 (4), 523-548, 2009
672009
Vertex sparsifiers: New results from old techniques
M Englert, A Gupta, R Krauthgamer, H Racke, I Talgam-Cohen, K Talwar
SIAM Journal on Computing 43 (4), 1239-1262, 2014
622014
The power of reordering for online minimum makespan scheduling
M Englert, D Özmen, M Westermann
SIAM Journal on Computing 43 (3), 1220-1237, 2014
52*2014
Reordering buffer management for non-uniform cost models
M Englert, M Westermann
International Colloquium on Automata, Languages, and Programming, 627-638, 2005
442005
Reordering buffers for general metric spaces
M Englert, H Räcke, M Westermann
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
412007
Almost tight bounds for reordering buffer management
A Adamaszek, A Czumaj, M Englert, H Räcke
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
302011
An O (log k)-Competitive Algorithm for Generalized Caching
A Adamaszek, A Czumaj, M Englert, H Räcke
ACM Transactions on Algorithms (TALG) 15 (1), 6, 2018
24*2018
Sensitivity of Wardrop Equilibria
M Englert, T Franke, L Olbrich
Theory of Computing Systems 47 (1), 3-14, 2010
212010
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete*
M Englert, R Lazić, P Totzke
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-8, 2016
192016
Multiple-choice balanced allocation in (almost) parallel
P Berenbrink, A Czumaj, M Englert, T Friedetzky, L Nagel
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
162012
Experimental supplements to the theoretical analysis of EAs on problems from combinatorial optimization
P Briest, D Brockhoff, B Degener, M Englert, C Gunia, O Heering, ...
International Conference on Parallel Problem Solving from Nature, 21-30, 2004
162004
Oblivious routing for the Lp-norm
M Englert, H Räcke
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 32-40, 2009
152009
Evaluation of online strategies for reordering buffers
M Englert, H Röglin, M Westermann
Journal of Experimental Algorithmics (JEA) 14, 3.3-3.14, 2010
12*2010
Economical caching
M Englert, H Röglin, J Spönemann, B Vöcking
ACM Transactions on Computation Theory (TOCT) 5 (2), 1-21, 2013
9*2013
Optimal online buffer scheduling for block devices
A Adamaszek, A Czumaj, M Englert, H Räcke
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
82012
The Ising model: simple evolutionary algorithms as adaptation schemes
P Briest, D Brockhoff, B Degener, M Englert, C Gunia, O Heering, ...
Parallel Problem Solving from Nature-PPSN VIII, 31-40, 2004
72004
Reordering Buffers with Logarithmic Diameter Dependency for Trees
M Englert, H Räcke
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
62017
Smoothed analysis of the 2-Opt algorithm for the general TSP
M Englert, H Röglin, B Vöcking
ACM Transactions on Algorithms (TALG) 13 (1), 1-15, 2016
52016
The system can't perform the operation now. Try again later.
Articles 1–20