Matthias Englert

email: M.Englert at warwick.ac.uk Office: Coventry CV4 7AL, United Kingdom Room: CS2.23 Phone: +44 24 7657 3784 See here for office hours.
I am also affiliated with .

For students outside of 糖心TV, I do not offer any kind of internships at this time. Please excuse if I do not respond to such email requests.

Program Committees

, , , , , , , , , , ,

Publications

The downloadable version of a publication is some version of the work. For the original publication see, for example, the publishers website or your favorite library.

Adversarial Reprogramming Revisited
Matthias Englert, Ranko Lazić
In Proc. of the (New Orleans, USA, 2022). To appear. [ | ©]
Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
In Proc. of the (Rome, Italy, 2022). [ | ©]
Breaking the Barrier Of 2 for the Competiveness of Longest Queue Drop
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, and Pavel Veselý
In Proc. of the (Glasgow, Scotland, 2021). Pages 17:1-17:20. [ | ©]
A Lower Bound for the Coverability Problem in Acyclic Pushdown VAS
Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazić, Jérôme Leroux, and Juliusz Straszyński
Information Processing Letters, 167: 106079, 2021. [ | ©]
Polylogarithmic Guarantees for Generalized Reordering Buffer Management
Matthias Englert, Harald Räcke, and Richard Stotz
In Proc. of the (Baltimore, USA, 2019). Pages 38-59. [ | ©]
Online Makespan Scheduling with Job Migration on Uniform Machines
Matthias Englert, David Mezlaf, and Matthias Westermann
In Proc. of the (Helsinki, Finland, 2018). Pages 26:1-26:14.
Algorithica 83(12): 3537-3566, 2021. [ | ©]
Reordering Buffers with Logarithmic Diameter Dependency for Trees
Matthias Englert, and Harald Räcke
In Proc. of the (Barcelona, Spain, 2017). Pages 1224-1234. [ | ©]
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
Matthias Englert, Ranko Lazić, and Patrick Totzke
In Proc. of the (New York, USA, 2016). Pages 477-484. [ | ©]
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
Kamal Al-Bawani, Matthias Englert, and Matthias Westermann
In Proc. of the (Asilomar State Beach, USA, 2016). Pages 241-250. [ | ©]
Comparison-based FIFO Buffer Management in QoS Switches
Kamal Al-Bawani, Matthias Englert, and Matthias Westermann
In Proc. of the (Ensenada, Mexico, 2016). Pages 27-40. [ | ©]
Generalized Reordering Buffer Management
Yossi Azar, Matthias Englert, Iftah Gamzu, and Eytan Kidron
In Proc. of the (Lyon, France, 2014). Pages 87-98. [ | ©]
New Bounds for Online Packing LPs
Matthias Englert, Nicolaos Matsakis, and Marcin Mucha
In Proc. of the (Montevideo, Uruguay, 2014). Pages 318-329. [ | ©]
Catch Them If You Can: How to Serve Impatient Users
Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, and Piotr Sankowski
In Proc. of the (Berkeley, USA, 2013). Pages 485-494. [ | ©]
Multiple-Choice Balanced Allocation in (almost) Parallel
Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, and Lars Nagel
In Proc. of the (Cambridge, USA, 2012). Pages 411-422. [ | ©]
Optimal Online Buffer Scheduling for Block Devices
Anna Adamaszek, Artur Czumaj, Matthias Englert, and Harald Räcke
In Proc. of the (New York, USA, 2012). Pages 589-598. [ | ©]
An O(log k)-competitive Algorithm for Generalized Caching
Anna Adamaszek, Artur Czumaj, Matthias Englert, and Harald Räcke
In Proc. of the (Kyoto, Japan, 2012). Pages 1681-1689. [ | ©]
ACM Transactions on Algorithms, 15(1):6:1-6:18, 2019.
Almost Tight Bounds for Reordering Buffer Management
Anna Adamaszek, Artur Czumaj, Matthias Englert, and Harald Räcke
In Proc. of the (San Jose, USA, 2011). Pages 607-616. [ | ©]
SIAM Journal on Computing 51(3): 701-722, 2022.
Vertex Sparsifiers: New Results from Old Techniques
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, and Kunal Talwar
In Proc. of the (Barcelona, Spain, 2010). Pages 152-165. [ | ©]
SIAM Journal on Computing 43(4): 1239-1262, 2014.
Oblivious Routing for the L_p-norm
Matthias Englert and Harald Räcke
In Proc. of the (Atlanta, USA, 2009). Pages 32-40. [ | ©]
Economical Caching with Stochastic Prices
Matthias Englert, Berthold Vöcking, and Melanie Winkler
In Proc. of the (Sapporo, Japan, 2009). Pages 179-190. [ | ©]
Economical Caching
Matthias Englert, Heiko Röglin, Jacob Spönemann, and Berthold Vöcking
In Proc. of the (Freiburg, Germany, 2009). Pages 385-396. [ | ©]
ACM Transactions on Computation Theory 5(2): 4, 2013.
The Power of Reordering for Online Minimum Makespan Scheduling
Matthias Englert, Deniz Özmen, and Matthias Westermann
In Proc. of the (Philadelphia, USA, 2008). Pages 603-612. [ | ©]
SIAM Journal on Computing 43(3): 1220-1237, 2014.
Sensitivity of Wardrop Equilibria
Matthias Englert, Thomas Franke, and Lars Olbrich
In Proc. of the (Paderborn, Germany, 2008), Pages 158-169. [ | ©]
Theory of Computing Systems (special issue SAGT 2008), 47(1): 3-14, 2010.
Reordering Buffers for General Metric Spaces
Matthias Englert, Harald Räcke, and Matthias Westermann
In Proc. of the (San Diego, USA, 2007), Pages 556-564. [ | ©]
Theory of Computing, 6: 27-46, 2010.
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
Matthias Englert, Heiko Röglin, and Berthold Vöcking
In Proc. of the (New Orleans, USA, 2007), Pages 1295-1304. [ | ©]
Algorithmica, 68(1):190-264, 2014.
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
Matthias Englert and Matthias Westermann
In Proc. of the (New Orleans, USA, 2007), Pages 209-218. [ | ©]
SIAM Journal on Computing, 41(5): 1166-1192, 2012.
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
Matthias Englert and Matthias Westermann
In Proc. of the (Zürich, Switzerland, 2006), Pages 352-363. [ | ©]
Algorithmica (special issue ESA 2006), 53(4): 523-548, 2009.
Evaluation of Online Strategies for Reordering Buffers
Matthias Englert, Heiko Röglin, and Matthias Westermann
In Proc. of the (Menorca Island, Spain, 2006), Pages 183-194. [ | ©]
ACM Journal of Experimental Algorithmics (special issue WEA 2006), 14: 3.3-3.14, 2009.
Reordering Buffer Management for Non-Uniform Cost Models
Matthias Englert and Matthias Westermann
In Proc. of the (Lisboa, Portugal, 2005), Pages 627-638. [ | ©]
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes
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, and Ingo Wegener
In Proc. of the (Birmingham, UK, 2004), Pages 31-40. [ | ©]
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
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, and Ingo Wegener
In Proc. of the (Birmingham, UK, 2004), Pages 21-30. [ | ©]