default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatharina T. Huber
Person information
- affiliation: University of East Anglia, UK
- affiliation (former): Uppsala University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j63]Katharina T. Huber, Leo van Iersel, Vincent Moulton
, Guillaume E. Scholz:
Is this network proper forest-based? Inf. Process. Lett. 187: 106500 (2025)- 2024
- [j62]Katharina T. Huber, Simone Linz, Vincent Moulton, Charles Semple:
Phylogenetic Trees Defined by at Most Three Characters. Electron. J. Comb. 31(4) (2024) - [j61]Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple:
Orienting undirected phylogenetic networks. J. Comput. Syst. Sci. 140: 103480 (2024) - [j60]Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz:
Shared Ancestry Graphs and Symbolic Arboreal Maps. SIAM J. Discret. Math. 38(4): 2553-2577 (2024) - [i15]Katharina T. Huber, Leo van Iersel, Mark Jones, Vincent Moulton, Leonie Veenema-Nipius:
Encoding Semi-Directed Phylogenetic Networks with Quarnets. CoRR abs/2408.12997 (2024) - 2023
- [j59]Andrew R. Francis, Katharina T. Huber, Vincent Moulton, Taoyang Wu:
Encoding and ordering X-cactuses. Adv. Appl. Math. 142: 102414 (2023) - [j58]David Bryant, Katharina T. Huber, Vincent Moulton, Paul F. Tupper:
Diversities and the Generalized Circumradius. Discret. Comput. Geom. 70(4): 1862-1883 (2023) - [j57]Marc Hellmuth, Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz, Peter F. Stadler:
Injective Split Systems. Graphs Comb. 39(4): 65 (2023) - [j56]Katharina T. Huber, Vincent Moulton, Andreas Spillner:
Computing consensus networks for collections of 1-nested phylogenetic networks. J. Graph Algorithms Appl. 27(7): 541-563 (2023) - [i14]Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz:
Shared ancestry graphs and symbolic arboreal maps. CoRR abs/2308.06139 (2023) - 2022
- [j55]Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami:
Level-2 networks from shortest and longest distances. Discret. Appl. Math. 306: 138-165 (2022) - [j54]Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz:
Overlaid species forests. Discret. Appl. Math. 309: 110-122 (2022) - 2021
- [j53]Katharina T. Huber, Vincent Moulton, Andreas Spillner:
Optimal realizations and the block decomposition of a finite metric space. Discret. Appl. Math. 302: 103-113 (2021) - [c6]Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor:
Invited Talks. CIAC 2021: 3-19 - [c5]Katharina T. Huber:
Phylogenetic Networks, A Way to Cope with Complex Evolutionary Processes. CIAC 2021: 18 - 2020
- [j52]Katharina T. Huber, Guillaume E. Scholz:
Phylogenetic networks that are their own fold-ups. Adv. Appl. Math. 113 (2020) - [j51]Mattéo Delabre, Nadia El-Mabrouk, Katharina T. Huber, Manuel Lafond, Vincent Moulton, Emmanuel Noutahi, Miguel Sautie Castellanos:
Evolution through segmental duplications and losses: a Super-Reconciliation approach. Algorithms Mol. Biol. 15(1): 12 (2020) - [j50]Momoko Hayamizu, Katharina T. Huber, Vincent Moulton, Yukihiro Murakami:
Recognizing and realizing cactus metrics. Inf. Process. Lett. 157: 105916 (2020) - [i13]Katharina T. Huber, Simone Linz, Vincent Moulton:
Weakly displaying trees in temporal tree-child network. CoRR abs/2004.02634 (2020)
2010 – 2019
- 2019
- [j49]Katharina T. Huber, Vincent Moulton, Taoyang Wu:
Hierarchies from Lowest Stable Ancestors in Nonbinary Phylogenetic Networks. J. Classif. 36(2): 200-231 (2019) - [j48]Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz:
Three-Way Symbolic Tree-Maps and Ultrametrics. J. Classif. 36(3): 513-540 (2019) - [j47]Katharina T. Huber, Jack H. Koolen, Vincent Moulton:
The polytopal structure of the tight-span of a totally split-decomposable metric. Discret. Math. 342(3): 868-878 (2019) - [j46]Manuel Lafond, Nadia El-Mabrouk, Katharina T. Huber, Vincent Moulton:
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics. Theor. Comput. Sci. 760: 15-34 (2019) - [e1]Katharina T. Huber, Dan Gusfield:
19th International Workshop on Algorithms in Bioinformatics, WABI 2019, September 8-10, 2019, Niagara Falls, NY, USA. LIPIcs 143, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-123-8 [contents] - [i12]Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple:
Rooting for phylogenetic networks. CoRR abs/1906.07430 (2019) - [i11]Momoko Hayamizu, Katharina T. Huber, Vincent Moulton, Yukihiro Murakami:
Recognizing and realizing cactus metrics. CoRR abs/1908.01524 (2019) - 2018
- [j45]Stefan Grünewald, Katharina T. Huber, Vincent Moulton, Mike A. Steel:
Combinatorial properties of triplet covers for binary trees. Adv. Appl. Math. 99: 59-82 (2018) - [j44]Katharina T. Huber, Guillaume E. Scholz:
Beyond Representing Orthology Relations by Trees. Algorithmica 80(1): 73-103 (2018) - [j43]Katharina T. Huber, Vincent Moulton, Marie-France Sagot, Blerina Sinaimeri:
Geometric medians in reconciliation spaces of phylogenetic trees. Inf. Process. Lett. 136: 96-101 (2018) - [c4]Mattéo Delabre, Nadia El-Mabrouk, Katharina T. Huber, Manuel Lafond, Vincent Moulton, Emmanuel Noutahi, Miguel Sautie Castellanos:
Reconstructing the History of Syntenies Through Super-Reconciliation. RECOMB-CG 2018: 179-195 - [i10]Manuel Lafond, Nadia El-Mabrouk, Katharina T. Huber, Vincent Moulton:
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics. CoRR abs/1803.05866 (2018) - 2017
- [j42]Katharina T. Huber, Leo van Iersel, Vincent Moulton, Céline Scornavacca, Taoyang Wu:
Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets. Algorithmica 77(1): 173-200 (2017) - [i9]Andrew R. Francis, Katharina T. Huber, Vincent Moulton:
Tree-based unrooted phylogenetic networks. CoRR abs/1704.02062 (2017) - [i8]Maribel Hernandez-Rosales, Marc Hellmuth, Nicolas Wieseke, Katharina T. Huber, Vincent Moulton, Peter F. Stadler:
From event labeled gene trees to species trees. CoRR abs/1705.04190 (2017) - [i7]Katharina T. Huber, Vincent Moulton, Charles Semple, Taoyang Wu:
Quarnet inference rules for level-1 networks. CoRR abs/1711.06720 (2017) - [i6]Magnus Bordewich, Katharina T. Huber, Vincent Moulton, Charles Semple:
Recovering tree-child networks from shortest inter-taxa distance information. CoRR abs/1711.08866 (2017) - 2016
- [j41]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
Characterizing block graphs in terms of their vertex-induced partitions. Australas. J Comb. 66: 1-9 (2016) - [i5]Katharina T. Huber, Guillaume E. Scholz:
Beyond representing orthology relations by trees. CoRR abs/1603.04632 (2016) - 2015
- [j40]Andrei-Alin Popescu, Katharina T. Huber:
PSIKO2: a fast and versatile tool to infer population stratification on various levels in GWAS. Bioinform. 31(21): 3552-3554 (2015) - [j39]Katharina T. Huber, George Kettleborough:
Distinguished Minimal Topological Lassos. SIAM J. Discret. Math. 29(2): 940-961 (2015) - 2014
- [j38]Katharina T. Huber, Mike A. Steel:
Tree Reconstruction from Triplet Cover Distances. Electron. J. Comb. 21(2): 2 (2014) - [j37]Andreas W. M. Dress, Katharina T. Huber, Mike A. Steel:
A matroid associated with a phylogenetic tree. Discret. Math. Theor. Comput. Sci. 16(2): 41-56 (2014) - [j36]Katharina T. Huber, Vincent Moulton, Charles Semple, Taoyang Wu:
Representing Partitions on Trees. SIAM J. Discret. Math. 28(3): 1152-1172 (2014) - [i4]Katharina T. Huber, Leo van Iersel, Vincent Moulton, Céline Scornavacca, Taoyang Wu:
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets. CoRR abs/1411.6804 (2014) - 2013
- [j35]Katharina T. Huber, Vincent Moulton:
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets. Algorithmica 66(3): 714-738 (2013) - 2012
- [b1]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
Basic Phylogenetic Combinatorics. Cambridge University Press 2012, ISBN 978-0-521-76832-0, pp. I-XII, 1-264 - [j34]Andrei-Alin Popescu, Katharina T. Huber, Emmanuel Paradis:
ape 3.0: New tools for distance-based phylogenetics and evolutionary analysis in R. Bioinform. 28(11): 1536-1537 (2012) - [j33]Maribel Hernandez-Rosales, Marc Hellmuth, Nicolas Wieseke, Katharina T. Huber, Vincent Moulton, Peter F. Stadler:
From event-labeled gene trees to species trees. BMC Bioinform. 13(S-19): S6 (2012) - [j32]Sven Herrmann, Katharina T. Huber, Vincent Moulton, Andreas Spillner:
Recognizing Treelike k-Dissimilarities. J. Classif. 29(3): 321-340 (2012) - [c3]Katharina T. Huber, Vincent Moulton, Andreas Spillner, Sabine Storandt, Radoslaw Suchecki:
Computing a Consensus of Multilabeled Trees. ALENEX 2012: 84-92 - 2011
- [j31]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
Blocks and Cut Vertices of the Buneman Graph. SIAM J. Discret. Math. 25(4): 1902-1919 (2011) - [j30]Katharina T. Huber, Leo van Iersel, Steven Kelk, Radoslaw Suchecki:
A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8(3): 635-649 (2011) - [j29]Katharina T. Huber, Andreas Spillner, Radoslaw Suchecki, Vincent Moulton:
Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds. IEEE ACM Trans. Comput. Biol. Bioinform. 8(4): 1029-1040 (2011) - [i3]Andreas W. M. Dress, Katharina T. Huber, Michael Anthony Steel:
'Lassoing' a phylogenetic tree I: Basic properties, shellings, and covers. CoRR abs/1102.0309 (2011) - [i2]Katharina T. Huber, Vincent Moulton:
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets. CoRR abs/1110.0728 (2011) - 2010
- [j28]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
An Algorithm for Computing Cutpoints in Finite Metric Spaces. J. Classif. 27(2): 158-172 (2010) - [j27]Jaroslaw Byrka, Pawel Gawrychowski, Katharina T. Huber, Steven Kelk:
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. J. Discrete Algorithms 8(1): 65-75 (2010)
2000 – 2009
- 2009
- [j26]Stefan Grünewald, Katharina T. Huber, Vincent Moulton, Charles Semple, Andreas Spillner:
Characterizing weak compatibility in terms of weighted quartets. Adv. Appl. Math. 42(3): 329-341 (2009) - [j25]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
A graph-theoretical invariant of topological spaces. Appl. Math. Lett. 22(2): 159-162 (2009) - [j24]Martin Lott, Andreas Spillner, Katharina T. Huber, Vincent Moulton:
PADRE: a package for analyzing and displaying reticulate evolution. Bioinform. 25(9): 1199-1200 (2009) - [j23]Magnus Bordewich, Olivier Gascuel, Katharina T. Huber, Vincent Moulton:
Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference. IEEE ACM Trans. Comput. Biol. Bioinform. 6(1): 110-117 (2009) - [i1]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
An algorithm for computing cutpoints in finite metric spaces. CoRR abs/0910.2317 (2009) - 2008
- [j22]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
Cut points in metric spaces. Appl. Math. Lett. 21(6): 545-548 (2008) - [j21]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
Block realizations of finite metrics and the tight-span construction I: The embedding theorem. Appl. Math. Lett. 21(12): 1306-1309 (2008) - [j20]Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
Characterizing Cell-Decomposable Metrics. Electron. J. Comb. 15(1) (2008) - [j19]Y. B. Choe, Katharina T. Huber, Jacobus H. Koolen, Y. S. Kwon, Vincent Moulton:
Counting vertices and cubes in median graphs of circular split systems. Eur. J. Comb. 29(2): 443-456 (2008) - [j18]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
Compatible decompositions and block realizations of finite metrics. Eur. J. Comb. 29(7): 1617-1633 (2008) - [j17]Katharina T. Huber, Martin Lott, Vincent Moulton, Andreas Spillner:
The Complexity of Deriving Multi-Labeled Trees from Bipartitions. J. Comput. Biol. 15(6): 639-651 (2008) - 2007
- [c2]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces. COCOA 2007: 4-10 - [p1]Vincent Moulton, Katharina T. Huber:
Phylogenetic networks. Mathematics of Evolution and Phylogeny 2007 - 2006
- [j16]Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
On the structure of the tight-span of a totally split-decomposable metric. Eur. J. Comb. 27(3): 461-479 (2006) - [c1]Barbara R. Holland, Glenn Conner, Katharina T. Huber, Vincent Moulton:
Imputing Supertrees and Supernetworks from Quartets. WABI 2006: 162 - 2005
- [j15]Katharina T. Huber, Vincent Moulton, Charles Semple, Mike A. Steel:
Recovering a phylogenetic tree using pairwise closure operations. Appl. Math. Lett. 18(3): 361-366 (2005) - [j14]Andreas W. M. Dress, Barbara R. Holland, Katharina T. Huber, Jack H. Koolen, Vincent Moulton, Jan Weyer-Menkhoff:
Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform. Discret. Appl. Math. 146(1): 51-73 (2005) - [j13]Magnus Bordewich, Katharina T. Huber, Charles Semple:
Identifying phylogenetic trees. Discret. Math. 300(1-3): 30-43 (2005) - [j12]Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
The tight span of an antipodal metric space - Part I: : Combinatorial properties. Discret. Math. 303(1-3): 65-79 (2005) - [j11]Katharina T. Huber, Vincent Moulton, Michael Anthony Steel:
Four Characters Suffice to Convexly Define a Phylogenetic Tree. SIAM J. Discret. Math. 18(4): 835-843 (2005) - 2004
- [j10]Katharina T. Huber, Vincent Moulton, Charles Semple:
Replacing cliques by stars in quasi-median graphs. Discret. Appl. Math. 143(1-3): 194-203 (2004) - [j9]Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
The Tight Span of an Antipodal Metric Space: Part II--Geometrical Properties. Discret. Comput. Geom. 31(4): 567-586 (2004) - [j8]Katharina T. Huber:
Recovering trees from well-separated multi-state characters. Discret. Math. 278(1-3): 151-164 (2004) - 2003
- [j7]Dietmar Cieslik, Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton:
Connectivity calculus. Appl. Math. Lett. 16(3): 395-399 (2003) - 2002
- [j6]Hans-Jürgen Bandelt, Katharina T. Huber, Vincent Moulton:
Quasi-median graphs from sets of partitions. Discret. Appl. Math. 122(1-3): 23-35 (2002) - [j5]Katharina T. Huber, Vincent Moulton:
The relation graph. Discret. Math. 244(1-3): 153-166 (2002) - [j4]Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton:
Antipodal Metrics and Split Systems. Eur. J. Comb. 23(2): 187-200 (2002) - 2001
- [j3]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
Six Points Suffice: How to Check for Metric Consistency. Eur. J. Comb. 22(4): 465-474 (2001) - 2000
- [j2]Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton:
Affine Maps That Induce Polyhedral Complex Isomorphisms. Discret. Comput. Geom. 24(1): 49-60 (2000)
1990 – 1999
- 1999
- [j1]Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton:
Some new perspectives regarding sparse continuous models for discrete data structures. Electron. Notes Discret. Math. 2: 69-75 (1999)
Coauthor Index
Jack H. Koolen
aka: Jacobus H. Koolen
aka: Jacobus H. Koolen
[j63] [j62] [j61] [j60] [i15] [j59] [j58] [j57] [j56] [i14] [j55] [j54] [j53] [j51] [j50] [i13] [j49] [j48] [j47] [j46] [i12] [i11] [j45] [j43] [c4] [i10] [j42] [i9] [i8] [i7] [i6] [j41] [j36] [i4] [j35] [b1] [j33] [j32] [c3] [j31] [j29] [i2] [j28] [j26] [j25] [j24] [j23] [i1] [j22] [j21] [j20] [j19] [j18] [j17] [c2] [p1] [j16] [c1] [j15] [j14] [j12] [j11] [j10] [j9] [j7] [j6] [j5] [j4] [j3] [j2] [j1]
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-20 22:59 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:
