Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations. - Niklas Eriksen; Henrik Eriksson; Kimmo Eriksson (Electron. J. Comb., 2000)

Approximating the Expected Number of Inversions Given the Number of Breakpoints. - Niklas Eriksen (WABI, 2002)

(1+epsilon)-Approximation of sorting by reversals and transpositions. - Niklas Eriksen (Theor. Comput. Sci., 2002)

Estimating the expected reversal distance after a fixed number of reversals. - Niklas Eriksen; Axel Hultman (Adv. Appl. Math., 2004)

Expected number of inversions after a sequence of random adjacent transpositions - An exact expression. - Niklas Eriksen (Discret. Math., 2005)

Expected Gene Order Distances and Model Selection in Bacteria. - Niklas Eriksen (German Conference on Bioinformatics, 2007)

Reversal and transposition medians. - Niklas Eriksen (Theor. Comput. Sci., 2007)

Expected gene-order distances and model selection in bacteria. - Daniel Dalevi; Niklas Eriksen (Bioinform., 2008)

Expected number of breakpoints after t random reversals in genomes with duplicate genes. - Niklas Eriksen (Discret. Appl. Math., 2008)

The Freshman's Approach to Conway's Napkin Problem. - Niklas Eriksen (Am. Math. Mon., 2008)

Enumeration of Derangements with Descents in Prescribed Positions. - Niklas Eriksen; Ragnar Freij; Johan Wästlund (Electron. J. Comb., 2009)

Equidistributed Statistics on Matchings and Permutations. - Niklas Eriksen; Jonas Sjöstrand (Electron. J. Comb., 2014)