Dissimilarity maps and substitution models: Some new results. - Vincent Moulton; Michael Anthony Steel; Chris Tuffley (Mathematical Hierarchies and Biology, 1996)

Analyzing and Visualizing Sequence and Distance Data Using SplitsTree. - Andreas W. M. Dress; Daniel H. Huson; Vincent Moulton (Discret. Appl. Math., 1996)

T-theory: An Overview. - Andreas W. M. Dress; Vincent Moulton; Werner F. Terhalle (Eur. J. Comb., 1996)

DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. - Jens Stoye; Vincent Moulton; Andreas W. M. Dress (Comput. Appl. Biosci., 1997)

The coherency index. - Jack H. Koolen; Vincent Moulton; Udo Tönges (Discret. Math., 1998)

Retractions of Finite Distance Functions Onto Tree Metrics. - Vincent Moulton; Mike A. Steel (Discret. Appl. Math., 1999)

Some new perspectives regarding sparse continuous models for discrete data structures. - Andreas W. M. Dress; Katharina T. Huber; Vincent Moulton (Electron. Notes Discret. Math., 1999)

Affine Maps That Induce Polyhedral Complex Isomorphisms. - Andreas W. M. Dress; Katharina T. Huber; Vincent Moulton (Discret. Comput. Geom., 2000)

On the tight span of an antipodal graph. - Oliver Goodman; Vincent Moulton (Discret. Math., 2000)

A Classification of the Six-point Prime Metrics. - Jack H. Koolen; Vincent Moulton; Udo Tönges (Eur. J. Comb., 2000)

Metrics on RNA Secondary Structures. - Vincent Moulton; Michael Zuker; Mike A. Steel; Robin Pointon; David Penny (J. Comput. Biol., 2000)

Maximal Energy Graphs. - Jack H. Koolen; Vincent Moulton (Adv. Appl. Math., 2001)

Six Points Suffice: How to Check for Metric Consistency. - Andreas W. M. Dress; Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton (Eur. J. Comb., 2001)

NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks. - David Bryant; Vincent Moulton (WABI, 2002)

Quasi-median graphs from sets of partitions. - Hans-Jürgen Bandelt; Katharina T. Huber; Vincent Moulton (Discret. Appl. Math., 2002)

The relation graph. - Katharina T. Huber; Vincent Moulton (Discret. Math., 2002)

Antipodal Metrics and Split Systems. - Andreas W. M. Dress; Katharina T. Huber; Vincent Moulton (Eur. J. Comb., 2002)

On Line Arrangements in the Hyperbolic Plane. - Andreas W. M. Dress; Jack H. Koolen; Vincent Moulton (Eur. J. Comb., 2002)

Hyperbolic Bridged Graphs. - Jack H. Koolen; Vincent Moulton (Eur. J. Comb., 2002)

On a Conjecture of Bannai and Ito: There are Finitely Many Distance-regular Graphs with Degree 5, 6 or 7. - Jack H. Koolen; Vincent Moulton (Eur. J. Comb., 2002)

Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees. - Barbara R. Holland; Vincent Moulton (WABI, 2003)

Connectivity calculus. - Dietmar Cieslik; Andreas W. M. Dress; Katharina T. Huber; Vincent Moulton (Appl. Math. Lett., 2003)

A Search for H/ACA SnoRNAs in Yeast Using MFE Secondary Structure Prediction. - Sverker Edvardsson; Paul P. Gardner; Anthony M. Poole; Michael D. Hendy; David Penny; Vincent Moulton (Bioinform., 2003)

A bound for the number of columns l(c, a, b) in the intersection array of a distance-regular graph. - Sejeong Bang; Jack H. Koolen; Vincent Moulton (Eur. J. Comb., 2003)

Addendum to "on line arrangements in the hyperbolic plane" [European J. Combin.23 (2002) 549-557]. - Andreas W. M. Dress; Jack H. Koolen; Vincent Moulton (Eur. J. Comb., 2003)

