Minimizing the Size of Vertexlights in Simple Polygons. - Andreas Spillner 001; Hans-Dietrich Hecker (Math. Log. Q., 2002)

Floodlight Illumination: zur algorithmischen Komplexität und zu kombinatorischen Aspekten. - Andreas Spillner 001 (2003)

A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points. - Andreas Spillner 001 (ACiD, 2005)

Optimal convex partitions of point sets with few inner points. - Andreas Spillner 001 (CCCG, 2005)

Spanning trees with few crossings in geometric and topological graphs. - Christian Knauer; Étienne Schramm; Andreas Spillner 001; Alexander Wolff 001 (EuroCG, 2005)

Approximation Algorithms for the Minimum Convex Partition Problem. - Christian Knauer; Andreas Spillner 001 (SWAT, 2006)

A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. - Christian Knauer; Andreas Spillner 001 (WG, 2006)

Minimum boundary touching tilings of polyominoes. - Andreas Spillner 001 (Math. Log. Q., 2006)

Fixed-Parameter Tractability for Non-Crossing Spanning Trees. - Magnús M. Halldórsson; Christian Knauer; Andreas Spillner 001; Takeshi Tokuyama (WADS, 2007)

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

Review of "Reconstructing Evolution: New mathematical and computational advances" edited by Olivier Gascuel and Mike Steel. - Andreas Spillner 001 (Algorithms Mol. Biol., 2007)

Configurations with few crossings in topological graphs. - Christian Knauer; Étienne Schramm; Andreas Spillner 001; Alexander Wolff 001 (Comput. Geom., 2007)

Untangling a Planar Graph. - Andreas Spillner 001; Alexander Wolff 001 (SOFSEM, 2008)

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

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

A note on optimal floodlight illumination of stages. - Jana Dietel; Hans-Dietrich Hecker; Andreas Spillner 001 (Inf. Process. Lett., 2008)

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

A fixed parameter algorithm for optimal convex partitions. - Andreas Spillner 001 (J. Discrete Algorithms, 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)

Optimizing phylogenetic diversity across two trees. - Magnus Bordewich; Charles Semple; Andreas Spillner 001 (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)

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)

Untangling a Planar Graph. - Xavier Goaoc; Jan Kratochvíl; Yoshio Okamoto; Chan-Su Shin; Andreas Spillner 001; Alexander Wolff 001 (Discret. Comput. Geom., 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)

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)

Algorithms for Matching and Predicting Trajectories. - Jochen Eisner; Stefan Funke; Andre Herbst; Andreas Spillner 001; Sabine Storandt (ALENEX, 2011)

A fixed-parameter algorithm for the minimum Manhattan network problem. - Christian Knauer; Andreas Spillner 001 (J. Comput. Geom., 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)

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)

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

Vertex angle and crossing angle resolution of leveled tree drawings. - Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Yoshio Okamoto; Andreas Spillner 001 (Inf. Process. Lett., 2012)

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

Approximate proximity drawings. - William S. Evans; Emden R. Gansner; Michael Kaufmann 001; Giuseppe Liotta; Henk Meijer; Andreas Spillner 001 (Comput. Geom., 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)

Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles. - Julia Schüler; Andreas Spillner 001 (CSR, 2014)

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

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)

When Can Splits be Drawn in the Plane? - Monika Balvociute; David Bryant; Andreas Spillner 001 (SIAM J. Discret. Math., 2017)

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

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

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

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

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

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

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

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