Katharina T. Huber

	2011
35		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)
34		Katharina T. Huber, Vincent Moulton: Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets CoRR abs/1110.0728: (2011)
33		Katharina T. Huber, Leo van Iersel, Steven Kelk, Radoslaw Suchecki: A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks. IEEE/ACM Trans. Comput. Biology Bioinform. 8(3): 635-649 (2011)
32		Katharina T. Huber, Andreas Spillner, Radoslaw Suchecki, Vincent Moulton: Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds. IEEE/ACM Trans. Comput. Biology Bioinform. 8(4): 1029-1040 (2011)
31		Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton: Blocks and Cut Vertices of the Buneman Graph. SIAM J. Discrete Math. 25(4): 1902-1919 (2011)
	2010
30		Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner: An Algorithm for Computing Cutpoints in Finite Metric Spaces. J. Classification 27(2): 158-172 (2010)
29		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)
	2009
28		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)
27		Martin Lott, Andreas Spillner, Katharina T. Huber, Vincent Moulton: PADRE: a package for analyzing and displaying reticulate evolution. Bioinformatics 25(9): 1199-1200 (2009)
26		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)
25		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. Biology Bioinform. 6(1): 110-117 (2009)
	2008
24		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)
23		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)
22		Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner: Characterizing Cell-Decomposable Metrics. Electr. J. Comb. 15(1): (2008)
21		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)
20		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)
19		Katharina T. Huber, Martin Lott, Vincent Moulton, Andreas Spillner: The Complexity of Deriving Multi-Labeled Trees from Bipartitions. Journal of Computational Biology 15(6): 639-651 (2008)
	2007
18		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
	2006
17		Barbara Holland, Glenn Conner, Katharina T. Huber, Vincent Moulton: Imputing Supertrees and Supernetworks from Quartets. WABI 2006: 162
16		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)
	2005
15		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)
14		Andreas W. M. Dress, Barbara 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. Discrete Applied Mathematics 146(1): 51-73 (2005)
13		Magnus Bordewich, Katharina T. Huber, Charles Semple: Identifying phylogenetic trees. Discrete Mathematics 300(1-3): 30-43 (2005)
12		Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton: The tight span of an antipodal metric space - Part I: : Combinatorial properties. Discrete Mathematics 303(1-3): 65-79 (2005)
11		Katharina T. Huber, Vincent Moulton, Michael Anthony Steel: Four Characters Suffice to Convexly Define a Phylogenetic Tree. SIAM J. Discrete Math. 18(4): 835-843 (2005)
	2004
10		Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton: The Tight Span of an Antipodal Metric Space: Part II--Geometrical Properties. Discrete & Computational Geometry 31(4): 567-586 (2004)
9		Katharina T. Huber, Vincent Moulton, Charles Semple: Replacing cliques by stars in quasi-median graphs. Discrete Applied Mathematics 143(1-3): 194-203 (2004)
8		Katharina T. Huber: Recovering trees from well-separated multi-state characters. Discrete Mathematics 278(1-3): 151-164 (2004)
	2003
7		Dietmar Cieslik, Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton: Connectivity calculus. Appl. Math. Lett. 16(3): 395-399 (2003)
	2002
6		Hans-Jürgen Bandelt, Katharina T. Huber, Vincent Moulton: Quasi-median graphs from sets of partitions. Discrete Applied Mathematics 122(1-3): 23-35 (2002)
5		Katharina T. Huber, Vincent Moulton: The relation graph. Discrete Mathematics 244(1-3): 153-166 (2002)
4		Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton: Antipodal Metrics and Split Systems. Eur. J. Comb. 23(2): 187-200 (2002)
	2001
3		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
2		Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton: Affine Maps That Induce Polyhedral Complex Isomorphisms. Discrete & Computational Geometry 24(1): 49-60 (2000)
	1999
1		Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton: Some new perspectives regarding sparse continuous models for discrete data structures. Electronic Notes in Discrete Mathematics 2: 69-75 (1999)

Coauthor Index

1	Hans-Jürgen Bandelt	[6]
2	Magnus Bordewich	[13] [25]
3	Jaroslaw Byrka	[29]
4	Y. B. Choe	[21]
5	Dietmar Cieslik	[7]
6	Glenn Conner	[17]
7	Andreas W. M. Dress	[1] [2] [3] [4] [7] [14] [18] [20] [23] [24] [26] [28] [30] [31] [35]
8	Olivier Gascuel	[25]
9	Pawel Gawrychowski	[29]
10	Barbara Holland	[14] [17]
11	Leo van Iersel	[33]
12	Steven Kelk	[29] [33]
13	Jacobus H. Koolen (Jack H. Koolen)	[3] [10] [12] [14] [16] [18] [20] [21] [22] [23] [24] [26] [28] [30] [31]
14	Y. S. Kwon	[21]
15	Martin Lott	[19] [27]
16	Vincent Moulton	[1] [2] [3] [4] [5] [6] [7] [9] [10] [11] [12] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [30] [31] [32] [34]
17	Charles Semple	[9] [13] [15]
18	Andreas Spillner	[19] [22] [26] [27] [30] [32]
19	Mike A. Steel (Michael Anthony Steel)	[11] [15] [35]
20	Radoslaw Suchecki	[32] [33]
21	Jan Weyer-Menkhoff	[14]

Last update Sun Feb 12 22:50:56 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page