default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Spillner 0001
Person information
- affiliation: Greifswald University, Germany
Other persons with the same name
- Andreas Spillner 0002 — Hochschule Bremen, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j38]Katharina T. Huber, Vincent Moulton
, Andreas Spillner:
Computing consensus networks for collections of 1-nested phylogenetic networks. J. Graph Algorithms Appl. 27(7): 541-563 (2023)- 2022
- [j37]Vincent Moulton, Andreas Spillner:
Order Distances and Split Systems. Order 39(2): 291-308 (2022) - 2021
- [j36]Katharina T. Huber, Vincent Moulton, Andreas Spillner:
Optimal realizations and the block decomposition of a finite metric space. Discret. Appl. Math. 302: 103-113 (2021)
2010 – 2019
- 2019
- [i5]Vincent Moulton, Andreas Spillner:
Order distances and split systems. CoRR abs/1910.10119 (2019) - 2018
- [j35]Sarah Bastkowski, Daniel Mapleson, Andreas Spillner, Taoyang Wu, Monika Balvociute, Vincent Moulton:
SPECTRE: a suite of phylogenetic tools for reticulate evolution. Bioinform. 34(6): 1056-1057 (2018) - [j34]Vincent Moulton, Andreas Spillner, Taoyang Wu:
UPGMA and the normalized equidistant minimum evolution problem. Theor. Comput. Sci. 721: 1-15 (2018) - 2017
- [j33]Monika Balvociute, David Bryant, Andreas Spillner:
When Can Splits be Drawn in the Plane? SIAM J. Discret. Math. 31(2): 839-856 (2017) - [i4]Vincent Moulton, Andreas Spillner, Taoyang Wu:
UPGMA and the normalized equidistant minimum evolution problem. CoRR abs/1704.00497 (2017) - 2016
- [j32]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: 1-9 (2016) - [j31]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): 518-522 (2016) - 2014
- [j30]Sarah Bastkowski, Andreas Spillner, Vincent Moulton:
Fishing for minimum evolution trees with Neighbor-Nets. Inf. Process. Lett. 114(1-2): 13-18 (2014) - [c12]Julia Schüler, Andreas Spillner:
Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles. CSR 2014: 337-350 - 2013
- [j29]William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner:
Approximate proximity drawings. Comput. Geom. 46(6): 604-614 (2013) - [j28]Andreas W. M. Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu:
Obtaining splits from cut sets of tight spans. Discret. Appl. Math. 161(10-11): 1409-1420 (2013) - [j27]Sven Herrmann, Vincent Moulton, Andreas Spillner:
Searching for realizations of finite metric spaces in tight spans. Discret. Optim. 10(4): 310-319 (2013) - [j26]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): 151-160 (2013) - 2012
- [b2]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
Basic Phylogenetic Combinatorics. Cambridge University Press 2012, ISBN 978-0-521-76832-0, pp. I-XII, 1-264 - [j25]Iain Martyn, Tyler S. Kuhn, Arne O. Mooers, Vincent Moulton, Andreas Spillner:
Computing evolutionary distinctiveness indices in large scale analysis. Algorithms Mol. Biol. 7: 6 (2012) - [j24]Sven Herrmann, Katharina T. Huber, Vincent Moulton, Andreas Spillner:
Recognizing Treelike k-Dissimilarities. J. Classif. 29(3): 321-340 (2012) - [j23]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): 630-635 (2012) - [j22]Andreas Spillner, Binh T. Nguyen, Vincent Moulton:
Constructing and Drawing Regular Planar Split Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 9(2): 395-407 (2012) - [c11]Katharina T. Huber, Vincent Moulton, Andreas Spillner, Sabine Storandt, Radoslaw Suchecki:
Computing a Consensus of Multilabeled Trees. ALENEX 2012: 84-92 - 2011
- [j21]Christian Knauer, Andreas Spillner:
A fixed-parameter algorithm for the minimum Manhattan network problem. J. Comput. Geom. 2(1): 189-204 (2011) - [j20]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): 1029-1040 (2011) - [c10]Jochen Eisner, Stefan Funke, Andre Herbst, Andreas Spillner, Sabine Storandt:
Algorithms for Matching and Predicting Trajectories. ALENEX 2011: 84-95 - [c9]William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner:
Approximate Proximity Drawings. GD 2011: 166-178 - 2010
- [j19]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: 19 (2010) - [j18]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): 158-172 (2010)
2000 – 2009
- 2009
- [j17]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): 329-341 (2009) - [j16]Magnus Bordewich, Charles Semple, Andreas Spillner:
Optimizing phylogenetic diversity across two trees. Appl. Math. Lett. 22(5): 638-641 (2009) - [j15]Andreas W. M. Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu:
Barriers in metric spaces. Appl. Math. Lett. 22(8): 1150-1153 (2009) - [j14]Vincent Moulton, Andreas Spillner:
Phylogenetic diversity and the maximum coverage problem. Appl. Math. Lett. 22(10): 1496-1499 (2009) - [j13]Martin Lott, Andreas Spillner, Katharina T. Huber, Vincent Moulton:
PADRE: a package for analyzing and displaying reticulate evolution. Bioinform. 25(9): 1199-1200 (2009) - [j12]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): 2325-2334 (2009) - [j11]Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff:
Untangling a Planar Graph. Discret. Comput. Geom. 42(4): 542-569 (2009) - [i3]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
An algorithm for computing cutpoints in finite metric spaces. CoRR abs/0910.2317 (2009) - 2008
- [j10]Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
Characterizing Cell-Decomposable Metrics. Electron. J. Comb. 15(1) (2008) - [j9]Jana Dietel, Hans-Dietrich Hecker, Andreas Spillner:
A note on optimal floodlight illumination of stages. Inf. Process. Lett. 105(4): 121-123 (2008) - [j8]Katharina T. Huber, Martin Lott, Vincent Moulton, Andreas Spillner:
The Complexity of Deriving Multi-Labeled Trees from Bipartitions. J. Comput. Biol. 15(6): 639-651 (2008) - [j7]Andreas Spillner:
A fixed parameter algorithm for optimal convex partitions. J. Discrete Algorithms 6(4): 561-569 (2008) - [j6]Andreas Spillner, Binh T. Nguyen, Vincent Moulton:
Computing Phylogenetic Diversity for Split Systems. IEEE ACM Trans. Comput. Biol. Bioinform. 5(2): 235-244 (2008) - [c8]Andreas Spillner, Alexander Wolff:
Untangling a Planar Graph. SOFSEM 2008: 473-484 - [c7]Stefan Grünewald, Andreas Spillner, Kristoffer Forslund, Vincent Moulton:
Constructing Phylogenetic Supernetworks from Quartets. WABI 2008: 284-295 - 2007
- [j5]David Bryant, Vincent Moulton, Andreas Spillner:
Consistency of the Neighbor-Net Algorithm. Algorithms Mol. Biol. 2 (2007) - [j4]Andreas Spillner:
Review of "Reconstructing Evolution: New mathematical and computational advances" edited by Olivier Gascuel and Mike Steel. Algorithms Mol. Biol. 2 (2007) - [j3]Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff:
Configurations with few crossings in topological graphs. Comput. Geom. 37(2): 104-114 (2007) - [c6]Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama:
Fixed-Parameter Tractability for Non-Crossing Spanning Trees. WADS 2007: 410-421 - [i2]Andreas Spillner, Alexander Wolff:
Untangling a Planar Graph. CoRR abs/0709.0170 (2007) - 2006
- [j2]Andreas Spillner:
Minimum boundary touching tilings of polyominoes. Math. Log. Q. 52(1): 29-36 (2006) - [c5]Christian Knauer, Andreas Spillner:
Approximation Algorithms for the Minimum Convex Partition Problem. SWAT 2006: 232-241 - [c4]Christian Knauer, Andreas Spillner:
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. WG 2006: 49-57 - 2005
- [c3]Andreas Spillner:
A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points. ACiD 2005: 135-146 - [c2]Andreas Spillner:
Optimal convex partitions of point sets with few inner points. CCCG 2005: 39-42 - [c1]Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff:
Configurations with Few Crossings in Topological Graphs. ISAAC 2005: 604-613 - [i1]Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff:
Spanning trees with few crossings in geometric and topological graphs. EuroCG 2005: 195-198 - 2003
- [b1]Andreas Spillner:
Floodlight Illumination: zur algorithmischen Komplexität und zu kombinatorischen Aspekten. University of Jena, Germany, 2003 - 2002
- [j1]Andreas Spillner, Hans-Dietrich Hecker:
Minimizing the Size of Vertexlights in Simple Polygons. Math. Log. Q. 48(3): 447-458 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
