Publications

Books

  1. Basic phylogenetic combinatorics. Andreas Dress, Katharina Huber, Jacobus Koolen, Vincent Moulton, Andreas Spillner. Cambridge University Press, 2012.

Contributions to journals

  1. When can splits be drawn in the plane?. Monika Balvociute, David Bryant, Andreas Spillner. SIAM Journal on Discrete Mathematics, 31 (2), 839–856, 2017.
  2. Characterizing block graphs in terms of their vertex-induced partitions. Andreas Dress, Katharina Huber, Jacobus Koolen, Vincent Moulton, Andreas Spillner. The Australasian Journal of Combinatorics, 66 (1), 1-9, 2016.
  3. The minimum evolution problem is hard: a link between tree inference and graph clustering problems. Sarah Bastkowski, Vincent Moulton, Andreas Spillner, Taoyang Wu. Bioinformatics, 32 (4), 518-522, 2015.
  4. Neighborhoods of trees in circular orderings. Sarah Bastkowski, Vincent Moulton, Andreas Spillner, Taoyang Wu. Bulletin of Mathematical Biology, 77 (1), 46-70, 2015.
  5. A standardized method for quantifying eggshell patterns. Angela Schmitz Ornes, Andre Herbst, Andreas Spillner, Wolfgang Mewes, Moritz Rauch. Journal of Field Ornithology, 85 (4), 397-407, 2014.
  6. FlatNJ: A novel network-based approach to visualize evolutionary and biogeographical relationships. Monika Balvociute, Andreas Spillner, Vincent Moulton. Systematic Biology, 63 (3), 383-396, 2014.
  7. Prioritizing populations for conservation using phylogenetic networks. Logan Volkmann, Iain Martyn, Vincent Moulton, Andreas Spillner, Arne Mooers. PLOS ONE, 9 (2), 2014.
  8. Fishing for minimum evolution trees with Neighbor-Nets. Sarah Bastkowski, Andreas Spillner, Vincent Moulton. Information Processing Letters, 114 (1), 13-18, 2014.
  9. Searching for realizations of finite metric spaces in tight spans. Sven Herrmann, Vincent Moulton, Andreas Spillner. Discrete Optimization, 10 (4), 310-319, 2013.
  10. SuperQ: computing supernetworks from quartets. Stefan Grünewald, Andreas Spillner, Sarah Bastkowski, Anja Bögershausen, Vincent Moulton. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10 (1), 151-160, 2013.
  11. Approximate Proximity Drawings. William Evans, Emden Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner. Computational Geometry, 46 (6), 604-614, 2013.
  12. Obtaining splits from cut sets of tight spans. Andreas Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu. Discrete Applied Mathematics, 161 (10), 1409-1420, 2013.
  13. Recognizing treelike k-dissimilarities. Sven Herrmann, Katharina Huber, Vincent Moulton, Andreas Spillner. Journal of Classification, 29 (3), 321-340, 2012.
  14. Vertex angle and crossing angle resolution of leveled tree drawings. Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, Andreas Spillner. Information Processing Letters, 112 (16), 630-635, 2012.
  15. Computing evolutionary distinctiveness indices in large scale analysis. Iain Martyn, Tyler Kuhn, Arne Mooers, Vincent Moulton, Andreas Spillner. Algorithms for Molecular Biology, 7 (6), 2012.
  16. Optimal algorithms for computing edge weights in planar split networks. Vincent Moulton, Andreas Spillner. Journal of Applied Mathematics and Computing, 39 (1), 1-13, 2012.
  17. Constructing and drawing regular planar split networks. Andreas Spillner, Binh T. Nguyen, Vincent Moulton. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9 (2), 395-407, 2012.
  18. A fixed-parameter algorithm for the minimum Manhattan network problem. Christian Knauer, Andreas Spillner. Journal of Computational Geometry, 2 (1), 189-204, 2011.
  19. Metrics on multi-labeled trees: interrelationships and diameter bounds. Katharina Huber, Andreas Spillner, Radoslaw Suchecki, Vincent Moulton. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8 (4), 1029-1040, 2011.
  20. An algorithm for computing cutpoints in finite metric spaces. Andreas Dress, Katharina Huber, Jacobus Koolen, Vincent Moulton, Andreas Spillner. Journal of Classification, 27 (2), 158-192, 2010.
  21. Distinguishing between hot-spots and melting-pots of genetic diversity using haplotype connectivity. Binh T. Nguyen, Andreas Spillner, Brent Emerson, Vincent Moulton. Algorithms for Molecular Biology, 5 (19), 2010.
  22. Untangling a planar graph. Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff. Discrete & Computational Geometry, 42 (4), 542-569, 2009.
  23. Inferring polyploid phylogenies from multiply-labeled gene trees. Martin Lott, Andreas Spillner, Katharina Huber, Anna Petri, Bengt Oxelman, Vincent Moulton. BMC Evolutionary Biology, 9, 2009.
  24. Phylogenetic diversity and the maximum coverage problem. Vincent Moulton, Andreas Spillner. Applied Mathematics Letters, 22 (10), 1496-1499, 2009.
  25. PADRE: A package for analyzing and displaying reticulate evolution. Martin Lott, Andreas Spillner, Katharina Huber, Vincent Moulton. Bioinformatics, 25 (9), 1199-1200, 2009.
  26. Barriers in metric spaces. Andreas Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu. Applied Mathematics Letters, 22 (8), 1150-1153, 2009.
  27. Characterizing weak compatibility in terms of weighted quartets. Stefan Grünewald, Katharina Huber, Vincent Moulton, Charles Semple, Andreas Spillner. Advances in Applied Mathematics, 42 (3), 329-341, 2009.
  28. Optimizing phylogenetic diversity across two trees. Magnus Bordewich, Charles Semple, Andreas Spillner. Applied Mathematics Letters, 22 (5), 638-641, 2009.
  29. Consistency of the QNet algorithm for generating planar split graphs from weighted quartets. Stefan Grünewald, Vincent Moulton, Andreas Spillner. Discrete Applied Mathematics, 157 (10), 2325-2334, 2009.
  30. A fixed parameter algorithm for optimal convex partitions. Andreas Spillner. Journal of Discrete Algorithms, 6 (4), 561-569, 2008.
  31. The complexity of deriving multi-labeled trees from bipartitions. Katharina Huber, Martin Lott, Vincent Moulton, Andreas Spillner. Journal of Computational Biology, 15 (6), 639-651, 2008.
  32. Computing phylogenetic diversity for split systems. Andreas Spillner, Binh T. Nguyen, Vincent Moulton. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5 (2), 235-244, 2008.
  33. Characterizing cell-decomposable metrics. Katharina T. Huber, Jacobus Koolen, Vincent Moulton, Andreas Spillner. The Electronic Journal of Combinatorics, 15 (1), 2008.
  34. A note on optimal floodlight illumination of stages. Jana Dietel, Hans-Dietrich Hecker, Andreas Spillner. Information Processing Letters, 105 (4), 121-123, 2008.
  35. Consistency of the Neighbor-Net algorithm. David Bryant, Vincent Moulton, Andreas Spillner. Algorithms for Molecular Biology, 2 (8), 2007.
  36. Configurations with few crossings in topological graphs. Christian Knauer, Etienne Schramm, Andreas Spillner, Alexander Wolff. Computational Geometry, 37 (2), 104-114, 2007.
  37. Minimum boundary touching tilings of polyominoes. Andreas Spillner. Mathematical Logic Quaterly, 52 (1), 29-36, 2006.
  38. Minimizing the size of vertexlights in simple polygons. Andreas Spillner, Hans-Dietrich Hecker. Mathematical Logic Quaterly, 48 (3), 447-458, 2002.

