Selected Publications

 
 

  1. • S. Lonergan, Y. O. Yazir, U. Stege (2012). A Framework for Classification of Resource Consolidation Management Problems. IEEE CLOUD 2012, Work in Progress Track, 972-973


  1. • U. Stege (2012). The Impact of Parameterized Complexity to Interdisciplinary Problem Solving. In: The Multivariate Algorithmic Revolution and Beyond, 56-68

4):5-17, 2011.

  1. • S. Carruthers, M. Masson, U.Stege (2012). Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover”, Journal of Problem Solving

  2. • A. Scott, U. Stege, I. van Rooij (2011). Minesweeper may not be NP-complete but is hard nonetheless, The Mathematical Intelligencer, 33(4): 5-17


  1. • E. Chambers, S. Fekete, H.-F. Hoffmann, D. Marinakis, J. Mitchell, V. Srinivasan, U. Stege, S. Whitesides (2011). Connecting a Set of Circles with Minimum Sum of Radii, accepted to the 12th Algorithms and Data Structures Symposium (WADS 2011)

  2. • S. Carruthers, U. Stege, T. Milford, T. Pelton (2011). Draw a Social Network, 16th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2011)

  3. • S. Balasubramanian, R. Desmarais, H.A. Müller, U. Stege, S. Venkatesh (2011). Characterizing Problems for Realizing Policies in Self-Adaptive and Self-Managing Systems, 6th ACM/IEEE Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2011)

  4. • S. Diehl, U. Stege (2011). 09142 Manifesto - Perspectives Workshop: Preventing the Brainware Crisis, Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany

  5. • M. Barsky, U. Stege, A. Thomo (2011). Suffix Trees for Inputs Larger than the Main Memory, Information Systems, 36(3), pp. 644-654


  1. • F. Abu-Khzam, H. Fernau, M. Langston, S. Lee-Cultura, U. Stege (2011). Charge and Reduce: A fixed-parameter algorithm for String-to-String Correction, Discrete Optimization, 8, pp. 41-49 Charge and Reduce: A