Maximal Energy Bipartite Graphs. - Jack H. Koolen; Vincent Moulton (Graphs Comb., 2003)

Peeling phylogenetic 'oranges'. - Vincent Moulton; Mike A. Steel (Adv. Appl. Math., 2004)

VisRD–visual recombination detection. - Kristoffer Forslund; Daniel H. Huson; Vincent Moulton (Bioinform., 2004)

Replacing cliques by stars in quasi-median graphs. - Katharina T. Huber; Vincent Moulton; Charles Semple (Discret. Appl. Math., 2004)

The Tight Span of an Antipodal Metric Space: Part II–Geometrical Properties. - Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton (Discret. Comput. Geom., 2004)

The structure of spherical graphs. - Jack H. Koolen; Vincent Moulton; Dragan Stevanovic (Eur. J. Comb., 2004)

Reconstructing Metabolic Networks Using Interval Analysis. - Warwick Tucker; Vincent Moulton (WABI, 2005)

Recovering a phylogenetic tree using pairwise closure operations. - Katharina T. Huber; Vincent Moulton; Charles Semple; Mike A. Steel (Appl. Math. Lett., 2005)

A comparison of RNA folding measures. - Eva Freyhult; Paul P. Gardner; Vincent Moulton (BMC Bioinform., 2005)

Unbiased descriptor and parameter selection confirms the potential of proteochemometric modelling. - Eva Freyhult; Peteris Prusis; Maris Lapinsh; Jarl E. S. Wikberg; Vincent Moulton; Mats G. Gustafsson (BMC Bioinform., 2005)

Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform. - Andreas W. M. Dress; Barbara R. Holland; Katharina T. Huber; Jack H. Koolen; Vincent Moulton; Jan Weyer-Menkhoff (Discret. Appl. Math., 2005)

The tight span of an antipodal metric space - Part I: : Combinatorial properties. - Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton (Discret. Math., 2005)

Four Characters Suffice to Convexly Define a Phylogenetic Tree. - Katharina T. Huber; Vincent Moulton; Michael Anthony Steel (SIAM J. Discret. Math., 2005)

Imputing Supertrees and Supernetworks from Quartets. - Barbara R. Holland; Glenn Conner; Katharina T. Huber; Vincent Moulton (WABI, 2006)

On the structure of the tight-span of a totally split-decomposable metric. - Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton (Eur. J. Comb., 2006)

Parameter Reconstruction for Biochemical Networks Using Interval Analysis. - Warwick Tucker; Vincent Moulton (Reliab. Comput., 2006)

Phylogenetic networks. - Vincent Moulton; Katharina T. Huber (Mathematics of Evolution and Phylogeny, 2007)

An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces. - Andreas W. M. Dress; Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton (COCOA, 2007)

Consistency of the Neighbor-Net Algorithm. - David Bryant; Vincent Moulton; Andreas Spillner 001 (Algorithms Mol. Biol., 2007)

Boltzmann probability of RNA structural neighbors and riboswitch detection. - Eva Freyhult; Vincent Moulton; Peter Clote (Bioinform., 2007)

Concerning the Relationship between Realizations and Tight Spans of Finite Metrics. - Jack H. Koolen; Alice Lesser; Vincent Moulton (Discret. Comput. Geom., 2007)

Two theorems concerning the Bannai-Ito conjecture. - Sejeong Bang; Jacobus H. Koolen; Vincent Moulton (Eur. J. Comb., 2007)

RNAbor: a web server for RNA structural neighbors. - Eva Freyhult; Vincent Moulton; Peter Clote (Nucleic Acids Res., 2007)

Time Series Data Mining Algorithms for Identifying Short RNA in Arabidopsis thaliana. - Anthony J. Bagnall; Simon Moxon; David J. Studholme; Vincent Moulton (BIOCOMP, 2008)

