Andreas Spillner

ORCID

Publication Activity (10 Years)

Years Active: 2002-2023
Publications (10 Years): 10

Top Venues

Bioinform.

CoRR

Discret. Appl. Math.

IEEE ACM Trans. Comput. Biol. Bioinform.

University of Jena, Germany (PHD)

Education History

University of Jena, Germany

PHD

Publications

Katharina T. Huber, Vincent Moulton, Andreas Spillner
Computing consensus networks for collections of 1-nested phylogenetic networks. J. Graph Algorithms Appl. 27 (7) (2023)
Vincent Moulton, Andreas Spillner
Order Distances and Split Systems. Order 39 (2) (2022)
Katharina T. Huber, Vincent Moulton, Andreas Spillner
Optimal realizations and the block decomposition of a finite metric space. Discret. Appl. Math. 302 (2021)
Vincent Moulton, Andreas Spillner
Order distances and split systems. CoRR (2019)
Sarah Bastkowski, Daniel Mapleson, Andreas Spillner, Taoyang Wu, Monika Balvociute, Vincent Moulton
SPECTRE: a suite of phylogenetic tools for reticulate evolution. Bioinform. 34 (6) (2018)
Vincent Moulton, Andreas Spillner, Taoyang Wu
UPGMA and the normalized equidistant minimum evolution problem. Theor. Comput. Sci. 721 (2018)
Vincent Moulton, Andreas Spillner, Taoyang Wu
UPGMA and the normalized equidistant minimum evolution problem. CoRR (2017)
Monika Balvociute, David Bryant, Andreas Spillner
When Can Splits be Drawn in the Plane? SIAM J. Discret. Math. 31 (2) (2017)
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 (2016)
Sarah Bastkowski, Vincent Moulton, Andreas Spillner, Taoyang Wu
The minimum evolution problem is hard: a link between tree inference and graph clustering problems. Bioinform. 32 (4) (2016)
Julia Schüler, Andreas Spillner
Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles. CSR (2014)
Sarah Bastkowski, Andreas Spillner, Vincent Moulton
Fishing for minimum evolution trees with Neighbor-Nets. Inf. Process. Lett. 114 (1-2) (2014)
Sven Herrmann, Vincent Moulton, Andreas Spillner
Searching for realizations of finite metric spaces in tight spans. Discret. Optim. 10 (4) (2013)
William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
Approximate proximity drawings. Comput. Geom. 46 (6) (2013)
Andreas W. M. Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu
Obtaining splits from cut sets of tight spans. Discret. Appl. Math. 161 (10-11) (2013)
Stefan Grünewald, Andreas Spillner, Sarah Bastkowski, Anja Bögershausen, Vincent Moulton
SuperQ: Computing Supernetworks from Quartets. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (1) (2013)
Iain Martyn, Tyler S. Kuhn, Arne O. Mooers, Vincent Moulton, Andreas Spillner
Computing evolutionary distinctiveness indices in large scale analysis. Algorithms Mol. Biol. 7 (2012)
Sven Herrmann, Katharina T. Huber, Vincent Moulton, Andreas Spillner
Recognizing Treelike k-Dissimilarities. J. Classif. 29 (3) (2012)
Katharina T. Huber, Vincent Moulton, Andreas Spillner, Sabine Storandt, Radoslaw Suchecki
Computing a Consensus of Multilabeled Trees. ALENEX (2012)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, Andreas Spillner
Vertex angle and crossing angle resolution of leveled tree drawings. Inf. Process. Lett. 112 (16) (2012)
Andreas Spillner, Binh T. Nguyen, Vincent Moulton
Constructing and Drawing Regular Planar Split Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 9 (2) (2012)
Jochen Eisner, Stefan Funke, Andre Herbst, Andreas Spillner, Sabine Storandt
Algorithms for Matching and Predicting Trajectories. ALENEX (2011)
William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
Approximate Proximity Drawings. Graph Drawing (2011)
Christian Knauer, Andreas Spillner
A fixed-parameter algorithm for the minimum Manhattan network problem. J. Comput. Geom. 2 (1) (2011)
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) (2011)
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) (2010)
Binh T. Nguyen, Andreas Spillner, Brent C. Emerson, Vincent Moulton
Distinguishing between hot-spots and melting-pots of genetic diversity using haplotype connectivity. Algorithms Mol. Biol. 5 (2010)
Stefan Grünewald, Vincent Moulton, Andreas Spillner
Consistency of the QNet algorithm for generating planar split networks from weighted quartets. Discret. Appl. Math. 157 (10) (2009)
Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner
An algorithm for computing cutpoints in finite metric spaces CoRR (2009)
Vincent Moulton, Andreas Spillner
Phylogenetic diversity and the maximum coverage problem. Appl. Math. Lett. 22 (10) (2009)
Martin Lott, Andreas Spillner, Katharina T. Huber, Vincent Moulton
PADRE: a package for analyzing and displaying reticulate evolution. Bioinform. 25 (9) (2009)
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) (2009)
Magnus Bordewich, Charles Semple, Andreas Spillner
Optimizing phylogenetic diversity across two trees. Appl. Math. Lett. 22 (5) (2009)
Andreas W. M. Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu
Barriers in metric spaces. Appl. Math. Lett. 22 (8) (2009)
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff
Untangling a Planar Graph. Discret. Comput. Geom. 42 (4) (2009)
Stefan Grünewald, Andreas Spillner, Kristoffer Forslund, Vincent Moulton
Constructing Phylogenetic Supernetworks from Quartets. WABI (2008)
Andreas Spillner, Binh T. Nguyen, Vincent Moulton
Computing Phylogenetic Diversity for Split Systems. IEEE ACM Trans. Comput. Biol. Bioinform. 5 (2) (2008)
Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner
Characterizing Cell-Decomposable Metrics. Electron. J. Comb. 15 (1) (2008)
Andreas Spillner
A fixed parameter algorithm for optimal convex partitions. J. Discrete Algorithms 6 (4) (2008)
Katharina T. Huber, Martin Lott, Vincent Moulton, Andreas Spillner
The Complexity of Deriving Multi-Labeled Trees from Bipartitions. J. Comput. Biol. 15 (6) (2008)
Jana Dietel, Hans-Dietrich Hecker, Andreas Spillner
A note on optimal floodlight illumination of stages. Inf. Process. Lett. 105 (4) (2008)
Andreas Spillner, Alexander Wolff
Untangling a Planar Graph. SOFSEM (2008)
Andreas Spillner, Alexander Wolff
Untangling a Planar Graph CoRR (2007)
Andreas Spillner
Review of "Reconstructing Evolution: New mathematical and computational advances" edited by Olivier Gascuel and Mike Steel. Algorithms Mol. Biol. 2 (2007)
David Bryant, Vincent Moulton, Andreas Spillner
Consistency of the Neighbor-Net Algorithm. Algorithms Mol. Biol. 2 (2007)
Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama
Fixed-Parameter Tractability for Non-Crossing Spanning Trees. WADS (2007)
Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
Configurations with few crossings in topological graphs. Comput. Geom. 37 (2) (2007)
Christian Knauer, Andreas Spillner
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. WG (2006)
Andreas Spillner
Minimum boundary touching tilings of polyominoes. Math. Log. Q. 52 (1) (2006)
Christian Knauer, Andreas Spillner
Approximation Algorithms for the Minimum Convex Partition Problem. SWAT (2006)
Andreas Spillner
A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points. ACiD (2005)
Andreas Spillner
Optimal convex partitions of point sets with few inner points. CCCG (2005)
Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
Configurations with Few Crossings in Topological Graphs. ISAAC (2005)
Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
Spanning trees with few crossings in geometric and topological graphs. EuroCG (2005)
Andreas Spillner, Hans-Dietrich Hecker
Minimizing the Size of Vertexlights in Simple Polygons. Math. Log. Q. 48 (3) (2002)

Andreas Spillner.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andreas Spillner