This page in Swedish

Niklas Eriksen

Position: Senior Lecturer School/office: School of Science and Technology

Email: bmlrbGFzLmVyaWtzZW47b3J1LnNl

Phone: +46 19 303361

Room: T1119

Research subject

Mathematics

About Niklas Eriksen

Niklas Eriksen is an associate professor in mathematics and deputy head of the School of Science and Technology at Örebro University. His main scientific interest is combinatorics.

Research groups
Publications

Research groups

Mathematics

Publications

Articles in journals | Conference papers |

Articles in journals

Eriksen, N. & Sjöstrand, J. (2014). Equidistributed Statistics on Matchings and Permutations. The Electronic Journal of Combinatorics, 21 (4). [BibTeX]
Eriksen, N. , Freij, R. & Wästlund, J. (2009). Enumeration of Derangements with Descents in Prescribed Positions. The Electronic Journal of Combinatorics, 16 (1). [BibTeX]
Dalevi, D. & Eriksen, N. (2008). Expected Gene Order Distances and Model Selection in Bacteria. Bioinformatics, 24 (11), 1332-1338. [BibTeX]
Eriksen, N. (2008). Expected number of breakpoints after t random reversals in genomes with duplicate genes. Discrete Applied Mathematics, 156 (12), 2320-2335. [BibTeX]
Eriksen, N. (2008). The Freshman's Approach to Conway's Napkin Problem. The American mathematical monthly, 115 (6), 492-498. [BibTeX]
Eriksen, N. (2007). Reversal and Transposition Medians. Theoretical Computer Science, 374 (1-3), 111-126. [BibTeX]
Eriksen, N. (2005). Expected number of inversions after a sequence of random adjacent transpositions: an exact expression. Discrete Mathematics, 298, 155-168. [BibTeX]
Eriksen, N. & Hultman, A. (2005). Expected reflection distance in G(r,1,n) after a fixed number of reflections. Annals of Combinatorics, 9 (1), 21-33. [BibTeX]
Eriksen, N. & Hultman, A. (2004). Estimating the expected reversal distance after a fixed number of reversals. Advances in Applied Mathematics, 32, 439-453. [BibTeX]
Eriksen, N. (2002). (1+eps)-approximation of sorting by reversals and transpositions. Theoretical Computer Science, 289 (1), 517-529. [BibTeX]
Eriksen, N. (2002). Approximating the expected number of inversions given the number of breakpoints. Lecture Notes in Computer Science, 2452, 316-330. [BibTeX]
Dalevi, D. A. , Eriksen, N. , Eriksson, K. & Andersson, S. G. (2002). Measuring genome divergence in bacteria: A case study using Chlamydian data. Journal of Molecular Evolution, 55, 24-36. [BibTeX]
Eriksen, N. , Eriksson, H. & Eriksson, K. (2000). Diagonal checker-jumping and Eulerian numbers for color-signed permutations. The Electronic Journal of Combinatorics, 7. [BibTeX]

Conference papers

Eriksen, N. , Hilmerby, S. , Johansson, M. , Karlsson, L. & Loutfi, A. (2016). Starting from Scratch: Implementing CDIO in a new Master of Science in Engineering. Paper presented at NU 2016, Malmö, Sweden, June 15-17, 2016. [BibTeX]
Burstein, A. & Eriksen, N. (2008). Combinatorial Properties of Permutation Tableaux. In: 20th International Conference on Formal Power Series and Algebraic Combinatorics FPSAC'08. Paper presented at 20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08, Valparaiso, Chile, 23-27 June, 2008. (pp. 625-40). Nancy, France: Discrete Mathematics and Theoretical Computer Science (DMTCS). [BibTeX]