default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNiklas Eriksen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j10]Niklas Eriksen, Jonas Sjöstrand:
Equidistributed Statistics on Matchings and Permutations. Electron. J. Comb. 21(4): 4 (2014)
2000 – 2009
- 2009
- [j9]Niklas Eriksen, Ragnar Freij, Johan Wästlund:
Enumeration of Derangements with Descents in Prescribed Positions. Electron. J. Comb. 16(1) (2009) - 2008
- [j8]Daniel Dalevi, Niklas Eriksen:
Expected gene-order distances and model selection in bacteria. Bioinform. 24(11): 1332-1338 (2008) - [j7]Niklas Eriksen:
Expected number of breakpoints after t random reversals in genomes with duplicate genes. Discret. Appl. Math. 156(12): 2320-2335 (2008) - [j6]Niklas Eriksen:
The Freshman's Approach to Conway's Napkin Problem. Am. Math. Mon. 115(6): 492-498 (2008) - 2007
- [j5]Niklas Eriksen:
Reversal and transposition medians. Theor. Comput. Sci. 374(1-3): 111-126 (2007) - [c3]Niklas Eriksen:
Expected Gene Order Distances and Model Selection in Bacteria. German Conference on Bioinformatics 2007: 135-144 - 2005
- [j4]Niklas Eriksen:
Expected number of inversions after a sequence of random adjacent transpositions - An exact expression. Discret. Math. 298(1-3): 155-168 (2005) - 2004
- [j3]Niklas Eriksen, Axel Hultman:
Estimating the expected reversal distance after a fixed number of reversals. Adv. Appl. Math. 32(3): 439-453 (2004) - 2002
- [j2]Niklas Eriksen:
(1+epsilon)-Approximation of sorting by reversals and transpositions. Theor. Comput. Sci. 289(1): 517-529 (2002) - [c2]Niklas Eriksen:
Approximating the Expected Number of Inversions Given the Number of Breakpoints. WABI 2002: 316-330 - 2001
- [c1]Niklas Eriksen:
(1+epsilon)-Approximation of Sorting by Reversals and Transpositions. WABI 2001: 227-237 - 2000
- [j1]Niklas Eriksen, Henrik Eriksson, Kimmo Eriksson:
Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations. Electron. J. Comb. 7 (2000)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
