The following pages link to Andreas Spillner (Q263275):
Displayed 44 items.
- An algorithm for computing cutpoints in finite metric spaces (Q263276) (← links)
- Recognizing treelike \(k\)-dissimilarities (Q263358) (← links)
- Vertex angle and crossing angle resolution of leveled tree drawings (Q456065) (← links)
- Phylogenetic diversity and the maximum coverage problem (Q735104) (← links)
- Configurations with few crossings in topological graphs (Q876504) (← links)
- A fixed parameter algorithm for optimal convex partitions (Q1002101) (← links)
- Characterizing cell-decomposable metrics (Q1010659) (← links)
- Characterizing weak compatibility in terms of weighted quartets (Q1012157) (← links)
- Optimizing phylogenetic diversity across two trees (Q1021786) (← links)
- Item:Q263275 (redirect page) (← links)
- Consistency of the QNet algorithm for generating planar split networks from weighted quartets (Q1026188) (← links)
- Barriers in metric spaces (Q1033051) (← links)
- Untangling a planar graph (Q1042455) (← links)
- UPGMA and the normalized equidistant minimum evolution problem (Q1704587) (← links)
- Searching for realizations of finite metric spaces in tight spans (Q1799387) (← links)
- Approximate proximity drawings (Q1947972) (← links)
- Optimal realizations and the block decomposition of a finite metric space (Q2043363) (← links)
- Order distances and split systems (Q2160024) (← links)
- Fishing for minimum evolution trees with neighbor-nets (Q2350587) (← links)
- Neighborhoods of trees in circular orderings (Q2352433) (← links)
- A note on optimal floodlight illumination of stages (Q2380057) (← links)
- Obtaining splits from cut sets of tight spans (Q2446320) (← links)
- Optimal algorithms for computing edge weights in planar split networks (Q2511048) (← links)
- (Q2968082) (← links)
- Approximate Proximity Drawings (Q3223952) (← links)
- Minimum boundary touching tilings of polyominoes (Q3376538) (← links)
- A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators (Q3522941) (← links)
- Basic Phylogenetic Combinatorics (Q3559176) (← links)
- Fixed-Parameter Tractability for Non-Crossing Spanning Trees (Q3603545) (← links)
- (Q4530156) (← links)
- (Q4549762) (← links)
- (Q4549764) (← links)
- Characterizing Block Graphs in Terms of their Vertex-Induced Partitions (Q4594182) (← links)
- (Q4671957) (← links)
- Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles (Q4981173) (← links)
- Algorithms for Matching and Predicting Trajectories (Q5233702) (← links)
- Computing a consensus of multilabeled trees (Q5233721) (← links)
- When Can Splits be Drawn in the Plane? (Q5346560) (← links)
- Untangling a Planar Graph (Q5448674) (← links)
- Approximation Algorithms for the Minimum Convex Partition Problem (Q5757909) (← links)
- Algorithms and Computation (Q5897893) (← links)
- Computing consensus networks for collections of 1-nested phylogenetic networks (Q6075713) (← links)
- The space of equidistant phylogenetic cactuses (Q6192063) (← links)
- Order distances and split systems (Q6327697) (← links)