default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom Hartmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Bruno J. Schmidt
, Tom Hartmann, Peter F. Stadler:
Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss. Adv. Appl. Math. 161: 102757 (2024)- 2023
- [j11]David Schaller, Tom Hartmann, Manuel Lafond, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Relative timing information and orthology in evolutionary scenarios. Algorithms Mol. Biol. 18(1): 16 (2023) - 2022
- [j10]Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Complete edge-colored permutation graphs. Adv. Appl. Math. 139: 102377 (2022) - [j9]Philine Geser, Hoang Thanh Le, Tom Hartmann, Martin Middendorf:
On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine. Eur. J. Oper. Res. 303(2): 593-601 (2022) - [i3]David Schaller, Tom Hartmann, Manuel Lafond, Nicolas Wieseke, Marc Hellmuth, Peter F. Stadler:
Relative Timing Information and Orthology in Evolutionary Scenarios. CoRR abs/2212.02201 (2022) - 2021
- [j8]Thomas Gatter, Sarah von Löhneysen, Jörg Fallmann, Polina Drozdova, Tom Hartmann, Peter F. Stadler:
LazyB: fast and cheap genome assembly. Algorithms Mol. Biol. 16(1): 8 (2021) - [j7]Tom Hartmann, Max Bannach, Martin Middendorf:
Sorting Signed Permutations by Inverse Tandem Duplication Random Losses. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2177-2188 (2021) - 2020
- [c3]Daniel Abitz, Tom Hartmann, Martin Middendorf:
A weighted population update rule for PACO applied to the single machine total weighted tardiness problem. GECCO 2020: 4-12 - [c2]Thomas Gatter, Sarah von Löhneysen, Polina Drozdova, Tom Hartmann, Peter F. Stadler:
Economic Genome Assembly from Low Coverage Illumina and Nanopore Data. WABI 2020: 10:1-10:22 - [i2]Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Complete Edge-Colored Permutation Graphs. CoRR abs/2004.07118 (2020) - [i1]Daniel Abitz, Tom Hartmann, Martin Middendorf:
A Weighted Population Update Rule for PACO Applied to the Single Machine Total Weighted Tardiness Problem. CoRR abs/2004.08433 (2020)
2010 – 2019
- 2019
- [j6]Tom Hartmann, Matthias Bernt, Martin Middendorf:
An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements. IEEE ACM Trans. Comput. Biol. Bioinform. 16(1): 52-62 (2019) - 2018
- [b1]Tom Hartmann:
Models and Algorithms for Sorting Permutations with Tandem Duplication and Random Loss. Leipzig University, Germany, 2018 - [j5]Tom Hartmann, Matthias Bernt, Martin Middendorf:
EqualTDRL: illustrating equivalent tandem duplication random loss rearrangements. BMC Bioinform. 19(1): 192:1-192:10 (2018) - [j4]Tom Hartmann, An-Chiang Chu, Martin Middendorf, Matthias Bernt:
Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes. IEEE ACM Trans. Comput. Biol. Bioinform. 15(1): 83-95 (2018) - [j3]Tom Hartmann, Nicolas Wieseke, Roded Sharan, Martin Middendorf, Matthias Bernt:
Genome Rearrangement with ILP. IEEE ACM Trans. Comput. Biol. Bioinform. 15(5): 1585-1593 (2018) - 2016
- [j2]Yih-Chun Cheng, Tom Hartmann, Pei-Yun Tsai, Martin Middendorf:
Population based ant colony optimization for reconstructing ECG signals. Evol. Intell. 9(3): 55-66 (2016) - [c1]Yih-Chun Cheng, Tom Hartmann, Pei-Yun Tsai, Martin Middendorf:
Population Based Ant Colony Optimization for Reconstructing ECG Signals. EvoApplications (1) 2016: 770-785 - 2015
- [j1]Nicolas Wieseke, Tom Hartmann, Matthias Bernt, Martin Middendorf:
Cophylogenetic Reconciliation with ILP. IEEE ACM Trans. Comput. Biol. Bioinform. 12(6): 1227-1235 (2015)
Coauthor Index
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 2025-01-09 13:25 CET 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:
