The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andreas Spillner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Spillner
    A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:135-146 [Conf]
  2. Andreas Spillner
    Optimal convex partitions of point sets with few inner points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:39-42 [Conf]
  3. Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
    Configurations with Few Crossings in Topological Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:604-613 [Conf]
  4. Christian Knauer, Andreas Spillner
    Approximation Algorithms for the Minimum Convex Partition Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:232-241 [Conf]
  5. Christian Knauer, Andreas Spillner
    A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:49-57 [Conf]
  6. Andreas Spillner, Peter Liggesmeyer
    Editorial Themenheft: Aktuelle Entwicklungen im Softwaretest. [Citation Graph (0, 0)][DBLP]
    Inform., Forsch. Entwickl., 2000, v:15, n:3, pp:119-120 [Journal]
  7. Reinhold Franck, Olaf Langmack, Andreas Spillner, Thomas Weitzel, Claus Wickboldt, Gerrit Winter
    Das Projekt EVA - Ein Ausbildungsprojekt im Bereich der Qualitässicherung. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1987, v:10, n:3, pp:159-163 [Journal]
  8. Andreas Spillner
    Integrationstest - Das aktuelle Schlagwort. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1992, v:15, n:5, pp:293-294 [Journal]
  9. Andreas Spillner
    Kann eine Krise 25 Jahre dauern? [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1994, v:17, n:1, pp:48-52 [Journal]
  10. Andreas Spillner, Peter Liggesmeyer
    Software-Qualitätssicherung in der Praxis. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1994, v:17, n:6, pp:368-372 [Journal]
  11. Andreas Spillner, Jürgen F. H. Winkler
    25 Jahre Software-Engineering - Editorial. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1993, v:16, n:5, pp:257-258 [Journal]
  12. Andreas Spillner, Hans-Dietrich Hecker
    Minimizing the Size of Vertexlights in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:3, pp:447-458 [Journal]
  13. Andreas Spillner
    Minimum boundary touching tilings of polyominoes. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2006, v:52, n:1, pp:29-36 [Journal]
  14. Andreas Spillner
    FG 2.1.7: Aufruf zur Teilnahme am FG-Treffen am 15. und 16. Februar 2001 in Elmshorn. [Citation Graph (0, 0)][DBLP]
    Softwaretechnik-Trends, 2000, v:20, n:4, pp:- [Journal]
  15. Andreas Spillner
    FG 2.1.7: Ankündigung des 19. FG-Treffens am 20. und 21. Februar 2003 und weitere Hinweise. [Citation Graph (0, 0)][DBLP]
    Softwaretechnik-Trends, 2002, v:22, n:4, pp:- [Journal]
  16. Andreas Spillner
    Bericht vom Treffen und Ergebnis der Wahl. [Citation Graph (0, 0)][DBLP]
    Softwaretechnik-Trends, 2003, v:23, n:1, pp:- [Journal]
  17. Andreas Spillner, Tilo Linz
    Certified Tester - eine Erfolgsstory. [Citation Graph (0, 0)][DBLP]
    Softwaretechnik-Trends, 2003, v:23, n:1, pp:- [Journal]
  18. Andreas Spillner
    Control Flow and Data Flow Oriented Integration Test Methods. [Citation Graph (0, 0)][DBLP]
    Softw. Test., Verif. Reliab., 1992, v:2, n:2, pp:83-98 [Journal]
  19. Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama
    Fixed-Parameter Tractability for Non-Crossing Spanning Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:410-421 [Conf]
  20. Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
    Configurations with few crossings in topological graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:2, pp:104-114 [Journal]
  21. Andreas Spillner, Alexander Wolff
    Untangling a Planar Graph [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  22. Spanning trees with few crossings in geometric and topological graphs. [Citation Graph (, )][DBLP]


  23. Untangling a Planar Graph. [Citation Graph (, )][DBLP]


  24. Constructing Phylogenetic Supernetworks from Quartets. [Citation Graph (, )][DBLP]


  25. Optimizing phylogenetic diversity across two trees. [Citation Graph (, )][DBLP]


  26. Barriers in metric spaces. [Citation Graph (, )][DBLP]


  27. Phylogenetic diversity and the maximum coverage problem. [Citation Graph (, )][DBLP]


  28. PADRE: a package for analyzing and displaying reticulate evolution. [Citation Graph (, )][DBLP]


  29. An algorithm for computing cutpoints in finite metric spaces [Citation Graph (, )][DBLP]


  30. Consistency of the QNet algorithm for generating planar split networks from weighted quartets. [Citation Graph (, )][DBLP]


  31. Untangling a Planar Graph. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002