This page in English

Niklas Eriksen

Befattning: Universitetslektor Organisation: Institutionen för naturvetenskap och teknik

E-post: niklas.eriksen@oru.se

Telefon: 019 303361

Rum: T1119

Forskningsämne

Matematik

Om Niklas Eriksen

Niklas Eriksen är docent i matematik och proprefekt för Institutionen för naturvetenskap och teknik vid Örebro universitet. Han är huvudsakligen intresserad av kombinatorik.

Forskargrupper
Publikationer

Forskargrupper

Matematik

Publikationer

Artiklar i tidskrifter | Konferensbidrag |

Artiklar i tidskrifter

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

Konferensbidrag

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