Contributions to conferences and workshops

  1. Crossing-free spanning trees in visibility graphs of points between monotone polygonal obstacles. Julia Schüler, Andreas Spillner. Proceedings of the International Computer Science Symposium in Russia, Moscow, Springer LNCS 8476, 338-351, 2014.
  2. Computing a consensus of multilabeled trees. Katharina Huber, Vincent Moulton, Andreas Spillner, Sabine Storandt, Radoslaw Suchecki. Proceedings of the Workshop on Algorithm Engineering and Experiments, Kyoto, SIAM, 84-92, 2012.
  3. Approximate Proximity Drawings. William Evans, Emden Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner. Proceedings of the International Symposium on Graph Drawing, Eindhoven, Springer LNCS 7034, 166-178, 2011.
  4. Algorithms for matching and predicting trajectories. Jochen Eisner, Stefan Funke, Andre Herbst, Andreas Spillner, Sabine Storandt. Proceedings of the Workshop on Algorithm Engineering and Experiments, San Francisco, SIAM, 84-95, 2011.
  5. Constructing phylogenetic supernetworks from quartets. Stefan Grünewald, Andreas Spillner, Kristoffer Forslund, Vincent Moulton. Proc. of the 8th Workshop on Algorithms in Bioinformatics, Karlsruhe, Springer LNBI 5251, 284-295, 2008.
  6. Untangling a planar graph. Andreas Spillner, Alexander Wolff. Proceedings of the 34th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Springer LNCS 4910, 473-484, 2008.
  7. Fixed-parameter tractability for non-crossing spanning trees. Magnus Halldorsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama. Proceedings of the 10th International Workshop on Algorithms and Data Structures, Halifax, Springer LNCS 4619, 410-421, 2007.
  8. Approximation algorithms for the minimum convex partition problem. Christian Knauer, Andreas Spillner. Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, Riga, Springer LNCS 4059, 232-241, 2006.
  9. A fixed-parameter algorithm for the minimum weight triangulation problem based on small graph separators. Christian Knauer, Andreas Spillner. Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, Bergen, Springer LNCS 4271, 49-57, 2006.
  10. Configurations with few crossings in topological graphs. Christian Knauer, Etienne Schramm, Andreas Spillner, Alexander Wolff. Proceedings of the 16th International Symposium on Algorithms and Computation, Hainan, Springer LNCS 3827, 604-613, 2005.
  11. Optimal convex partitions of point sets with few inner points. Andreas Spillner. Proceedings of the 17th Canadian Conference on Computational Geometry, Windsor, 34-37, 2005.
  12. A faster algorithm for the minimum weight triangulation problem with few inner points. Andreas Spillner. Proceedings of the 1st Algorithms and Complexity in Durham Workshop, Durham, 135-146, 2005.
  13. Spanning trees with few crossings in geometric and topological graphs. Christian Knauer, Etienne Schramm, Andreas Spillner, Alexander Wolff. Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, 195-198, 2005.
  14. Two optimization problems with floodlights. Andreas Spillner. Proceedings of the 20th European Workshop on Computational Geometry, Seville, 41-44, 2004.
  15. Tiling polyominoes with squares that touch the boundary. Andreas Spillner. Proceedings of the 19th European Workshop on Computational Geometry, Bonn, 143-146, 2003.
  16. The orthogonal fortress problem with floodlights. Andreas Spillner, Hans-Dietrich Hecker. Proceedings of the 18th European Workshop on Computational Geometry, Warsaw, 16-17, 2002.

