Matthias Englert

805 total citations
30 papers, 283 citations indexed

About

Matthias Englert is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Matthias Englert has authored 30 papers receiving a total of 283 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computer Networks and Communications, 14 papers in Industrial and Manufacturing Engineering and 10 papers in Computational Theory and Mathematics. Recurrent topics in Matthias Englert's work include Optimization and Search Problems (25 papers), Scheduling and Optimization Algorithms (9 papers) and Complexity and Algorithms in Graphs (7 papers). Matthias Englert is often cited by papers focused on Optimization and Search Problems (25 papers), Scheduling and Optimization Algorithms (9 papers) and Complexity and Algorithms in Graphs (7 papers). Matthias Englert collaborates with scholars based in United Kingdom, Germany and France. Matthias Englert's co-authors include Matthias Westermann, Heiko Röglin, Berthold Vöcking, Harald Räcke, Anna Adamaszek, Artur Czumaj, Ranko Lazić, T. Franke, Jérôme Leroux and Sławomir Lasota and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Algorithmica.

In The Last Decade

Matthias Englert

25 papers receiving 275 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Matthias Englert United Kingdom	10	195	89	70	57	44	30	283
Joachim Schauer Austria	11	136 0.7×	185 2.1×	119 1.7×	36 0.6×	22 0.5×	23	353
Alain Sutter France	11	116 0.6×	177 2.0×	101 1.4×	71 1.2×	63 1.4×	13	360
Lee United States	2	237 1.2×	98 1.1×	70 1.0×	22 0.4×	44 1.0×	6	357
Laura Sanità Canada	7	149 0.8×	46 0.5×	215 3.1×	28 0.5×	89 2.0×	34	350
Steven S. Seiden United States	11	352 1.8×	324 3.6×	58 0.8×	41 0.7×	46 1.0×	25	519
Ravi Varadarajan United States	10	83 0.4×	25 0.3×	40 0.6×	66 1.2×	92 2.1×	30	296
Isabel Rosseti Brazil	10	49 0.3×	121 1.4×	48 0.7×	86 1.5×	33 0.8×	25	222
Philippe Chrétienne France	13	241 1.2×	279 3.1×	62 0.9×	24 0.4×	27 0.6×	40	466
Mikhail Batsyn Russia	10	53 0.3×	79 0.9×	75 1.1×	47 0.8×	7 0.2×	19	208
Manzhan Gu China	9	100 0.5×	235 2.6×	31 0.4×	85 1.5×	10 0.2×	21	331

Countries citing papers authored by Matthias Englert

Since Specialization

Citations

This map shows the geographic impact of Matthias Englert's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Matthias Englert with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matthias Englert more than expected).

Fields of papers citing papers by Matthias Englert

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Matthias Englert. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Matthias Englert. The network helps show where Matthias Englert may publish in the future.

Co-authorship network of co-authors of Matthias Englert

This figure shows the co-authorship network connecting the top 25 collaborators of Matthias Englert. A scholar is included among the top collaborators of Matthias Englert based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Matthias Englert. Matthias Englert is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Adamaszek, Anna, Artur Czumaj, Matthias Englert, & Harald Räcke. (2022). Almost Tight Bounds for Reordering Buffer Management. SIAM Journal on Computing. 51(3). 701–722.

Englert, Matthias, et al.. (2020). A lower bound for the coverability problem in acyclic pushdown VAS. Information Processing Letters. 167. 106079–106079. 3 indexed citations

Adamaszek, Anna, Artur Czumaj, Matthias Englert, & Harald Räcke. (2018). An O (log k )-Competitive Algorithm for Generalized Caching. ACM Transactions on Algorithms. 15(1). 1–18. 6 indexed citations

Englert, Matthias & Harald Räcke. (2017). Reordering Buffers with Logarithmic Diameter Dependency for Trees. Warwick Research Archive Portal (University of Warwick). 1224–1234.

Englert, Matthias, et al.. (2016). Online Packet Scheduling for CIOQ and Buffered Crossbar Switches. Warwick Research Archive Portal (University of Warwick). 241–250. 2 indexed citations

Englert, Matthias, et al.. (2016). Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. Edinburgh Research Explorer. 477–484. 7 indexed citations

Englert, Matthias, Heiko Röglin, & Berthold Vöcking. (2016). Smoothed Analysis of the 2-Opt Algorithm for the General TSP. ACM Transactions on Algorithms. 13(1). 1–15. 9 indexed citations

Azar, Yossi, et al.. (2014). Generalized Reordering Buffer Management. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Englert, Matthias, et al.. (2014). The Power of Reordering for Online Minimum Makespan Scheduling. SIAM Journal on Computing. 43(3). 1220–1237. 10 indexed citations

10.

Englert, Matthias, et al.. (2013). Economical Caching. 5(2). 1–21. 1 indexed citations

11.

Cygan, Marek, Matthias Englert, Anupam Gupta, Marcin Mucha, & Piotr Sankowski. (2013). Catch them if you can. 485–494. 1 indexed citations

12.

Adamaszek, Anna, Artur Czumaj, Matthias Englert, & Harald Räcke. (2012). An O(log k)-competitive algorithm for generalized caching. 1681–1689. 7 indexed citations

13.

Englert, Matthias & Matthias Westermann. (2012). Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches. SIAM Journal on Computing. 41(5). 1166–1192. 6 indexed citations

14.

Englert, Matthias. (2011). An overview of some results for reordering buffers. Computer Science - Research and Development. 27(3). 217–223. 2 indexed citations

15.

Englert, Matthias, et al.. (2010). . Theory of Computing. 6(1). 27–46. 6 indexed citations

16.

Englert, Matthias, et al.. (2009). Sensitivity of Wardrop Equilibria. Theory of Computing Systems. 47(1). 3–14. 9 indexed citations

17.

Englert, Matthias, Heiko Röglin, & Matthias Westermann. (2009). Evaluation of online strategies for reordering buffers. ACM Journal of Experimental Algorithmics. 14. 2 indexed citations

18.

Englert, Matthias, Heiko Röglin, & Berthold Vöcking. (2007). Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. Symposium on Discrete Algorithms. 1295–1304. 19 indexed citations

19.

Englert, Matthias & Matthias Westermann. (2007). Considering suppressed packets improves buffer management in QoS switches. Symposium on Discrete Algorithms. 209–218. 36 indexed citations

20.

Englert, Matthias, Harald Räcke, & Matthias Westermann. (2007). Reordering buffers for general metric spaces. 556–564. 12 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact