Andreas Spillner

61 papers A 3B 4C 2Misc 1Journal 46Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Buneman graphs, partial splits and subtree distances. Discret. Appl. Math. David Bryant, Katharina T. Huber, Vincent Moulton, Andreas Spillner
2025	J	`jnl`	Labeling and folding multi-labeled trees. CoRR Vincent Moulton, Andreas Spillner
2025	J	`jnl`	Subtree Distances, Tight Spans and Diversities. CoRR David Bryant, Katharina T. Huber, Vincent Moulton, Andreas Spillner
2024	J	`jnl`	Spaces of ranked tree-child networks. CoRR Vincent Moulton, Andreas Spillner
2023	J	`jnl`	Computing consensus networks for collections of 1-nested phylogenetic networks. J. Graph Algorithms Appl. Katharina T. Huber, Vincent Moulton, Andreas Spillner
2022	J	`jnl`	Order Distances and Split Systems. Order Vincent Moulton, Andreas Spillner
2021	J	`jnl`	Optimal realizations and the block decomposition of a finite metric space. Discret. Appl. Math. Katharina T. Huber, Vincent Moulton, Andreas Spillner
2019	J	`jnl`	Order distances and split systems. CoRR Vincent Moulton, Andreas Spillner
2018	J	`jnl`	SPECTRE: a suite of phylogenetic tools for reticulate evolution. Bioinform. Sarah Bastkowski, Daniel Mapleson, Andreas Spillner, Taoyang Wu, Monika Balvociute, Vincent Moulton
2018	J	`jnl`	UPGMA and the normalized equidistant minimum evolution problem. Theor. Comput. Sci. Vincent Moulton, Andreas Spillner, Taoyang Wu
2017	J	`jnl`	UPGMA and the normalized equidistant minimum evolution problem. CoRR Vincent Moulton, Andreas Spillner, Taoyang Wu
2017	J	`jnl`	When Can Splits be Drawn in the Plane? SIAM J. Discret. Math. Monika Balvociute, David Bryant, Andreas Spillner
2016	J	`jnl`	Characterizing block graphs in terms of their vertex-induced partitions. Australas. J Comb. Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner
2016	J	`jnl`	The minimum evolution problem is hard: a link between tree inference and graph clustering problems. Bioinform. Sarah Bastkowski, Vincent Moulton, Andreas Spillner, Taoyang Wu
2014	Misc	`conf`	Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles. CSR Julia Schüler, Andreas Spillner
2014	J	`jnl`	Fishing for minimum evolution trees with Neighbor-Nets. Inf. Process. Lett. Sarah Bastkowski, Andreas Spillner, Vincent Moulton
2013	J	`jnl`	Approximate proximity drawings. Comput. Geom. William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2013	J	`jnl`	Obtaining splits from cut sets of tight spans. Discret. Appl. Math. Andreas W. M. Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu
2013	J	`jnl`	Searching for realizations of finite metric spaces in tight spans. Discret. Optim. Sven Herrmann, Vincent Moulton, Andreas Spillner
2013	J	`jnl`	SuperQ: Computing Supernetworks from Quartets. IEEE ACM Trans. Comput. Biol. Bioinform. Stefan Grünewald, Andreas Spillner, Sarah Bastkowski, Anja Bögershausen, Vincent Moulton
2012	—	`book`	Basic Phylogenetic Combinatorics. Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner
2012	A	`conf`	Computing a Consensus of Multilabeled Trees. ALENEX Katharina T. Huber, Vincent Moulton, Andreas Spillner, Sabine Storandt, Radoslaw Suchecki
2012	J	`jnl`	Computing evolutionary distinctiveness indices in large scale analysis. Algorithms Mol. Biol. Iain Martyn, Tyler S. Kuhn, Arne O. Mooers, Vincent Moulton, Andreas Spillner
2012	J	`jnl`	Constructing and Drawing Regular Planar Split Networks. IEEE ACM Trans. Comput. Biol. Bioinform. Andreas Spillner, Binh T. Nguyen, Vincent Moulton
2012	J	`jnl`	Recognizing Treelike k-Dissimilarities. J. Classif. Sven Herrmann, Katharina T. Huber, Vincent Moulton, Andreas Spillner
2012	J	`jnl`	Vertex angle and crossing angle resolution of leveled tree drawings. Inf. Process. Lett. Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, Andreas Spillner
2011	J	`jnl`	A fixed-parameter algorithm for the minimum Manhattan network problem. J. Comput. Geom. Christian Knauer, Andreas Spillner
2011	A	`conf`	Algorithms for Matching and Predicting Trajectories. ALENEX Jochen Eisner, Stefan Funke, Andre Herbst, Andreas Spillner, Sabine Storandt
2011	A	`conf`	Approximate Proximity Drawings. GD William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2011	J	`jnl`	Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds. IEEE ACM Trans. Comput. Biol. Bioinform. Katharina T. Huber, Andreas Spillner, Radoslaw Suchecki, Vincent Moulton
2010	J	`jnl`	An Algorithm for Computing Cutpoints in Finite Metric Spaces. J. Classif. Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner
2010	J	`jnl`	Distinguishing between hot-spots and melting-pots of genetic diversity using haplotype connectivity. Algorithms Mol. Biol. Binh T. Nguyen, Andreas Spillner, Brent C. Emerson, Vincent Moulton
2009	J	`jnl`	An algorithm for computing cutpoints in finite metric spaces CoRR Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner
2009	J	`jnl`	Barriers in metric spaces. Appl. Math. Lett. Andreas W. M. Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu
2009	J	`jnl`	Characterizing weak compatibility in terms of weighted quartets. Adv. Appl. Math. Stefan Grünewald, Katharina T. Huber, Vincent Moulton, Charles Semple, Andreas Spillner
2009	J	`jnl`	Consistency of the QNet algorithm for generating planar split networks from weighted quartets. Discret. Appl. Math. Stefan Grünewald, Vincent Moulton, Andreas Spillner
2009	J	`jnl`	Optimizing phylogenetic diversity across two trees. Appl. Math. Lett. Magnus Bordewich, Charles Semple, Andreas Spillner
2009	J	`jnl`	PADRE: a package for analyzing and displaying reticulate evolution. Bioinform. Martin Lott, Andreas Spillner, Katharina T. Huber, Vincent Moulton
2009	J	`jnl`	Phylogenetic diversity and the maximum coverage problem. Appl. Math. Lett. Vincent Moulton, Andreas Spillner
2009	J	`jnl`	Untangling a Planar Graph. Discret. Comput. Geom. Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff
2008	J	`jnl`	A fixed parameter algorithm for optimal convex partitions. J. Discrete Algorithms Andreas Spillner
2008	J	`jnl`	A note on optimal floodlight illumination of stages. Inf. Process. Lett. Jana Dietel, Hans-Dietrich Hecker, Andreas Spillner
2008	J	`jnl`	Characterizing Cell-Decomposable Metrics. Electron. J. Comb. Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner
2008	J	`jnl`	Computing Phylogenetic Diversity for Split Systems. IEEE ACM Trans. Comput. Biol. Bioinform. Andreas Spillner, Binh T. Nguyen, Vincent Moulton
2008	C	`conf`	Constructing Phylogenetic Supernetworks from Quartets. WABI Stefan Grünewald, Andreas Spillner, Kristoffer Forslund, Vincent Moulton
2008	J	`jnl`	The Complexity of Deriving Multi-Labeled Trees from Bipartitions. J. Comput. Biol. Katharina T. Huber, Martin Lott, Vincent Moulton, Andreas Spillner
2008	B	`conf`	Untangling a Planar Graph. SOFSEM Andreas Spillner, Alexander Wolff
2007	J	`jnl`	Configurations with few crossings in topological graphs. Comput. Geom. Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
2007	J	`jnl`	Consistency of the Neighbor-Net Algorithm. Algorithms Mol. Biol. David Bryant, Vincent Moulton, Andreas Spillner
2007	B	`conf`	Fixed-Parameter Tractability for Non-Crossing Spanning Trees. WADS Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama
2007	J	`jnl`	Review of "Reconstructing Evolution: New mathematical and computational advances" edited by Olivier Gascuel and Mike Steel. Algorithms Mol. Biol. Andreas Spillner
2007	J	`jnl`	Untangling a Planar Graph CoRR Andreas Spillner, Alexander Wolff
2006	B	`conf`	A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. WG Christian Knauer, Andreas Spillner
2006	—	`conf`	Approximation Algorithms for the Minimum Convex Partition Problem. SWAT Christian Knauer, Andreas Spillner
2006	J	`jnl`	Minimum boundary touching tilings of polyominoes. Math. Log. Q. Andreas Spillner
2005	—	`conf`	A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points. ACiD Andreas Spillner
2005	B	`conf`	Configurations with Few Crossings in Topological Graphs. ISAAC Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
2005	—	`conf`	Optimal convex partitions of point sets with few inner points. CCCG Andreas Spillner
2005	C	`conf`	Spanning trees with few crossings in geometric and topological graphs. EuroCG Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
2003	—	`—`	Floodlight Illumination: zur algorithmischen Komplexität und zu kombinatorischen Aspekten. Andreas Spillner
2002	J	`jnl`	Minimizing the Size of Vertexlights in Simple Polygons. Math. Log. Q. Andreas Spillner, Hans-Dietrich Hecker