Greifswald University, Germany
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j28 |      | William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner: Approximate proximity drawings. Comput. Geom. 46(6): 604-614 (2013) |
| j27 | | Andreas W. M. Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu: Obtaining splits from cut sets of tight spans. Discrete Applied Mathematics 161(10-11): 1409-1420 (2013) |
| 2012 | ||
| b1 | | 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 |
| j26 | | Iain Martyn, Tyler S. Kuhn, Arne O. Mooers, Vincent Moulton, Andreas Spillner: Computing evolutionary distinctiveness indices in large scale analysis. Algorithms for Molecular Biology 7: 6 (2012) |
| j25 | | Sven Herrmann, Katharina T. Huber, Vincent Moulton, Andreas Spillner: Recognizing Treelike k-Dissimilarities. J. Classification 29(3): 321-340 (2012) |
| j24 | | 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) |
| j23 | | Andreas Spillner, Binh T. Nguyen, Vincent Moulton: Constructing and Drawing Regular Planar Split Networks. IEEE/ACM Trans. Comput. Biology 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 | ||
| j22 | | Christian Knauer, Andreas Spillner: A fixed-parameter algorithm for the minimum Manhattan network problem. JoCG 2(1): 189-204 (2011) |
| j21 | | Katharina T. Huber, Andreas Spillner, Radoslaw Suchecki, Vincent Moulton: Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds. IEEE/ACM Trans. Comput. Biology 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. Graph Drawing 2011: 166-178 |
| 2010 | ||
| j20 | | Binh T. Nguyen, Andreas Spillner, Brent C. Emerson, Vincent Moulton: Distinguishing between hot-spots and melting-pots of genetic diversity using haplotype connectivity. Algorithms for Molecular Biology 5: 19 (2010) |
| j19 | | Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner: An Algorithm for Computing Cutpoints in Finite Metric Spaces. J. Classification 27(2): 158-172 (2010) |
| 2009 | ||
| j18 | | Magnus Bordewich, Charles Semple, Andreas Spillner: Optimizing phylogenetic diversity across two trees. Appl. Math. Lett. 22(5): 638-641 (2009) |
| j17 | | Andreas W. M. Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu: Barriers in metric spaces. Appl. Math. Lett. 22(8): 1150-1153 (2009) |
| j16 | | Vincent Moulton, Andreas Spillner: Phylogenetic diversity and the maximum coverage problem. Appl. Math. Lett. 22(10): 1496-1499 (2009) |
| j15 | | Martin Lott, Andreas Spillner, Katharina T. Huber, Vincent Moulton: PADRE: a package for analyzing and displaying reticulate evolution. Bioinformatics 25(9): 1199-1200 (2009) |
| j14 | | Stefan Grünewald, Vincent Moulton, Andreas Spillner: Consistency of the QNet algorithm for generating planar split networks from weighted quartets. Discrete Applied Mathematics 157(10): 2325-2334 (2009) |
| j13 | | Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff: Untangling a Planar Graph. Discrete & Computational Geometry 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 | ||
| j12 | | Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner: Characterizing Cell-Decomposable Metrics. Electr. J. Comb. 15(1) (2008) |
| j11 | | Jana Dietel, Hans-Dietrich Hecker, Andreas Spillner: A note on optimal floodlight illumination of stages. Inf. Process. Lett. 105(4): 121-123 (2008) |
| j10 | | Katharina T. Huber, Martin Lott, Vincent Moulton, Andreas Spillner: The Complexity of Deriving Multi-Labeled Trees from Bipartitions. Journal of Computational Biology 15(6): 639-651 (2008) |
| j9 | | Andreas Spillner: A fixed parameter algorithm for optimal convex partitions. J. Discrete Algorithms 6(4): 561-569 (2008) |
| j8 | | Andreas Spillner, Binh T. Nguyen, Vincent Moulton: Computing Phylogenetic Diversity for Split Systems. IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 235-244 (2008) |
| c8 | | |
| c7 | | Stefan Grünewald, Andreas Spillner, Kristoffer Forslund, Vincent Moulton: Constructing Phylogenetic Supernetworks from Quartets. WABI 2008: 284-295 |
| 2007 | ||
| j7 | | David Bryant, Vincent Moulton, Andreas Spillner: Consistency of the Neighbor-Net Algorithm. Algorithms for Molecular Biology 2 (2007) |
| j6 | | Andreas Spillner: Review of "Reconstructing Evolution: New mathematical and computational advances" edited by Olivier Gascuel and Mike Steel. Algorithms for Molecular Biology 2 (2007) |
| j5 | | 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 | | |
| 2006 | ||
| j4 | | Andreas Spillner: Minimum boundary touching tilings of polyominoes. Math. Log. Q. 52(1): 29-36 (2006) |
| j3 | | Andrzej Sonnek, Andreas Spillner: Brauchbarkeit von Freeware und unentgeltlichen Community-Versionen kommerzieller UML-Werkzeuge. Softwaretechnik-Trends 26(4) (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 | | |
| 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 |
| 2002 | ||
| j2 | | Andreas Spillner, Hans-Dietrich Hecker: Minimizing the Size of Vertexlights in Simple Polygons. Math. Log. Q. 48(3): 447-458 (2002) |
| 1995 | ||
| j1 | | Andreas Spillner: Test criteria and coverage measures for software integration testing. Software Quality Journal 4(4): 275-286 (1995) |
Colors in the list of coauthors
Last update Thu May 23 06:34:49 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page