Constructing Phylogenetic Supernetworks from Quartets. - Stefan Grünewald; Andreas Spillner 001; Kristoffer Forslund; Vincent Moulton (WABI, 2008)

A regular decomposition of the edge-product space of phylogenetic trees. - Jonna Gill; Svante Linusson; Vincent Moulton; Mike A. Steel (Adv. Appl. Math., 2008)

A scoring matrix approach to detecting miRNA target sites. - Simon Moxon; Vincent Moulton; Jan T. Kim (Algorithms Mol. Biol., 2008)

Cut points in metric spaces. - Andreas W. M. Dress; Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton (Appl. Math. Lett., 2008)

Block realizations of finite metrics and the tight-span construction I: The embedding theorem. - Andreas W. M. Dress; Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton (Appl. Math. Lett., 2008)

A toolkit for analysing large-scale plant small RNA datasets. - Simon Moxon; Frank Schwach; Tamas Dalmay; Daniel MacLean; David J. Studholme; Vincent Moulton (Bioinform., 2008)

Characterizing Cell-Decomposable Metrics. - Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton; Andreas Spillner 001 (Electron. J. Comb., 2008)

Counting vertices and cubes in median graphs of circular split systems. - Y. B. Choe; Katharina T. Huber; Jacobus H. Koolen; Y. S. Kwon; Vincent Moulton (Eur. J. Comb., 2008)

Compatible decompositions and block realizations of finite metrics. - Andreas W. M. Dress; Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton (Eur. J. Comb., 2008)

The Complexity of Deriving Multi-Labeled Trees from Bipartitions. - Katharina T. Huber; Martin Lott; Vincent Moulton; Andreas Spillner 001 (J. Comput. Biol., 2008)

Computing Phylogenetic Diversity for Split Systems. - Andreas Spillner 001; Binh T. Nguyen 002; Vincent Moulton (IEEE ACM Trans. Comput. Biol. Bioinform., 2008)

Characterizing weak compatibility in terms of weighted quartets. - Stefan Grünewald; Katharina T. Huber; Vincent Moulton; Charles Semple; Andreas Spillner 001 (Adv. Appl. Math., 2009)

A graph-theoretical invariant of topological spaces. - Andreas W. M. Dress; Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton (Appl. Math. Lett., 2009)

Barriers in metric spaces. - Andreas W. M. Dress; Vincent Moulton; Andreas Spillner 001; Taoyang Wu (Appl. Math. Lett., 2009)

Phylogenetic diversity and the maximum coverage problem. - Vincent Moulton; Andreas Spillner 001 (Appl. Math. Lett., 2009)

PADRE: a package for analyzing and displaying reticulate evolution. - Martin Lott; Andreas Spillner 001; Katharina T. Huber; Vincent Moulton (Bioinform., 2009)

Identifying recombinants in human and primate immunodeficiency virus sequence alignments using quartet scanning. - Philippe Lemey; Martin Lott; Darren P. Martin; Vincent Moulton (BMC Bioinform., 2009)

Consistency of the QNet algorithm for generating planar split networks from weighted quartets. - Stefan Grünewald; Vincent Moulton; Andreas Spillner 001 (Discret. Appl. Math., 2009)

