Ulrike Stege
Ulrike Stege
Associate Professor of Computer Science, University of Victoria
Verified email at cs.uvic.ca
TitleCited byYear
Parameterized complexity: A framework for systematically confronting computational intractability
RG Downey, MR Fellows, U Stege
Contemporary trends in discrete mathematics: From DIMACS and DIMATIA to the …, 1999
2501999
Solving large FPT problems on coarse-grained parallel machines
J Cheetham, F Dehne, A Rau-Chaplin, U Stege, PJ Taillon
Journal of Computer and System Sciences 67 (4), 691-706, 2003
1122003
Refined search tree technique for dominating set on planar graphs
J Alber, H Fan, M Fellows, H Fernau, R Niedermeier, F Rosamond, ...
Mathematical Foundations of Computer Science 2001, 111-123, 2001
71*2001
Convex hull and tour crossings in the Euclidean traveling salesperson problem: Implications for human performance studies
I Van Rooij, U Stege, A Schactman
Memory & cognition 31 (2), 215-220, 2003
672003
Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems
RF Michael, C McCartin, AR Frances, U Stege
International Conference on Foundations of Software Technology and …, 2000
672000
Resolving conflicts in problems from computational biology
U Stege
PhD thesis, ETH Zuerich, 2000. PhD Thesis, 2000
67*2000
Autonomic computing now you see it, now you don’t
HA Müller, HM Kienle, U Stege
Software Engineering, 32-54, 2007
642007
Computational tractability: The view from mars
RG Downey, MR Fellows, U Stege, ...
Bulletin of the EATCS 69, 73-97, 1999
591999
Information brokers in requirement-dependency social networks
S Marczak, D Damian, U Stege, A Schröter
2008 16th IEEE International Requirements Engineering Conference, 53-62, 2008
552008
Gene trees and species trees: The gene-duplication problem is fixed-parameter tractable
U Stege
Workshop on Algorithms and Data Structures, 288-293, 1999
531999
Faster fixed-parameter tractable algorithms for matching and packing problems
MR Fellows, C Knauer, N Nishimura, P Ragde, F Rosamond, U Stege, ...
Algorithmica 52 (2), 167-176, 2008
492008
A refined search tree technique for dominating set on planar graphs
J Alber, H Fan, MR Fellows, H Fernau, R Niedermeier, F Rosamond, ...
Journal of Computer and System Sciences 71 (4), 385-405, 2005
492005
An improved fixed parameter tractable algorithm for vertex cover
U Stege, MR Fellows
Technical report/Departement Informatik, ETH Zürich 318, 1999
491999
Faster fixed-parameter tractable algorithms for matching and packing problems
M Fellows, C Knauer, N Nishimura, P Ragde, F Rosamond, U Stege, ...
Algorithms–ESA 2004, 311-322, 2004
482004
On the multiple gene duplication problem
M Fellows, M Hallett, U Stege
International Symposium on Algorithms and Computation, 348-357, 1998
431998
Analogs & duals of the MAST problem for sequences & trees
M Fellows, M Hallett, U Stege
Journal of Algorithms 49 (1), 192-216, 2003
412003
A new method for indexing genomes using on-disk suffix trees
M Barsky, U Stege, A Thomo, C Upton
Proceedings of the 17th ACM conference on Information and knowledge …, 2008
382008
Suffix trees for very large genomic sequences
M Barsky, U Stege, A Thomo, C Upton
Proceedings of the 18th ACM conference on Information and knowledge …, 2009
372009
Analogs and Duals of the MAST Problem for Sequences and Trees
M Fellows, M Hallett, C Korostensky, U Stege
European Symposium on Algorithms, 103-114, 1998
281998
Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs
S Chester, J Gaertner, U Stege, S Venkatesh
ASONAM 2012, 2012
272012
The system can't perform the operation now. Try again later.
Articles 1–20