The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ulrike Stege: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon
    A Parallel FPT Application For Clusters. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2003, pp:70-77 [Conf]
  2. Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege
    Analogs and Duals of teh MAST Problem for Sequences and Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:103-114 [Conf]
  3. Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
    Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:311-322 [Conf]
  4. Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege
    Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:240-251 [Conf]
  5. Michael R. Fellows, Michael T. Hallett, Ulrike Stege
    On the Multiple Gene Duplication Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:347-356 [Conf]
  6. Allan E. Scott, Ulrike Stege, Norbert Zeh
    Politician's Firefighting. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:608-617 [Conf]
  7. Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel
    An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:249-261 [Conf]
  8. Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
    Refined Search Tree Technique for DOMINATING SET on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:111-122 [Conf]
  9. Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton
    A New Algorithm for Fast All-Against-All Substring Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2006, pp:360-366 [Conf]
  10. Ulrike Stege
    Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:288-293 [Conf]
  11. Rodney G. Downey, Michael R. Fellows, Ulrike Stege
    Computational Tractability: The View From Mars. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1999, v:69, n:, pp:73-97 [Journal]
  12. Michael R. Fellows, Michael T. Hallett, Ulrike Stege
    Analogs & duals of the MAST problem for sequences & trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:1, pp:192-216 [Journal]
  13. Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
    A refined search tree technique for Dominating Set on planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:4, pp:385-405 [Journal]
  14. James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon
    Solving large FPT problems on coarse-grained parallel machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:4, pp:691-706 [Journal]

  15. Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings. [Citation Graph (, )][DBLP]


  16. A new method for indexing genomes using on-disk suffix trees. [Citation Graph (, )][DBLP]


  17. Suffix trees for very large genomic sequences. [Citation Graph (, )][DBLP]


  18. 07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. [Citation Graph (, )][DBLP]


  19. 07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. [Citation Graph (, )][DBLP]


  20. Parameterized Chess. [Citation Graph (, )][DBLP]


  21. Information Brokers in Requirement-Dependency Social Networks. [Citation Graph (, )][DBLP]


  22. Curing recursion aversion. [Citation Graph (, )][DBLP]


  23. Autonomic Computing Now You See It, Now You Don't. [Citation Graph (, )][DBLP]


  24. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.017secs
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