Technical reports

  1. Fixed-parameter algorithms for finding crossing-free spanning trees in geometric graphs. Christian Knauer, Andreas Spillner. Technical Report 06-07, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2006.
  2. Configurations with few crossings in topological graphs. Christian Knauer, Etienne Schramm, Andreas Spillner, Alexander Wolff. Technical Report 2005-24, Fakultät für Informatik, Universität Karlsruhe, 2005.
  3. Minimum boundary touching tilings of simple polyominoes. Andreas Spillner. Technical Report 04-13, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2004.
  4. Tiling polyominoes with squares that touch the boundary. Andreas Spillner. Technical Report 04-10, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2004.
  5. Illuminating a convex polygon optimally with three floodlights. Andreas Spillner. Technical Report 03-18, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2003.
  6. A note on optimal floodlight illumination of stages. Andreas Spillner, Jana Dietel, Hans-Dietrich Hecker. Technical Report 03-12, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2003.
  7. Vertexlights with fixed directions in simple polygons. Andreas Spillner, Hans-Dietrich Hecker. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae, Sectio Computatorica, 21, 135-151, 2002.
  8. The orthogonal prison yard problem with floodlights. Andreas Spillner, Hans-Dietrich Hecker. Technical Report Math/Inf/22/01, Institut für Informatik, Friedrich-Schiller-Universität Jena, 2001.
  9. Minimizing the size of vertexlights in simple polygons. Andreas Spillner, Hans-Dietrich Hecker. Technical Report Math/Inf/08/01, Institut für Informatik, Friedrich-Schiller-Universität Jena, 2001.
  10. Illuminating a rectilinear art gallery with vertexlights. Andreas Spillner, Hans-Dietrich Hecker. Technical Report Math/Inf/05/01, Institut für Informatik, Friedrich-Schiller-Universität Jena, 2001.

Posters

  1. Metabolic PathTreemaps. Julia Schüler, Andreas Spillner, Katharina Riedel, Jörg Bernhardt. 2nd EMBO Conference on Visualizing Biological Data, Heidelberg, 2014.
  2. Analyzing molecular sequence data with planar split networks. Monika Balvociute, Andreas Spillner, Vincent Moulton. 12th European Conference on Computational Biology, Berlin, 2013.
  3. Integrated visualization of pathways and large biological ontologies. Julia Schüler, Andreas Spillner, Jörg Bernhardt, Henry Mehlan, Katharina Riedel. 12th European Conference on Computational Biology, Berlin, 2013.

Theses

  1. From geometric graphs to phylogenetic combinatorics. Andreas Spillner. Habilitationsschrift, Mathematisch-Naturwissenschaftliche Fakultät, Universität Greifswald, 2013.
  2. Floodlight Illumination - Zur algorithmischen Komplexität und zu kombinatorischen Aspekten. Andreas Spillner. Dissertation, Fakultät für Mathematik und Informatik, Universität Jena, 2003.
  3. Algorithmen für Zerlegungs- und Pflasterungsprobleme. Andreas Spillner. Diplomarbeit, Fakultät für Mathematik und Informatik, Universität Jena, 2000.

Book reviews

  1. Review of "Reconstructing Evolution: New mathematical and computational advances" edited by Olivier Gascuel and Mike Steel. Andreas Spillner. Algorithms for Molecular Biology, 2 (14), 2007.