Andreas Spillner

J. Graph Algorithms Appl., 2023

2022

Order Distances and Split Systems.

[BibT_eX]

[DOI]

Order, 2022

2021

Optimal realizations and the block decomposition of a finite metric space.

[BibT_eX]

[DOI]

Katharina T. Huber

Discret. Appl. Math., 2021

2018

UPGMA and the normalized equidistant minimum evolution problem.

[BibT_eX]

[DOI]

Taoyang Wu

Theor. Comput. Sci., 2018

SPECTRE: a suite of phylogenetic tools for reticulate evolution.

[BibT_eX]

[DOI]

Bioinform., 2018

2017

When Can Splits be Drawn in the Plane?

[BibT_eX]

[DOI]

Monika Balvociute

David Bryant

SIAM J. Discret. Math., 2017

2016

The minimum evolution problem is hard: a link between tree inference and graph clustering problems.

[BibT_eX]

[DOI]

Bioinform., 2016

Characterizing block graphs in terms of their vertex-induced partitions.

[BibT_eX]

[DOI]

Australas. J Comb., 2016

2014

Fishing for minimum evolution trees with Neighbor-Nets.

[BibT_eX]

[DOI]

Sarah Bastkowski

Inf. Process. Lett., 2014

Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles.

[BibT_eX]

[DOI]

Julia Schüler

Proceedings of the Computer Science - Theory and Applications, 2014

2013

SuperQ: Computing Supernetworks from Quartets.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Searching for realizations of finite metric spaces in tight spans.

[BibT_eX]

[DOI]

Sven Herrmann

Discret. Optim., 2013

Obtaining splits from cut sets of tight spans.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Approximate proximity drawings.

[BibT_eX]

[DOI]

Comput. Geom., 2013

2012

Constructing and Drawing Regular Planar Split Networks.

[BibT_eX]

[DOI]

Binh T. Nguyen

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Vertex angle and crossing angle resolution of leveled tree drawings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Recognizing Treelike k-Dissimilarities.

[BibT_eX]

[DOI]

J. Classif., 2012

Computing evolutionary distinctiveness indices in large scale analysis.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2012

Computing a Consensus of Multilabeled Trees.

[BibT_eX]

[DOI]

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

Basic Phylogenetic Combinatorics.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-521-76832-0, 2012

2011

Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

A fixed-parameter algorithm for the minimum Manhattan network problem.

[BibT_eX]

[DOI]

J. Comput. Geom., 2011

Algorithms for Matching and Predicting Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010

An Algorithm for Computing Cutpoints in Finite Metric Spaces.

[BibT_eX]

[DOI]

J. Classif., 2010

Distinguishing between hot-spots and melting-pots of genetic diversity using haplotype connectivity.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2010

2009

Untangling a Planar Graph.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Consistency of the QNet algorithm for generating planar split networks from weighted quartets.

[BibT_eX]

[DOI]

Stefan Grünewald

Discret. Appl. Math., 2009

PADRE: a package for analyzing and displaying reticulate evolution.

[BibT_eX]

[DOI]

Bioinform., 2009

Phylogenetic diversity and the maximum coverage problem.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

Barriers in metric spaces.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

Optimizing phylogenetic diversity across two trees.

[BibT_eX]

[DOI]

Magnus Bordewich

Charles Semple

Appl. Math. Lett., 2009

Characterizing weak compatibility in terms of weighted quartets.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2009

2008

Computing Phylogenetic Diversity for Split Systems.

[BibT_eX]

[DOI]

Binh T. Nguyen

IEEE ACM Trans. Comput. Biol. Bioinform., 2008

A fixed parameter algorithm for optimal convex partitions.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

The Complexity of Deriving Multi-Labeled Trees from Bipartitions.

[BibT_eX]

[DOI]

J. Comput. Biol., 2008

A note on optimal floodlight illumination of stages.

[BibT_eX]

[DOI]

Jana Dietel

Hans-Dietrich Hecker

Inf. Process. Lett., 2008

Characterizing Cell-Decomposable Metrics.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Constructing Phylogenetic Supernetworks from Quartets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Untangling a Planar Graph.

[BibT_eX]

[DOI]

Alexander Wolff

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2007

Configurations with few crossings in topological graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Review of "Reconstructing Evolution: New mathematical and computational advances" edited by Olivier Gascuel and Mike Steel.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2007

Consistency of the Neighbor-Net Algorithm.

[BibT_eX]

[DOI]

David Bryant

Algorithms Mol. Biol., 2007

Fixed-Parameter Tractability for Non-Crossing Spanning Trees.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Takeshi Tokuyama

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2006

Minimum boundary touching tilings of polyominoes.

[BibT_eX]

[DOI]

Math. Log. Q., 2006

A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Approximation Algorithms for the Minimum Convex Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

2005

Spanning trees with few crossings in geometric and topological graphs.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Optimal convex partitions of point sets with few inner points.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points.

[BibT_eX]

Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2003

Floodlight Illumination: zur algorithmischen Komplexität und zu kombinatorischen Aspekten.

[BibT_eX]

[DOI]

PhD thesis, 2003

2002

Minimizing the Size of Vertexlights in Simple Polygons.

[BibT_eX]

[DOI]