2008 | ||
---|---|---|
24 | EE | Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton: A new method for indexing genomes using on-disk suffix trees. CIKM 2008: 649-658 |
23 | EE | Hausi A. Müller, Holger M. Kienle, Ulrike Stege: Autonomic Computing Now You See It, Now You Don't. ISSSE 2008: 32-54 |
22 | EE | Allan Scott, Ulrike Stege: Parameterized Chess. IWPEC 2008: 172-189 |
21 | EE | Sabrina Marczak, Daniela Damian, Ulrike Stege, Adrian Schröter: Information Brokers in Requirement-Dependency Social Networks. RE 2008: 53-62 |
20 | EE | Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton: A graph approach to the threshold all-against-all substring matching problem. ACM Journal of Experimental Algorithmics 12: (2008) |
19 | EE | 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. Algorithmica 52(2): 167-176 (2008) |
2007 | ||
18 | Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 | |
17 | EE | Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton: Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings. BIBE 2007: 327-333 |
16 | EE | Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege: 07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
15 | EE | Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege: 07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
2006 | ||
14 | EE | Allan E. Scott, Ulrike Stege, Norbert Zeh: Politician's Firefighting. ISAAC 2006: 608-617 |
13 | EE | Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton: A New Algorithm for Fast All-Against-All Substring Matching. SPIRE 2006: 360-366 |
2005 | ||
12 | EE | 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. J. Comput. Syst. Sci. 71(4): 385-405 (2005) |
2004 | ||
11 | EE | 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. ESA 2004: 311-322 |
2003 | ||
10 | EE | James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon: A Parallel FPT Application For Clusters. CCGRID 2003: 70-77 |
9 | EE | Michael R. Fellows, Michael T. Hallett, Ulrike Stege: Analogs & duals of the MAST problem for sequences & trees. J. Algorithms 49(1): 192-216 (2003) |
8 | EE | James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon: Solving large FPT problems on coarse-grained parallel machines. J. Comput. Syst. Sci. 67(4): 691-706 (2003) |
2002 | ||
7 | EE | 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. ISAAC 2002: 249-261 |
2001 | ||
6 | EE | 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. MFCS 2001: 111-122 |
2000 | ||
5 | EE | 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. FSTTCS 2000: 240-251 |
1999 | ||
4 | EE | Ulrike Stege: Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable. WADS 1999: 288-293 |
3 | Rodney G. Downey, Michael R. Fellows, Ulrike Stege: Computational Tractability: The View From Mars. Bulletin of the EATCS 69: 73-97 (1999) | |
1998 | ||
2 | EE | Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege: Analogs and Duals of teh MAST Problem for Sequences and Trees. ESA 1998: 103-114 |
1 | EE | Michael R. Fellows, Michael T. Hallett, Ulrike Stege: On the Multiple Gene Duplication Problem. ISAAC 1998: 347-356 |