default search action
Ulrike Stege
Person information
- affiliation: University of Victoria, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j24]Luke Trinity, Ian Wark, Lance Lansing, Hosna Jabbari, Ulrike Stege:
Shapify: Paths to SARS-CoV-2 frameshifting pseudoknot. PLoS Comput. Biol. 19(2) (2023) - [c47]Addie Jordon, Austin Hawkins-Seagram, Samantha Norrie, José Ossorio, Ulrike Stege:
QWalkVis: Quantum Walks Visualization Application. QCE 2023: 87-93 - [c46]Juan Giraldo, José Ossorio, Norha M. Villegas, Gabriel Tamura, Ulrike Stege:
QPLEX: Realizing the Integration of Quantum Computing into Combinatorial Optimization Software. QCE 2023: 1044-1049 - [i9]Tristan Zaborniak, Ulrike Stege:
Discrete quadratic model QUBO solution landscapes. CoRR abs/2305.00568 (2023) - [i8]Juan Giraldo, José Ossorio, Norha M. Villegas, Gabriel Tamura, Ulrike Stege:
QPLEX: Realizing the Integration of Quantum Computing into Combinatorial Optimization Software. CoRR abs/2307.14308 (2023) - 2022
- [j23]Raul I. Perez Martell, Alison Ziesel, Hosna Jabbari, Ulrike Stege:
Supervised promoter recognition: a benchmark framework. BMC Bioinform. 23(1): 118 (2022) - [c45]Mehdi Bozzo-Rey, Sean Wagner, Robert Loredo, Ulrike Stege, Hausi A. Müller, Prashanti Priya Angara:
Towards Practical Hybrid Quantum Applications for Industry. CASCON 2022: 245-247 - [c44]Tristan Zaborniak, Juan Giraldo, Hausi A. Müller, Hosna Jabbari, Ulrike Stege:
A QUBO model of the RNA folding problem optimized by variational hybrid quantum annealing. QCE 2022: 174-185 - [c43]Addie Jordon, Austin Hawkins-Seagram, Ulrike Stege:
Implementation and Viusalization of Quantum Walks. QCE 2022: 796-798 - 2021
- [j22]Fei Chen, Lea Gozdzialski, Kuo-Kai Hung, Ulrike Stege, Dennis K. Hore:
Assessing the Molecular Specificity and Orientation Sensitivity of Infrared, Raman, and Vibrational Sum-Frequency Spectra. Symmetry 13(1): 42 (2021) - [c42]Luke Trinity, Andrew Hollar, Haley Greenyer, Hosna Jabbari, Ulrike Stege:
Viz23: web server for visualization of gene expression and locational information. CASCON 2021: 268-273 - [c41]Mehdi Bozzo-Rey, Robert Loredo, Hausi A. Müller, Sean Wagner, Ulrike Stege, Prashanti Priya Angara:
Towards practical quantum applications using hybrid problem solving techniques. CASCON 2021: 305-307 - [c40]Luke Trinity, Lance Lansing, Hosna Jabbari, Ulrike Stege:
SARS-CoV-2 Ribosomal Frameshifting Pseudoknot: Detection of Inter-viral Structural Similarity. ICHI 2021: 451-460 - 2020
- [c39]Prashanti Priya Angara, Ulrike Stege, Hausi A. Müller, Mehdi Bozzo-Rey:
Hybrid quantum-classical problem solving in the NISQ era. CASCON 2020: 247-252 - [c38]Mehdi Bozzo-Rey, Robert Loredo, Hausi A. Müller, Ulrike Stege:
Quantum computing: synergies and opportunities. CASCON 2020: 275-276 - [c37]Prashanti Priya Angara, Ulrike Stege, Andrew MacLean:
Quantum Computing for High-School Students An Experience Report. QCE 2020: 323-329 - [i7]John Ellis, Ulrike Stege:
Correction to: A Practical, Provably Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle. CoRR abs/2004.02035 (2020)
2010 – 2019
- 2019
- [c36]Henning Fernau, Ulrike Stege:
Profit Parameterizations of Dominating Set. AAIM 2019: 108-120 - 2018
- [j21]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a set of circles with minimum sum of radii. Comput. Geom. 68: 62-76 (2018) - [j20]Sarah Carruthers, Ulrike Stege, Michael E. J. Masson:
The Role of the Goal in Solving Hard Computational Problems: Do People Really Optimize? J. Probl. Solving 11(1) (2018) - 2017
- [j19]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, S. Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity Graphs of Uncertainty Regions. Algorithmica 78(3): 990-1019 (2017) - [j18]Sarah Carruthers, Ulrike Stege:
Guest Editors’ Introduction. J. Probl. Solving 10(1) (2017) - [c35]Prashanti Angara, Miguel Jiménez, Kirti Agarwal, Harshit Jain, Roshni Jain, Ulrike Stege, Sudhakar Ganti, Hausi A. Müller, Joanna W. Ng:
Foodie fooderson a conversational agent for the smart kitchen. CASCON 2017: 247-253 - [c34]Hausi A. Müller, Norha M. Villegas, Ulrike Stege, Yu Zhao:
Cognitive intelligent personal assistants / agents. CASCON 2017: 294 - 2016
- [c33]Matthew Hemmings, Rick McGeer, Glenn Ricart, Ulrike Stege:
Base64Geo: an efficient data structure and transmission format for large, dense, scalar GIS datasets. CASCON 2016: 106-115 - [c32]Matthew Hemmings, Daniel Ingalls, Robert Krahn, Rick McGeer, Glenn Ricart, Marko Röder, Ulrike Stege:
LiveTalk: A Framework for Collaborative Browser-Based Replicated-Computation Applications. ITC 2016: 270-277 - 2015
- [j17]Allan Scott, Srinivasan Venkatesh, Ulrike Stege:
k-Attribute-Anonymity is hard even for k=2. Inf. Process. Lett. 115(2): 368-370 (2015) - [j16]Sushil Bhojwani, Matt Hemmings, Dan Ingalls, Jens Lincke, Robert Krahn, David John Lary, Rick McGeer, Glenn Ricart, Marko Röder, Yvonne Coady, Ulrike Stege:
The Ignite Distributed Collaborative Visualization System. SIGMETRICS Perform. Evaluation Rev. 43(3): 45-46 (2015) - [c31]Laurie J. Heyer, Anna Lubiw, Debajyoti Mondal, Ulrike Stege, Sue Whitesides:
Reconfiguring a Chain of Cubes. CCCG 2015 - [c30]Sushil Bhojwani, Matthew Hemmings, Daniel Ingalls, Jens Lincke, Robert Krahn, David John Lary, Patrick C. McGeer, Glenn Ricart, Marko Röder, Yvonne Coady, Ulrike Stege:
The Ignite Distributed Collaborative Scientific Visualization System. CloudCom 2015: 186-191 - [e3]Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege:
Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings. Lecture Notes in Computer Science 9214, Springer 2015, ISBN 978-3-319-21839-7 [contents] - [i6]John Ellis, Ulrike Stege:
A Provably, Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle. CoRR abs/1508.00292 (2015) - 2014
- [c29]Tatiana Gutierrez-Bunster, Ulrike Stege, Alex Thomo, John Taylor:
How do biological networks differ from social networks? (an experimental study). ASONAM 2014: 744-751 - [c28]Andreas Bergen, Ronald J. Desmarais, Sudhakar Ganti, Ulrike Stege:
Towards software-adaptive green computing based on server power consumption. GREENS 2014: 9-16 - 2013
- [j15]Sarah Carruthers, Ulrike Stege:
On Evaluating Human Problem Solving of Computationally Hard Problems. J. Probl. Solving 5(2) (2013) - 2012
- [j14]Sarah Carruthers, Michael E. J. Masson, Ulrike Stege:
Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover. J. Probl. Solving 5(1) (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, ISBN 978-3-031-00757-6 - [j13]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) - [j12]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. Discret. Optim. 8(1): 41-49 (2011) - [j11]Marina Barsky, Ulrike Stege, Alex Thomo:
Suffix trees for inputs larger than main memory. Inf. Syst. 36(3): 644-654 (2011) - [c24]Sowmya Balasubramanian, Ronald J. 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 M. 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, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a Set of Circles with Minimum Sum of Radii. WADS 2011: 183-194 - [i5]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a Set of Circles with Minimum Sum of Radii. CoRR abs/1105.0791 (2011) - 2010
- [j10]Marina Barsky, Ulrike Stege, Alex Thomo:
A survey of practical algorithms for suffix tree construction in external memory. Softw. Pract. Exp. 40(11): 965-988 (2010) - [j9]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, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity Graphs of Uncertainty Regions. ISAAC (2) 2010: 434-445 - [c19]Sarah Carruthers, Todd M. Milford, Timothy Pelton, Ulrike Stege:
Moving K-7 education into the information age. WCCCE 2010: 11:1-11:5 - [i4]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity graphs of uncertainty regions. CoRR abs/1009.3469 (2010)
2000 – 2009
- 2009
- [j8]Katherine Gunion, Todd M. Milford, Ulrike Stege:
The Paradigm Recursion: Is It More Accessible When Introduced in Middle School? J. Probl. Solving 2(2) (2009) - [c18]Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton:
Suffix trees for very large genomic sequences. CIKM 2009: 1417-1420 - [c17]Katherine Gunion, Todd M. Milford, Ulrike Stege:
Curing recursion aversion. ITiCSE 2009: 124-128 - [e2]Stephan Diehl, Michael R. Fellows, Ulrike Stege:
Perspectives Workshop: Preventing the Brainware Crisis, 31.03. - 03.04.2009. Dagstuhl Seminar Proceedings 09142, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i3]Stephan Diehl, Ulrike Stege:
09142 Manifesto - Perspectives Workshop: Preventing the Brainware Crisis. Perspectives Workshop: Preventing the Brainware Crisis 2009 - 2008
- [j7]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) - [j6]Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton:
A graph approach to the threshold all-against-all substring matching problem. ACM J. Exp. Algorithmics 12: 1.10:1-1.10:26 (2008) - [c16]Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton:
A new method for indexing genomes using on-disk suffix trees. CIKM 2008: 649-658 - [c15]Hausi A. Müller, Holger M. Kienle, Ulrike Stege:
Autonomic Computing Now You See It, Now You Don't. ISSSE 2008: 32-54 - [c14]Allan Scott, Ulrike Stege:
Parameterized Chess. IWPEC 2008: 172-189 - [c13]Sabrina Marczak, Daniela E. Damian, Ulrike Stege, Adrian Schröter:
Information Brokers in Requirement-Dependency Social Networks. RE 2008: 53-62 - 2007
- [c12]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 - [e1]Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege:
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 [contents] - [i2]Erik D. Demaine, Gregory Z. 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 - [i1]Erik D. Demaine, Gregory Z. 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
- [j5]Iris van Rooij, Alissa Schactman, Helena Kadlec, Ulrike Stege:
Perceptual or Analytical Processing? Evidence from Children's and Adult's Performance on the Euclidean Traveling Salesperson Problem. J. Probl. Solving 1(1) (2006) - [c11]Allan E. Scott, Ulrike Stege, Norbert Zeh:
Politician's Firefighting. ISAAC 2006: 608-617 - [c10]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
- [c9]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) - [c8]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
- [c7]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
- [c6]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
- [c5]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. Bull. EATCS 69: 73-97 (1999) - [c4]Ulrike Stege:
Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable. WADS 1999: 288-293 - 1998
- [c3]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 - [c2]Michael R. Fellows, Michael T. Hallett, Ulrike Stege:
On the Multiple Gene Duplication Problem. ISAAC 1998: 347-356 - 1997
- [c1]Rodney G. Downey, Michael R. Fellows, Ulrike Stege:
Parameterized complexity: A framework for systematically confronting computational intractability. Contemporary Trends in Discrete Mathematics 1997: 49-99
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint