The Necessity of Timekeeping in Adversarial Queueing. - Maik Weinard (WEA, 2005)

Conditional inequalities and the shortest common superstring problem. - Uli Laube; Maik Weinard (Int. J. Found. Comput. Sci., 2005)

Deciding the FIFO Stability of Networks in Polynomial Time. - Maik Weinard (CIAC, 2006)

Erratum: "Conditional Inequalities And The Shortest Common Superstring Problem". - Uli Laube; Maik Weinard (Int. J. Found. Comput. Sci., 2006)

On the Greedy Superstring Conjecture. - Maik Weinard; Georg Schnitger (SIAM J. Discret. Math., 2006)

Analyse von Heuristiken (Analysis of heuristics) - Maik Weinard (2006)

The Effects of Local Randomness in the Adversarial Queueing Model. - Yann Lorion; Maik Weinard (ESA, 2008)

Selected Design Issues. - Sabine Helwig; Falk Hüffner; Ivo Rössling; Maik Weinard (Algorithm Engineering, 2010)