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 001; Michael Leifhelm; Kai Plociennik; Heiko Röglin; Andrea Schweer; Dirk Sudholt; et al. (PPSN, 2004)

The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. - Patrick Briest; Dimo Brockhoff; Bastian Degener; Matthias Englert; Christian Gunia; Oliver Heering; Thomas Jansen 001; Michael Leifhelm; Kai Plociennik; Heiko Röglin; Andrea Schweer; Dirk Sudholt; et al. (PPSN, 2004)

Reordering Buffer Management for Non-uniform Cost Models. - Matthias Englert; Matthias Westermann (ICALP, 2005)

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. - Matthias Englert; Heiko Röglin; Berthold Vöcking (Electron. Colloquium Comput. Complex., 2006)

Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. - Matthias Englert; Heiko Röglin; Berthold Vöcking (SODA, 2007)

Considering suppressed packets improves buffer management in QoS switches. - Matthias Englert; Matthias Westermann (SODA, 2007)

Online scheduling for buffering problems. - Matthias Englert (2008)

Oblivious Routing for the Lp-norm. - Matthias Englert; Harald Räcke (FOCS, 2009)

Economical Caching with Stochastic Prices. - Matthias Englert; Berthold Vöcking; Melanie Winkler (SAGA, 2009)

Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. - Matthias Englert; Matthias Westermann (Algorithmica, 2009)

Evaluation of online strategies for reordering buffers. - Matthias Englert; Heiko Röglin; Matthias Westermann (ACM J. Exp. Algorithmics, 2009)

Sensitivity of Wardrop Equilibria. - Matthias Englert; Thomas Franke; Lars Olbrich (Theory Comput. Syst., 2010)

Reordering Buffers for General Metric Spaces. - Matthias Englert; Harald Räcke; Matthias Westermann (Theory Comput., 2010)

Multiple-Choice Balanced Allocation in (Almost) Parallel. - Petra Berenbrink; Artur Czumaj; Matthias Englert; Tom Friedetzky; Lars Nagel 001 (APPROX-RANDOM, 2012)

Optimal online buffer scheduling for block devices. - Anna Adamaszek; Artur Czumaj; Matthias Englert; Harald Räcke (STOC, 2012)

An overview of some results for reordering buffers. - Matthias Englert (Comput. Sci. Res. Dev., 2012)

Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches. - Matthias Englert; Matthias Westermann (SIAM J. Comput., 2012)

Catch them if you can: how to serve impatient users. - Marek Cygan; Matthias Englert; Anupam Gupta 001; Marcin Mucha; Piotr Sankowski (ITCS, 2013)

Economical Caching. - Matthias Englert; Heiko Röglin; Jacob Spönemann; Berthold Vöcking (ACM Trans. Comput. Theory, 2013)

New Bounds for Online Packing LPs. - Matthias Englert; Nicolaos Matsakis; Marcin Mucha (LATIN, 2014)

Generalized Reordering Buffer Management. - Yossi Azar; Matthias Englert; Iftah Gamzu; Eytan Kidron (STACS, 2014)

Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons. - Matthias Englert; Sandra Siebert; Martin Ziegler 001 (CoRR, 2014)

Vertex Sparsifiers: New Results from Old Techniques. - Matthias Englert; Anupam Gupta 001; Robert Krauthgamer; Harald Räcke; Inbal Talgam-Cohen; Kunal Talwar (SIAM J. Comput., 2014)

The Power of Reordering for Online Minimum Makespan Scheduling. - Matthias Englert; Deniz Özmen; Matthias Westermann (SIAM J. Comput., 2014)

Comparison-Based FIFO Buffer Management in QoS Switches. - Kamal Al-Bawani; Matthias Englert; Matthias Westermann (LATIN, 2016)

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. - Matthias Englert; Ranko Lazic 001; Patrick Totzke (LICS, 2016)

Smoothed Analysis of the 2-Opt Algorithm for the General TSP. - Matthias Englert; Heiko Röglin; Berthold Vöcking (ACM Trans. Algorithms, 2016)

Scheduling with a Reordering Buffer. - Matthias Englert; Matthias Westermann (Encyclopedia of Algorithms, 2016)

Reordering Buffers with Logarithmic Diameter Dependency for Trees. - Matthias Englert; Harald Räcke (SODA, 2017)

Comparison-Based Buffer Management in QoS Switches. - Kamal Al-Bawani; Matthias Englert; Matthias Westermann (Algorithmica, 2018)

Online Packet Scheduling for CIOQ and Buffered Crossbar Switches. - Kamal Al-Bawani; Matthias Englert; Matthias Westermann (Algorithmica, 2018)

The reordering buffer problem on the line revisited. - Matthias Englert (SIGACT News, 2018)

Polylogarithmic Guarantees for Generalized Reordering Buffer Management. - Matthias Englert; Harald Räcke; Richard Stotz (FOCS, 2019)

An O(log k)-Competitive Algorithm for Generalized Caching. - Anna Adamaszek; Artur Czumaj; Matthias Englert; Harald Räcke (ACM Trans. Algorithms, 2019)

Using Mesh Shaders for Continuous Level-of-Detail Terrain Rendering. - Matthias Englert (SIGGRAPH Talks, 2020)

Modeling Asteroid (101955) Bennu as a Real-time Terrain. - Matthias Englert (SIGGRAPH Talks, 2021)

Online Makespan Scheduling with Job Migration on Uniform Machines. - Matthias Englert; David Mezlaf; Matthias Westermann (Algorithmica, 2021)

A lower bound for the coverability problem in acyclic pushdown VAS. - Matthias Englert; Piotr Hofman; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Juliusz Straszynski (Inf. Process. Lett., 2021)

The Reachability Problem for Two-Dimensional Vector Addition Systems with States. - Michael Blondin; Matthias Englert; Alain Finkel; Stefan Göller; Christoph Haase; Ranko Lazic 001; Pierre McKenzie; Patrick Totzke (J. ACM, 2021)

Adversarial Reprogramming Revisited. - Matthias Englert; Ranko Lazic 001 (NeurIPS, 2022)

Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. - Matthias Englert; Nicolaos Matsakis; Pavel Veselý 001 (STOC, 2022)

Almost Tight Bounds for Reordering Buffer Management. - Anna Adamaszek; Artur Czumaj; Matthias Englert; Harald Räcke (SIAM J. Comput., 2022)

Approximation Guarantees for Shortest Superstrings: Simpler and Better. - Matthias Englert; Nicolaos Matsakis; Pavel Veselý 001 (ISAAC, 2023)

Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs. - Dmitry Chistikov 001; Matthias Englert; Ranko Lazic 001 (NeurIPS, 2023)

Implicit Regularization of AdaDelta. - Matthias Englert; Ranko Lazic 001; Avi Semler (Trans. Mach. Learn. Res., 2024)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. - Antonios Antoniadis 001; Matthias Englert; Nicolaos Matsakis; Pavel Veselý 001 (ACM Trans. Algorithms, 2024)

Variance Dichotomy in Feature Spaces of Facial Recognition Systems is a Weak Defense against Simple Weight Manipulation Attacks. - Matthew Bowditch; Mike Paterson; Matthias Englert; Ranko Lazic 001 (Trans. Mach. Learn. Res., 2025)

Benignity of loss landscape with weight decay requires both large overparametrization and initialization. - Etienne Boursier; Matthew Bowditch; Matthias Englert; Ranko Lazic 001 (CoRR, 2025)