Katharina T. Huber

Orcid: 0000-0002-6368-7511

Affiliations:
  • University of East Anglia, UK
  • Uppsala University, Sweden (former)


According to our database1, Katharina T. Huber authored at least 77 papers between 1999 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Is this network proper forest-based?
Inf. Process. Lett., 2025

2024
Orienting undirected phylogenetic networks.
J. Comput. Syst. Sci., March, 2024

Shared Ancestry Graphs and Symbolic Arboreal Maps.
SIAM J. Discret. Math., 2024

Encoding Semi-Directed Phylogenetic Networks with Quarnets.
CoRR, 2024

2023
Diversities and the Generalized Circumradius.
Discret. Comput. Geom., December, 2023

Injective Split Systems.
Graphs Comb., August, 2023

Computing consensus networks for collections of 1-nested phylogenetic networks.
J. Graph Algorithms Appl., 2023

Encoding and ordering <i>X</i>-cactuses.
Adv. Appl. Math., 2023

2022
Overlaid species forests.
Discret. Appl. Math., 2022

Level-2 networks from shortest and longest distances.
Discret. Appl. Math., 2022

2021
Optimal realizations and the block decomposition of a finite metric space.
Discret. Appl. Math., 2021

Invited Talks.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

Phylogenetic Networks, A Way to Cope with Complex Evolutionary Processes.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
Recognizing and realizing cactus metrics.
Inf. Process. Lett., 2020

Weakly displaying trees in temporal tree-child network.
CoRR, 2020

Evolution through segmental duplications and losses: a Super-Reconciliation approach.
Algorithms Mol. Biol., 2020

Phylogenetic networks that are their own fold-ups.
Adv. Appl. Math., 2020

2019
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics.
Theor. Comput. Sci., 2019

The polytopal structure of the tight-span of a totally split-decomposable metric.
Discret. Math., 2019

Rooting for phylogenetic networks.
CoRR, 2019

Hierarchies from Lowest Stable Ancestors in Nonbinary Phylogenetic Networks.
J. Classif., 2019

Three-Way Symbolic Tree-Maps and Ultrametrics.
J. Classif., 2019

2018
Geometric medians in reconciliation spaces of phylogenetic trees.
Inf. Process. Lett., 2018

Beyond Representing Orthology Relations by Trees.
Algorithmica, 2018

Combinatorial properties of triplet covers for binary trees.
Adv. Appl. Math., 2018

Reconstructing the History of Syntenies Through Super-Reconciliation.
Proceedings of the Comparative Genomics - 16th International Conference, 2018

2017
Recovering tree-child networks from shortest inter-taxa distance information.
CoRR, 2017

Quarnet inference rules for level-1 networks.
CoRR, 2017

Tree-based unrooted phylogenetic networks.
CoRR, 2017

Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets.
Algorithmica, 2017

2016
Characterizing block graphs in terms of their vertex-induced partitions.
Australas. J Comb., 2016

2015
Distinguished Minimal Topological Lassos.
SIAM J. Discret. Math., 2015

PSIKO2: a fast and versatile tool to infer population stratification on various levels in GWAS.
Bioinform., 2015

2014
Representing Partitions on Trees.
SIAM J. Discret. Math., 2014

A matroid associated with a phylogenetic tree.
Discret. Math. Theor. Comput. Sci., 2014

Tree Reconstruction from Triplet Cover Distances.
Electron. J. Comb., 2014

2013
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets.
Algorithmica, 2013

2012
Recognizing Treelike k-Dissimilarities.
J. Classif., 2012

From event-labeled gene trees to species trees.
BMC Bioinform., 2012

ape 3.0: New tools for distance-based phylogenetics and evolutionary analysis in R.
Bioinform., 2012

Computing a Consensus of Multilabeled Trees.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

Basic Phylogenetic Combinatorics.
Cambridge University Press, ISBN: 978-0-521-76832-0, 2012

2011
Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Blocks and Cut Vertices of the Buneman Graph.
SIAM J. Discret. Math., 2011

'Lassoing' a phylogenetic tree I: Basic properties, shellings, and covers
CoRR, 2011

2010
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks.
J. Discrete Algorithms, 2010

An Algorithm for Computing Cutpoints in Finite Metric Spaces.
J. Classif., 2010

2009
Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

PADRE: a package for analyzing and displaying reticulate evolution.
Bioinform., 2009

A graph-theoretical invariant of topological spaces.
Appl. Math. Lett., 2009

Characterizing weak compatibility in terms of weighted quartets.
Adv. Appl. Math., 2009

2008
The Complexity of Deriving Multi-Labeled Trees from Bipartitions.
J. Comput. Biol., 2008

Compatible decompositions and block realizations of finite metrics.
Eur. J. Comb., 2008

Counting vertices and cubes in median graphs of circular split systems.
Eur. J. Comb., 2008

Characterizing Cell-Decomposable Metrics.
Electron. J. Comb., 2008

Block realizations of finite metrics and the tight-span construction I: The embedding theorem.
Appl. Math. Lett., 2008

Cut points in metric spaces.
Appl. Math. Lett., 2008

2007
An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces.
Proceedings of the Combinatorial Optimization and Applications, 2007

Phylogenetic networks.
Proceedings of the Mathematics of Evolution and Phylogeny., 2007

2006
On the structure of the tight-span of a totally split-decomposable metric.
Eur. J. Comb., 2006

Imputing Supertrees and Supernetworks from Quartets.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

2005
Four Characters Suffice to Convexly Define a Phylogenetic Tree.
SIAM J. Discret. Math., 2005

The tight span of an antipodal metric space - Part I: : Combinatorial properties.
Discret. Math., 2005

Identifying phylogenetic trees.
Discret. Math., 2005

Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform.
Discret. Appl. Math., 2005

Recovering a phylogenetic tree using pairwise closure operations.
Appl. Math. Lett., 2005

2004
Recovering trees from well-separated multi-state characters.
Discret. Math., 2004

The Tight Span of an Antipodal Metric Space: Part II--Geometrical Properties.
Discret. Comput. Geom., 2004

Replacing cliques by stars in quasi-median graphs.
Discret. Appl. Math., 2004

2003
Connectivity calculus.
Appl. Math. Lett., 2003

2002
Antipodal Metrics and Split Systems.
Eur. J. Comb., 2002

The relation graph.
Discret. Math., 2002

Quasi-median graphs from sets of partitions.
Discret. Appl. Math., 2002

2001
Six Points Suffice: How to Check for Metric Consistency.
Eur. J. Comb., 2001

2000
Affine Maps That Induce Polyhedral Complex Isomorphisms.
Discret. Comput. Geom., 2000

1999
Some new perspectives regarding sparse continuous models for discrete data structures.
Electron. Notes Discret. Math., 1999


  Loading...