Markus Bläser

1.1k total citations
54 papers, 337 citations indexed

About

Markus Bläser is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, Markus Bläser has authored 54 papers receiving a total of 337 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 22 papers in Artificial Intelligence and 13 papers in Electrical and Electronic Engineering. Recurrent topics in Markus Bläser's work include Complexity and Algorithms in Graphs (17 papers), Advanced Graph Theory Research (14 papers) and Coding theory and cryptography (13 papers). Markus Bläser is often cited by papers focused on Complexity and Algorithms in Graphs (17 papers), Advanced Graph Theory Research (14 papers) and Coding theory and cryptography (13 papers). Markus Bläser collaborates with scholars based in Germany, Switzerland and United States. Markus Bläser's co-authors include Bodo Manthey, H. Melchior, Jiřı́ Sgall, Roland Erne, Nisheeth K. Vishnoi, Moritz Hardt, Richard J. Lipton, Christian Herzog, Daniel Guidotti and Jianjun Yu and has published in prestigious journals such as Applied Physics Letters, SIAM Journal on Computing and IEEE Photonics Technology Letters.

In The Last Decade

Markus Bläser

47 papers receiving 305 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Markus Bläser Germany	11	172	90	85	72	61	54	337
N. M. Stephens United Kingdom	11	57 0.3×	50 0.6×	48 0.6×	69 1.0×	34 0.6×	22	315
Dion Gijswijt Netherlands	9	107 0.6×	86 1.0×	68 0.8×	50 0.7×	24 0.4×	22	268
Ran Duan United States	7	153 0.9×	67 0.7×	30 0.4×	138 1.9×	14 0.2×	18	274
Eliezer Dekel United States	7	156 0.9×	91 1.0×	67 0.8×	252 3.5×	33 0.5×	26	411
Dana Moshkovitz United States	7	184 1.1×	120 1.3×	29 0.3×	85 1.2×	10 0.2×	29	288
Doron Chen Israel	9	71 0.4×	19 0.2×	28 0.3×	47 0.7×	61 1.0×	20	238
Michael Dinitz United States	11	90 0.5×	44 0.5×	181 2.1×	353 4.9×	14 0.2×	32	439
Antoine Deza Canada	10	121 0.7×	56 0.6×	39 0.5×	10 0.1×	11 0.2×	59	266
Andrej Bogdanov Hong Kong	12	255 1.5×	238 2.6×	123 1.4×	199 2.8×	8 0.1×	36	467
Elena Lodi Italy	10	67 0.4×	33 0.4×	73 0.9×	69 1.0×	19 0.3×	27	250

Countries citing papers authored by Markus Bläser

Since Specialization

Citations

This map shows the geographic impact of Markus Bläser'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 Markus Bläser with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Markus Bläser more than expected).

Fields of papers citing papers by Markus Bläser

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Markus Bläser. 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 Markus Bläser. The network helps show where Markus Bläser may publish in the future.

Co-authorship network of co-authors of Markus Bläser

This figure shows the co-authorship network connecting the top 25 collaborators of Markus Bläser. A scholar is included among the top collaborators of Markus Bläser 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 Markus Bläser. Markus Bläser 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

Zander, Benito van der, Markus Bläser, & Maciej Liśkiewicz. (2023). The Hardness of Reasoning about Probabilities and Causality. 5730–5738. 1 indexed citations

Bläser, Markus, et al.. (2020). Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

Bläser, Markus, et al.. (2020). Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 13.

Bläser, Markus, David Eisenbud, & Frank–Olaf Schreyer. (2017). Ulrich complexity. Differential Geometry and its Applications. 55. 128–145. 3 indexed citations

Bläser, Markus. (2014). Noncommutativity makes determinants hard. Information and Computation. 243. 133–144. 4 indexed citations

Bläser, Markus, et al.. (2014). A new deterministic algorithm for sparse multivariate polynomial interpolation. 51–58. 2 indexed citations

Bläser, Markus. (2012). Noncommutativity makes determinants hard.. Electronic colloquium on computational complexity. 19. 142. 1 indexed citations

Bläser, Markus, Holger Dell, & Mahmoud Fouz. (2011). Complexity and Approximability of the Cover Polynomial. Computational Complexity. 21(3). 359–419. 3 indexed citations

Bläser, Markus, et al.. (2011). Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

10.

Bläser, Markus, et al.. (2007). Adding cardinality constraints to integer programs with applications to maximum satisfiability. Information Processing Letters. 105(5). 194–198. 2 indexed citations

11.

Guidotti, Daniel, et al.. (2006). Edge Viewing Photodetectors for Strictly In-plane Lightwave Circuit Integration and Flexible Optical Interconnects. 782–788. 9 indexed citations

12.

Bläser, Markus, Bodo Manthey, & Jiřı́ Sgall. (2005). An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. Journal of Discrete Algorithms. 4(4). 623–632. 19 indexed citations

13.

Bläser, Markus. (2004). Approximate budget balanced mechanisms with low communication costs for the multicast cost-sharing problem. Symposium on Discrete Algorithms. 625–626. 4 indexed citations

14.

Bläser, Markus. (2004). Beyond the Alder–Strassen bound. Theoretical Computer Science. 331(1). 3–21. 4 indexed citations

15.

Bläser, Markus. (2003). A new approximation algorithm for the asymmetric TSP with triangle inequality. Symposium on Discrete Algorithms. 638–645. 22 indexed citations

16.

Bläser, Markus. (2003). The complexity of bivariate power series arithmetic. Theoretical Computer Science. 295(1-3). 65–83. 2 indexed citations

17.

Bläser, Markus. (2003). On the complexity of the multiplication of matrices of small formats. Journal of Complexity. 19(1). 43–60. 31 indexed citations

18.

Bläser, Markus. (2002). An 8/13-approximation algorithm for the asymmetric maximum TSP. Symposium on Discrete Algorithms. 50(1). 64–73. 1 indexed citations

19.

Bläser, Markus. (1999). A - Lower Bound for the Rank of - Matrix Multiplication over Arbitrary Fields. 45. 9 indexed citations

20.

Bläser, Markus & H. Melchior. (1992). High-performance monolithically integrated In/sub 0.53/Ga/sub 0.47/As/InP p-i-n /JFET optical receiver front-end with adaptive feedback control. IEEE Photonics Technology Letters. 4(11). 1244–1247. 10 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