معرفی
Markus Bläser is a Professor in the Department of Computer Science at Saarland University, located on the Saarland Informatics Campus. He is an active researcher in theoretical computer science, with a focus on computational complexity, approximation algorithms, and algebraic complexity. He serves as the Editor-in-Chief of the Springer journal computational complexity.
His research interests lie primarily in computational complexity, algebraic complexity, and approximation algorithms. He investigates fundamental problems such as the complexity of matrix multiplication, the design of approximation algorithms for NP-hard problems like the Traveling Salesman Problem (TSP), and the structural properties of algebras in relation to computational efficiency. His work bridges deep mathematical theory with algorithmic applications.
The recent publications highlight a strong trend in combinatorial optimization, particularly approximation algorithms for asymmetric TSP and cycle cover problems, often achieving improved performance ratios. Another major theme is algebraic complexity, especially lower bounds for bilinear forms and the rank of algebras. A smaller but notable stream involves algorithmic game theory, such as budget-balanced mechanisms for multicast pricing.
Scientific Awards:
- No awards or fellowships mentioned in the provided text.
Markus Bläser has advised PhD and other graduate students, though specific names are not listed. He has led research projects likely supported by German funding agencies, though explicit grants are not detailed. As Editor-in-Chief of a major journal, he plays a significant role in the dissemination of high-quality research in computational complexity.
Labs and Research Groups:
He leads or is a key member of a research group at Saarland University whose webpage hosts publications from 2006 onward. The group is part of the Saarland Informatics Campus, a collaborative environment including institutions like the Max Planck Institute for Informatics.
