Follow
Ulrike Stege
Title
Cited by
Cited by
Year
Parameterized complexity: A framework for systematically confronting computational intractability
RG Downey, MR Fellows, U Stege
Contemporary Trends in Discrete Mathematics 49, 49-99, 1997
2751997
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
1202003
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
862003
Autonomic computing now you see it, now you don’t: Design and evolution of autonomic software systems
HA Müller, HM Kienle, U Stege
Software Engineering: International Summer Schools, ISSSE 2006-2008, Salerno …, 2009
762009
Resolving conflicts in problems from computational biology
U Stege
PhD thesis, ETH Zuerich, 2000. PhD Thesis, 2000
72*2000
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
70*2001
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
FST TCS 2000: Foundations of Software Technology and Theoretical Computer …, 2000
702000
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
692008
Computational tractability: The view from mars
RG Downey, MR Fellows, U Stege, ...
Bulletin of the EATCS 69, 73-97, 1999
621999
An improved fixed parameter tractable algorithm for vertex cover
U Stege, MR Fellows
Technical report/Departement Informatik, ETH Zürich 318, 1999
591999
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
582005
Gene trees and species trees: The gene-duplication problem is fixed-parameter tractable
U Stege
WADS, 288-293, 1999
571999
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
562004
Faster fixed-parameter tractable algorithms for matching and packing problems
MR Fellows, C Knauer, N Nishimura, P Ragde, F Rosamond, U Stege, ...
Algorithmica 52, 167-176, 2008
522008
On the multiple gene duplication problem
M Fellows, M Hallett, U Stege
Algorithms and Computation: 9th International Symposium, ISAAC’98 Taejon …, 1998
501998
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
442009
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
422008
Analogs & duals of the MAST problem for sequences & trees
M Fellows, M Hallett, U Stege
Journal of Algorithms 49 (1), 192-216, 2003
412003
IR absorption, raman scattering, and IR-Vis sum-frequency generation spectroscopy as quantitative probes of surface structure
KK Hung, U Stege, DK Hore
Applied Spectroscopy Reviews 50 (4), 351-376, 2015
402015
Foodie fooderson a conversational agent for the smart kitchen.
P Angara, M Jiménez, K Agarwal, H Jain, R Jain, U Stege, S Ganti, ...
CASCON 17, 247-253, 2017
352017
The system can't perform the operation now. Try again later.
Articles 1–20