> Fixed-Parameter Algorithm for String-to-String Correction

  1. • S. Carruthers, Y. Coady, K. Gunion, T. Milford, U. Stege (2011). Teaching Problem Solving and Computing Science in the Schools: Concepts and Assessment, in CRYSTAL Pacific Centre for Science, Mathematics and Technology Literacy: Lessons Learned over 5 Years,  L. Yore and E. van der Flier-Keller (editors), SensePublishers


  1. • F. Rosamond, R. Bardohl, G. Bolduan, S. Diehl, U. Geisler, A. Lessmoellmann, A. Schwill, U. Stege (2011), “Reaching out to the media: become a computer science ambassador,” ACM Communications, 54(3), pp. 113-116

  2. • E. Chambers, A. Erickson, S. Fekete, J. Lenchner, J. Sember, V. Srinivasan, U. Stege, S. Stolpner, C. Weibel, S. Whitesides (2010), “Connectivity graphs of uncertainty regions,” Proceedings of 21st International Symposium on Algorithms and Computation (ISAAC 2010), pp.434-445


  1. • S. Carruthers, T. Milford, T. Pelton, T., U. Stege (2010). Moving K-7 education into the information age, Proceedings of the 15th Western Canadian Conference on Computing Education (WCCCE '10), pp. 1-5

  2. • S. Diehl, M.R. Fellows, W. Hartmann, U. Stege (2010) “Preventing the Brainware Crisis: Dagstuhl Manifesto”, Informatik Spektrum, 33(3):324-326, Springer


  1. • A. Scott, U. Stege (2010) Parameterized pursuit-evasion games. Theoretical Computer Science 411(43):3845-3858

  2. • M. Barsky, U. Stege, A. Thomo (2010) A survey of practical algorithms for suffix tree construction in external memory. Software: Practice and Experience 40(11):965-988


  1. • K. Gunion, T. Milford and U. Stege (2009). The paradigm recursion: is it more accessible when introduces in middle school?” Journal of Problem Solving, vol. 2, issue 2,  pp. 142-172


  1. • M. Barsky, U. Stege, A. Thomo and C. Upton (2009).  Suffix Trees for Very Large Genomic Sequences.  Proc. of the ACM 18th Conference on Information and Knowledge Management (CIKM'09)

  2. • H.A. Müller, H.M. Kienle and U. Stege (2009).  Autonomic computing: now you see it, now you don’t—design and evolution of autonomic software systems. In Software Engineering, A. De Lucia,F. Ferrucci, (eds.), Int. Summer School Lectures, University of Salerno, LNCS 5413, pp. 32—54

  3. • S. Carruthers, K. Gunion and U. Stege (2009).  Computational biology unplugged! WCCCE '09: Proceedings of the 14th Western Canadian Conference on Computing Education (Invited Workshop)


  1. • M. Barsky, U. Stege, A. Thomo, and C. Upton (2008).  A Graph Approach to the Threshold All-Against-All Substring Matching Problem.  Journal of Experimental Algorithmics, ACM, vol. 12, pp. 1—10 (26)


  1. • S. Marczak, D. Damian, U. Stege, and A. Schröter (2008), “Information brokers in requirement-dependent social networks,” in Proc. of Requirements Engineering (RE’08)

  2. • M. Fellows, C. Knauer, N. Nishimura, P. Radge, F. Rosamond, U. Stege, D. Thilikos and S. Whitesides (2008).  Faster fixed-parameter tractable algorithms for matching and packing problems.  Algorithmica, vol. 52, no. 2, pp. 167—176

  3. • H. Romanow, A. Agah St. Pierre, U. Stege, and L. Ross (2008), “Increasing accessibility: Teaching children important Computer Science concepts without sacrificing conventional subjects of study,” Western Canadian Conf. on Computing Education (WCCCE’08), Victoria

  4. • L. Jackson, R. Dunn-Krahn, U. Stege and Y. Coady (2008).  Using video to support computer science instruction, recruitment, retention, and awareness, Western Canadian Conf. on Computing Education (WCCCE’08), Victoria

  5. • A. Scott and U. Stege (2008).  Parameterized chess. 3rd Int. Workshop on Exact and Parameterized Computation (IWPEC’08), Victoria, LNCS 5018, pp. 172-189


  1. • M. Barsky, U. Stege, A. Thomo, and C. Upton (2008).  A New Method for Indexing Genomes Using On-Disk Suffix Trees.  Proc. of the ACM 17th Conference on Information and Knowledge Management (CIKM'08), ACM

  2. • M. Barsky, U. Stege, A. Thomo, and C. Upton (2007).  Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings.  Proc. of the 7th International Symposium on Bioinformatics & Bioengineering (BIBE'07), IEEE


  1. • J. Murdoch, A. Agah St. Pierre, Y. Coady, S. Carruthers, R. Dunn-Krahn, C. Gibbs, S. Lonergan, G. Srivastava, U. Stege and O. Yazir (2007).  SPARCS from the University of Victoria: supporting sustainable and integrated outreach activities for educators and young minds.  IEEE Meeting the Growing Demand for Engineers and Their Educators 2010-2020, IEEE, Munich

  2. • E. Demaine, G. Gutin, D. Marx and U. Stege (2007).  07281 abstracts collection―structure theory and FPT algorithmics for graphs, digraphs and hypergraphs.   Internationales Begegnungs und Forshungszentrum fuer Informatik, (IBFI), July 8-13, Schloss Dagstuhl, Germany

  3. • M. Barsky, U. Stege, A. Thomo and C. Upton (2006).  A New Algorithm for Fast All-Against-All Substring Matching. Proc. of the 13th Symposium on String Processing and Information Retrieval (SPIRE'06), LNCS 4209

  4. • I. van Rooij, A. Schactman, H. Kadlec and U. Stege (2006).  Perceptual or Analytical Processing? Evidence from Children’s and Adult’s Performance on the Euclidean Traveling Salesperson Problem. Journal of Problem Solving, Volume 1, Issue 1, pp. 44-73

  5. • A. Scott, U. Stege and N. Zeh (2006). Politician’s Firefighting, ISAAC 2006, LNCS 4288, pp. 608—617.


  1. • I. van Rooij, U.Stege, and H. Kadlec.  Sources of Complexity in Subset Choice (2005).  Journal of Mathematical Psychology,, 49(2), pp. 160—187.

  2. • J. Alber, H. Fan, M. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, and U. Stege (2005). Refined Search Tree Techniques for the Planar Dominating Set Problem.  Journal of Computer and Systems Sciences, Volume 71, Issue 4, pp. 385—405.

  3. • Cheetham, J., F. Dehne, A. Rau-Chaplin, U. Stege and P. J. Taillon (2003).  Solving Large FPT Problems On Coarse Grained Parallel Machines. Journal of Computer and Systems Sciences, vol. 67, no. 4, pp. 691-706

  4. • M.R. Fellows, M.T. Hallett and U. Stege (2003).  Analogs & duals of the MAST problem for sequences & trees.  Journal of Algorithms, vol. 49. no.1, pp. 192—216

  5. • I. van Rooij, U. Stege, and A. Schactman (2003).  Convex hull and tour crossings in the Euclidean Traveling Salesperson problem: Implications for human performance studies.  Memory & Cognition, 31(2), pp. 215—220

  6. •U. Stege, I. van Rooij, A. Hertel, and P. Hertel (2003). An O(pn+1.151p)-Algorithm for p-Profit Cover and its Practical Implications for Vertex Cover. ISAAC 2002

  7. • M.R. Fellows, C. McCartin, F. Rosamond and U. Stege (2000).  Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. FST TCS 2000

  8. • U. Stege. Resolving Conflicts in Problems from Computational Biology. Doctoral Thesis, ETH Zurich, 2000.

  9. • R.G. Downey, M.R. Fellows, and U. Stege (1999). Computational Tractability: The View From Mars.  Bulletin of the EATCS 49

  10. • R.G. Downey, M.R. Fellows and U. Stege (1999).  Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability. In Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp. 49—99

  11. • M.R. Fellows, M. Hallett and U. Stege (1998). On the Multiple Gene Duplication Problem.  ISAAC'98, LNCS 1533, pp. 347—356