RoboCupJunior: Robots Lure Kids to Science. - Gerhard K. Kraetzschmar; Martin Bader; Rolf Bayer (Künstliche Intell., 2006)

How to Achieve an Equivalent Simple Permutation in Linear Time. - Simon Gog; Martin Bader (RECOMB-CG, 2007)

Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. - Martin Bader; Enno Ohlebusch (J. Comput. Biol., 2007)

GENESIS: genome evolution scenarios. - Simon Gog; Martin Bader; Enno Ohlebusch (Bioinform., 2008)

A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions. - Martin Bader; Mohamed Ibrahim Abouelhoda; Enno Ohlebusch (BMC Bioinform., 2008)

Fast Algorithms for Transforming Back and Forth between a Signed Permutation and Its Equivalent Simple Permutation. - Simon Gog; Martin Bader (J. Comput. Biol., 2008)

Sorting by reversals, block interchanges, tandem duplications, and deletions. - Martin Bader (BMC Bioinform., 2009)

Genome rearrangements with duplications. - Martin Bader (BMC Bioinform., 2010)

Genome Rearrangement Algorithmen. - Martin Bader (Ausgezeichnete Informatikdissertationen, 2011)

The transposition median problem is NP-complete. - Martin Bader (Theor. Comput. Sci., 2011)

Genome rearrangement algorithms. - Martin Bader (2011)