Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ulrike Stege
2010 – today
- 2012
[c27]Steven Lonergan, Yagiz Onat Yazir, Ulrike Stege: A Framework for Classification of Resource Consolidation Management Problems. IEEE CLOUD 2012: 972-973- [c26]Sean Chester, Jared Gaertner, Ulrike Stege, S. Venkatesh: Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs. ASONAM 2012: 418-422
- [c25]Ulrike Stege: The Impact of Parameterized Complexity to Interdisciplinary Problem Solving. The Multivariate Algorithmic Revolution and Beyond 2012: 56-68
- 2011
- [b1]Marina Barsky, Ulrike Stege, Alex Thomo: Full-Text (Substring) Indexes in External Memory. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2011
- [j11]Frances A. Rosamond, Roswitha Bardohl, Stephan Diehl, Uwe Geisler, Gordon Bolduan, Annette Lessmöllmann, Andreas Schwill, Ulrike Stege: Reaching out to the media: become a computer science ambassador. Commun. ACM 54(3): 113-116 (2011)
- [j10]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege: Charge and reduce: A fixed-parameter algorithm for String-to-String Correction. Discrete Optimization 8(1): 41-49 (2011)
- [j9]Marina Barsky, Ulrike Stege, Alex Thomo: Suffix trees for inputs larger than main memory. Inf. Syst. 36(3): 644-654 (2011)
- [c24]Sowmya Balasubramanian, Ron Desmarais, Hausi A. Müller, Ulrike Stege, S. Venkatesh: Characterizing problems for realizing policies in self-adaptive and self-managing systems. SEAMS 2011: 70-79
- [c23]Sarah Carruthers, Todd Milford, Timothy Pelton, Ulrike Stege: Draw a social network. ITiCSE 2011: 178-182
- [c22]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides: Connecting a Set of Circles with Minimum Sum of Radii. WADS 2011: 183-194
- [i2]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides: Connecting a Set of Circles with Minimum Sum of Radii. CoRR abs/1105.0791 (2011)
- 2010
- [j8]Marina Barsky, Ulrike Stege, Alex Thomo: A survey of practical algorithms for suffix tree construction in external memory. Softw., Pract. Exper. 40(11): 965-988 (2010)
- [j7]Allan Scott, Ulrike Stege: Parameterized pursuit-evasion games. Theor. Comput. Sci. 411(43): 3845-3858 (2010)
- [c21]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege: A Fixed-Parameter Algorithm for String-to-String Correction. CATS 2010: 31-38
- [c20]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides: Connectivity Graphs of Uncertainty Regions. ISAAC (2) 2010: 434-445
- [i1]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides: Connectivity graphs of uncertainty regions. CoRR abs/1009.3469 (2010)
2000 – 2009
- 2009
- [c19]Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton: Suffix trees for very large genomic sequences. CIKM 2009: 1417-1420
- [c18]
- 2008
- [j6]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)
- [j5]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)
- [c17]Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton: A new method for indexing genomes using on-disk suffix trees. CIKM 2008: 649-658
- [c16]Hausi A. Müller, Holger M. Kienle, Ulrike Stege: Autonomic Computing Now You See It, Now You Don't. ISSSE 2008: 32-54
- [c15]
- [c14]Sabrina Marczak, Daniela Damian, Ulrike Stege, Adrian Schröter: Information Brokers in Requirement-Dependency Social Networks. RE 2008: 53-62
- 2007
- [c13]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
- [c12]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
- [c11]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
- [e1]Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege (Eds.): Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007. Dagstuhl Seminar Proceedings 07281, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- 2006
- [c10]
- [c9]Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton: A New Algorithm for Fast All-Against-All Substring Matching. SPIRE 2006: 360-366
- 2005
- [j4]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
- [c8]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
- [j3]Michael R. Fellows, Michael T. Hallett, Ulrike Stege: Analogs & duals of the MAST problem for sequences & trees. J. Algorithms 49(1): 192-216 (2003)
- [j2]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)
- [c7]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
- 2002
- [c6]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
- [c5]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
- [c4]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
1990 – 1999
- 1999
- [j1]Rodney G. Downey, Michael R. Fellows, Ulrike Stege: Computational Tractability: The View From Mars. Bulletin of the EATCS 69: 73-97 (1999)
- [c3]Ulrike Stege: Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable. WADS 1999: 288-293
- 1998
- [c2]Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege: Analogs and Duals of the MAST Problem for Sequences and Trees. ESA 1998: 103-114
- [c1]Michael R. Fellows, Michael T. Hallett, Ulrike Stege: On the Multiple Gene Duplication Problem. ISAAC 1998: 347-356
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:58 CEST by the dblp team