Optimal realizations of generic five-point metrics. - Jack H. Koolen; Alice Lesser; Vincent Moulton (Eur. J. Comb., 2009)

Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference. - Magnus Bordewich; Olivier Gascuel; Katharina T. Huber; Vincent Moulton (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Maximum Parsimony for Tree Mixtures. - Stefan Grünewald; Vincent Moulton (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Special Section: Phylogenetics. - Daniel H. Huson; Vincent Moulton; Mike A. Steel (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Refining Phylogenetic Trees Given Additional Data: An Algorithm Based on Parsimony. - Taoyang Wu; Vincent Moulton; Mike A. Steel (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Distinguishing between hot-spots and melting-pots of genetic diversity using haplotype connectivity. - Binh T. Nguyen 002; Andreas Spillner 001; Brent C. Emerson; Vincent Moulton (Algorithms Mol. Biol., 2010)

RDP3: a flexible and fast computer program for analyzing recombination. - Darren P. Martin; Philippe Lemey; Martin Lott; Vincent Moulton; David Posada; Pierre Lefeuvre (Bioinform., 2010)

Finding sRNA generative locales from high-throughput sequencing data with NiBLS. - Daniel MacLean; Vincent Moulton; David J. Studholme (BMC Bioinform., 2010)

An Algorithm for Computing Cutpoints in Finite Metric Spaces. - Andreas W. M. Dress; Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton; Andreas Spillner 001 (J. Classif., 2010)

The 'Butterfly effect' in Cayley graphs, and its relevance for evolutionary genomics - Vincent Moulton; Mike A. Steel (CoRR, 2011)

Identifying and Reconstructing Lateral Transfers from Distance Matrices by Combining the Minimum Contradiction Method and Neighbor-Net. - Marc Thuillard; Vincent Moulton (J. Bioinform. Comput. Biol., 2011)

Blocks and Cut Vertices of the Buneman Graph. - Andreas W. M. Dress; Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton (SIAM J. Discret. Math., 2011)

Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds. - Katharina T. Huber; Andreas Spillner 001; Radoslaw Suchecki; Vincent Moulton (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Basic Phylogenetic Combinatorics. - Andreas W. M. Dress; Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton; Andreas Spillner 001 (Cambridge University Press, 2012)

Computing a Consensus of Multilabeled Trees. - Katharina T. Huber; Vincent Moulton; Andreas Spillner 001; Sabine Storandt; Radoslaw Suchecki (ALENEX, 2012)

The split decomposition of a k-dissimilarity map. - Sven Herrmann; Vincent Moulton (Adv. Appl. Math., 2012)

Computational Modeling of the Regulatory Network Organizing the Wound Response in Arabidopsis thaliana. - Jan T. Kim; Anyela Camargo; Alessandra Devoto; Vincent Moulton; John Turner (Artif. Life, 2012)

Computing evolutionary distinctiveness indices in large scale analysis. - Iain Martyn; Tyler S. Kuhn; Arne O. Mooers; Vincent Moulton; Andreas Spillner 001 (Algorithms Mol. Biol., 2012)

The UEA sRNA workbench: a suite of tools for analysing and visualizing next generation sequencing microRNA and small RNA datasets. - Matthew B. Stocks; Simon Moxon; Daniel Mapleson; Hugh C. Woolfenden; Irina Mohorianu; Leighton Folkes; Frank Schwach; Tamas Dalmay; Vincent Moulton (Bioinform., 2012)

From event-labeled gene trees to species trees. - Maribel Hernandez-Rosales; Marc Hellmuth; Nicolas Wieseke; Katharina T. Huber; Vincent Moulton; Peter F. Stadler (BMC Bioinform., 2012)

Recognizing Treelike k-Dissimilarities. - Sven Herrmann; Katharina T. Huber; Vincent Moulton; Andreas Spillner 001 (J. Classif., 2012)

Trees, tight-spans and point configurations. - Sven Herrmann; Vincent Moulton (Discret. Math., 2012)

Injective optimal realizations of finite metric spaces. - Jack H. Koolen; Alice Lesser; Vincent Moulton; Taoyang Wu (Discret. Math., 2012)

Constructing and Drawing Regular Planar Split Networks. - Andreas Spillner 001; Binh T. Nguyen 002; Vincent Moulton (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

FiRePat - Finding Regulatory Patterns between sRNAs and Genes. - Irina Mohorianu; Sara Lopez-Gomollon; Frank Schwach; Tamas Dalmay; Vincent Moulton (WIREs Data Mining Knowl. Discov., 2012)

Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets. - Katharina T. Huber; Vincent Moulton (Algorithmica, 2013)

Generating functions for multi-labeled trees. - Éva Czabarka; Péter L. Erdös; Virginia Johnson; Vincent Moulton (Discret. Appl. Math., 2013)

Obtaining splits from cut sets of tight spans. - Andreas W. M. Dress; Vincent Moulton; Andreas Spillner 001; Taoyang Wu (Discret. Appl. Math., 2013)

Searching for realizations of finite metric spaces in tight spans. - Sven Herrmann; Vincent Moulton; Andreas Spillner 001 (Discret. Optim., 2013)

SuperQ: Computing Supernetworks from Quartets. - Stefan Grünewald; Andreas Spillner 001; Sarah Bastkowski; Anja Bögershausen; Vincent Moulton (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

Computing the blocks of a quasi-median graph. - Sven Herrmann; Vincent Moulton (Discret. Appl. Math., 2014)

Fishing for minimum evolution trees with Neighbor-Nets. - Sarah Bastkowski; Andreas Spillner 001; Vincent Moulton (Inf. Process. Lett., 2014)

Representing Partitions on Trees. - Katharina T. Huber; Vincent Moulton; Charles Semple; Taoyang Wu (SIAM J. Discret. Math., 2014)

A parsimony-based metric for phylogenetic trees. - Vincent Moulton; Taoyang Wu (Adv. Appl. Math., 2015)

Optimal realizations of two-dimensional, totally-decomposable metrics. - Sven Herrmann; Jack H. Koolen; Alice Lesser; Vincent Moulton; Taoyang Wu (Discret. Math., 2015)

Characterizing block graphs in terms of their vertex-induced partitions. - Andreas W. M. Dress; Katharina T. Huber; Jacobus H. Koolen; Vincent Moulton; Andreas Spillner 001 (Australas. J Comb., 2016)

The minimum evolution problem is hard: a link between tree inference and graph clustering problems. - Sarah Bastkowski; Vincent Moulton; Andreas Spillner 001; Taoyang Wu (Bioinform., 2016)

Reduction rules for the maximum parsimony distance on phylogenetic trees. - Steven Kelk; Mareike Fischer 001; Vincent Moulton; Taoyang Wu (Theor. Comput. Sci., 2016)

Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets. - Katharina T. Huber; Leo van Iersel; Vincent Moulton; Céline Scornavacca; Taoyang Wu (Algorithmica, 2017)

miRCat2: accurate prediction of plant and animal microRNAs from next-generation sequencing datasets. - Claudia Paicu; Irina Mohorianu; Matthew B. Stocks; Ping Xu; Aurore Coince; Martina Billmeier; Tamas Dalmay; Vincent Moulton; Simon Moxon (Bioinform., 2017)

Tree-based unrooted phylogenetic networks. - Andrew R. Francis; Katharina T. Huber; Vincent Moulton (CoRR, 2017)

Binets: fundamental building blocks for phylogenetic networks. - Leo van Iersel; Vincent Moulton; Eveline de Swart; Taoyang Wu (CoRR, 2017)

Quarnet inference rules for level-1 networks. - Katharina T. Huber; Vincent Moulton; Charles Semple; Taoyang Wu (CoRR, 2017)

Recovering tree-child networks from shortest inter-taxa distance information. - Magnus Bordewich; Katharina T. Huber; Vincent Moulton; Charles Semple (CoRR, 2017)

A cubic-time algorithm for computing the trinet distance between level-1 networks. - Vincent Moulton; James Oldman; Taoyang Wu (Inf. Process. Lett., 2017)

Reconstructing the History of Syntenies Through Super-Reconciliation. - Mattéo Delabre; Nadia El-Mabrouk; Katharina T. Huber; Manuel Lafond; Vincent Moulton; Emmanuel Noutahi; Miguel Sautie Castellanos (RECOMB-CG, 2018)

Combinatorial properties of triplet covers for binary trees. - Stefan Grünewald; Katharina T. Huber; Vincent Moulton; Mike A. Steel (Adv. Appl. Math., 2018)

SPECTRE: a suite of phylogenetic tools for reticulate evolution. - Sarah Bastkowski; Daniel Mapleson; Andreas Spillner 001; Taoyang Wu; Monika Balvociute; Vincent Moulton (Bioinform., 2018)

The UEA sRNA Workbench (version 4.4): a comprehensive suite of tools for analyzing miRNAs and sRNAs. - Matthew B. Stocks; Irina Mohorianu; Matthew Beckers; Claudia Paicu; Simon Moxon; Joshua Thody; Tamas Dalmay; Vincent Moulton (Bioinform., 2018)

Geometric medians in reconciliation spaces of phylogenetic trees. - Katharina T. Huber; Vincent Moulton; Marie-France Sagot; Blerina Sinaimeri (Inf. Process. Lett., 2018)

Leaf-Reconstructibility of Phylogenetic Networks. - Leo van Iersel; Vincent Moulton (SIAM J. Discret. Math., 2018)

UPGMA and the normalized equidistant minimum evolution problem. - Vincent Moulton; Andreas Spillner 001; Taoyang Wu (Theor. Comput. Sci., 2018)

Three-Way Symbolic Tree-Maps and Ultrametrics. - Katharina T. Huber; Vincent Moulton; Guillaume E. Scholz (J. Classif., 2019)

Hierarchies from Lowest Stable Ancestors in Nonbinary Phylogenetic Networks. - Katharina T. Huber; Vincent Moulton; Taoyang Wu (J. Classif., 2019)

Rooting for phylogenetic networks. - Katharina T. Huber; Leo van Iersel; Remie Janssen; Mark Jones 001; Vincent Moulton; Yukihiro Murakami; Charles Semple (CoRR, 2019)

The polytopal structure of the tight-span of a totally split-decomposable metric. - Katharina T. Huber; Jack H. Koolen; Vincent Moulton (Discret. Math., 2019)

The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics. - Manuel Lafond; Nadia El-Mabrouk; Katharina T. Huber; Vincent Moulton (Theor. Comput. Sci., 2019)

Reconstructibility of unrooted level-k phylogenetic networks from distances. - Leo van Iersel; Vincent Moulton; Yukihiro Murakami (Adv. Appl. Math., 2020)

Evolution through segmental duplications and losses: a Super-Reconciliation approach. - Mattéo Delabre; Nadia El-Mabrouk; Katharina T. Huber; Manuel Lafond; Vincent Moulton; Emmanuel Noutahi; Miguel Sautie Castellanos (Algorithms Mol. Biol., 2020)

Weakly displaying trees in temporal tree-child network. - Katharina T. Huber; Simone Linz; Vincent Moulton (CoRR, 2020)

Recognizing and realizing cactus metrics. - Momoko Hayamizu; Katharina T. Huber; Vincent Moulton; Yukihiro Murakami (Inf. Process. Lett., 2020)

Optimal realizations and the block decomposition of a finite metric space. - Katharina T. Huber; Vincent Moulton; Andreas Spillner 001 (Discret. Appl. Math., 2021)

Level-2 networks from shortest and longest distances. - Katharina T. Huber; Leo van Iersel; Remie Janssen; Mark Jones 001; Vincent Moulton; Yukihiro Murakami (Discret. Appl. Math., 2022)

Overlaid species forests. - Katharina T. Huber; Vincent Moulton; Guillaume E. Scholz (Discret. Appl. Math., 2022)

An algorithm for reconstructing level-2 phylogenetic networks from trinets. - Leo van Iersel; Sjors Kole; Vincent Moulton; Leonie Nipius (Inf. Process. Lett., 2022)

Order Distances and Split Systems. - Vincent Moulton; Andreas Spillner 001 (Order, 2022)

Posets and Spaces of $k$-Noncrossing RNA Structures. - Vincent Moulton; Taoyang Wu (SIAM J. Discret. Math., 2022)

Degradome Assisted Plant MicroRNA Prediction Under Alternative Annotation Criteria. - Salma Alzahrani; Christopher Applegate; David Swarbreck; Tamas Dalmay; Leighton Folkes; Vincent Moulton (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

Encoding and ordering X-cactuses. - Andrew R. Francis; Katharina T. Huber; Vincent Moulton; Taoyang Wu (Adv. Appl. Math., 2023)

Computing consensus networks for collections of 1-nested phylogenetic networks. - Katharina T. Huber; Vincent Moulton; Andreas Spillner 001 (J. Graph Algorithms Appl., 2023)

Planar Rooted Phylogenetic Networks. - Vincent Moulton; Taoyang Wu (IEEE ACM Trans. Comput. Biol. Bioinform., 2023)

Planar median graphs and cubesquare-graphs. - Carsten R. Seemann; Vincent Moulton; Peter F. Stadler; Marc Hellmuth (Discret. Appl. Math., 2023)

Injective Split Systems. - Marc Hellmuth; Katharina T. Huber; Vincent Moulton; Guillaume E. Scholz; Peter F. Stadler (Graphs Comb., 2023)

Polynomial invariants for cactuses. - Leo van Iersel; Vincent Moulton; Yukihiro Murakami (Inf. Process. Lett., 2023)

Diversities and the Generalized Circumradius. - David Bryant; Katharina T. Huber; Vincent Moulton; Paul F. Tupper (Discret. Comput. Geom., 2023)

Phylogenetic Trees Defined by at Most Three Characters. - Katharina T. Huber; Simone Linz; Vincent Moulton; Charles Semple (Electron. J. Comb., 2024)

Compatible Split Systems on a Multiset. - Vincent Moulton; Guillaume E. Scholz (Electron. J. Comb., 2024)

Encoding Semi-Directed Phylogenetic Networks with Quarnets. - Katharina T. Huber; Leo van Iersel; Mark Jones 001; Vincent Moulton; Leonie Veenema-Nipius (CoRR, 2024)

Spaces of ranked tree-child networks. - Vincent Moulton; Andreas Spillner 001 (CoRR, 2024)

Shared Ancestry Graphs and Symbolic Arboreal Maps. - Katharina T. Huber; Vincent Moulton; Guillaume E. Scholz (SIAM J. Discret. Math., 2024)

Orienting undirected phylogenetic networks. - Katharina T. Huber; Leo van Iersel; Remie Janssen; Mark Jones 001; Vincent Moulton; Yukihiro Murakami; Charles Semple (J. Comput. Syst. Sci., 2024)

Buneman graphs, partial splits and subtree distances. - David Bryant; Katharina T. Huber; Vincent Moulton; Andreas Spillner 001 (Discret. Appl. Math., 2025)

Cherry picking in forests: A new characterization for the unrooted hybrid number of two phylogenetic trees. - Katharina T. Huber; Simone Linz; Vincent Moulton (Discret. Math. Theor. Comput. Sci., 2025)

Is this network proper forest-based? - Katharina T. Huber; Leo van Iersel; Vincent Moulton; Guillaume E. Scholz (Inf. Process. Lett., 2025)

Path partitions of phylogenetic networks. - Manuel Lafond; Vincent Moulton (Theor. Comput. Sci., 2025)

Subtree Distances, Tight Spans and Diversities. - David Bryant; Katharina T. Huber; Vincent Moulton; Andreas Spillner 001 (CoRR, 2025)

Coconvex characters on collections of phylogenetic trees. - Éva Czabarka; Steven Kelk; Vincent Moulton; László A. Székely (Adv. Appl. Math., 2026)