A new approximation algorithm for the asymmetric TSP with triangle inequality M Bläser ACM Transactions on Algorithms (TALG) 4 (4), 1-15, 2008 | 102* | 2008 |

Fast matrix multiplication M Bläser Theory of Computing, 1-60, 2013 | 76 | 2013 |

On the complexity of the multiplication of matrices of small formats M Bläser Journal of Complexity 19 (1), 43-60, 2003 | 69 | 2003 |

Computing small partial coverings M Bläser Information Processing Letters 85 (6), 327-331, 2003 | 58 | 2003 |

A 5/2n^2 Lower Bound for the Rank of-Matrix Multiplication over Arbitrary Fields M Bläser FOCS'99, 45-50, 1999 | 53* | 1999 |

Deterministically testing sparse polynomial identities of unbounded degree M Bläser, M Hardt, RJ Lipton, NK Vishnoi Information Processing Letters 109 (3), 187-192, 2009 | 46 | 2009 |

An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality M Bläser, B Manthey, J Sgall Journal of Discrete Algorithms 4 (4), 623-632, 2006 | 44 | 2006 |

A 3/4-approximation algorithm for maximum ATSP with weights zero and one M Bläser Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004 | 43 | 2004 |

Lower bounds for the multiplicative complexity of matrix multiplication M Bläser computational complexity 8 (3), 203-226, 1999 | 37 | 1999 |

Computing cycle covers without short cycles M Bläser, B Siebert European Symposium on Algorithms, 368-379, 2001 | 36 | 2001 |

Complexity of the cover polynomial M Bläser, H Dell International Colloquium on Automata, Languages, and Programming, 801-812, 2007 | 35 | 2007 |

Approximating maximum weight cycle covers in directed graphs with weights zero and one M Bläser, B Manthey Algorithmica 42 (2), 121-139, 2005 | 35 | 2005 |

An 8/13-approximation algorithm for the asymmetric maximum TSP M Bläser Journal of Algorithms 50 (1), 23-48, 2004 | 34 | 2004 |

Private computation: k-connected versus 1-connected networks M Bläser, A Jakoby, M Liskiewicz, B Manthey Journal of cryptology 19 (3), 341-357, 2006 | 33* | 2006 |

On the complexity of the interlace polynomial M Bläser, C Hoffmann arXiv preprint arXiv:0707.4565, 2007 | 28 | 2007 |

Lower bounds for the bilinear complexity of associative algebras M Bläser computational complexity 9 (2), 73-112, 2000 | 21 | 2000 |

Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems M Bläser, LS Ram, M Sviridenko Operations Research Letters 37 (3), 176-180, 2009 | 19* | 2009 |

Two approximation algorithms for 3-cycle covers M Bläser, B Manthey International Workshop on Approximation Algorithms for Combinatorial …, 2002 | 19 | 2002 |

Smoothed analysis of partitioning algorithms for Euclidean functionals M Bläser, B Manthey, BVR Rao Algorithmica 66 (2), 397-418, 2013 | 18 | 2013 |

Weighted Counting of *k*-Matchings Is #W[1]-HardM Bläser, R Curticapean International Symposium on Parameterized and Exact Computation, 171-181, 2012 | 18 | 2012 |