Ulrike Stege

Orcid: 0000-0001-9466-7196

Affiliations:
  • University of Victoria, Canada


According to our database1, Ulrike Stege authored at least 74 papers between 1997 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Shapify: Paths to SARS-CoV-2 frameshifting pseudoknot.
PLoS Comput. Biol., February, 2023

Discrete quadratic model QUBO solution landscapes.
CoRR, 2023

QWalkVis: Quantum Walks Visualization Application.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

QPLEX: Realizing the Integration of Quantum Computing into Combinatorial Optimization Software.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

2022
Supervised promoter recognition: a benchmark framework.
BMC Bioinform., 2022

A QUBO model of the RNA folding problem optimized by variational hybrid quantum annealing.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2022

Implementation and Viusalization of Quantum Walks.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2022

Towards Practical Hybrid Quantum Applications for Industry.
Proceedings of the 32nd Annual International Conference on Computer Science and Software Engineering, 2022

2021
Assessing the Molecular Specificity and Orientation Sensitivity of Infrared, Raman, and Vibrational Sum-Frequency Spectra.
Symmetry, 2021

SARS-CoV-2 Ribosomal Frameshifting Pseudoknot: Detection of Inter-viral Structural Similarity.
Proceedings of the 9th IEEE International Conference on Healthcare Informatics, 2021

Viz23: web server for visualization of gene expression and locational information.
Proceedings of the CASCON '21: Proceedings of the 31st Annual International Conference on Computer Science and Software Engineering, Toronto, Ontario, Canada, November 22, 2021

Towards practical quantum applications using hybrid problem solving techniques.
Proceedings of the CASCON '21: Proceedings of the 31st Annual International Conference on Computer Science and Software Engineering, Toronto, Ontario, Canada, November 22, 2021

2020
Correction to: A Practical, Provably Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle.
CoRR, 2020

Quantum Computing for High-School Students An Experience Report.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020

Quantum computing: synergies and opportunities.
Proceedings of the CASCON '20: Proceedings of the 30th Annual International Conference on Computer Science and Software Engineering, Toronto, Ontario, Canada, November 10, 2020

Hybrid quantum-classical problem solving in the NISQ era.
Proceedings of the CASCON '20: Proceedings of the 30th Annual International Conference on Computer Science and Software Engineering, Toronto, Ontario, Canada, November 10, 2020

2019
Profit Parameterizations of Dominating Set.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
The Role of the Goal in Solving Hard Computational Problems: Do People Really Optimize?
J. Probl. Solving, 2018

Connecting a set of circles with minimum sum of radii.
Comput. Geom., 2018

2017
Guest Editors’ Introduction.
J. Probl. Solving, 2017

Connectivity Graphs of Uncertainty Regions.
Algorithmica, 2017

Cognitive intelligent personal assistants / agents.
Proceedings of the 27th Annual International Conference on Computer Science and Software Engineering, 2017

Foodie fooderson a conversational agent for the smart kitchen.
Proceedings of the 27th Annual International Conference on Computer Science and Software Engineering, 2017

2016
LiveTalk: A Framework for Collaborative Browser-Based Replicated-Computation Applications.
Proceedings of the 28th International Teletraffic Congress, 2016

Base64Geo: an efficient data structure and transmission format for large, dense, scalar GIS datasets.
Proceedings of the 26th Annual International Conference on Computer Science and Software Engineering, 2016

2015
The Ignite Distributed Collaborative Visualization System.
SIGMETRICS Perform. Evaluation Rev., 2015

k-Attribute-Anonymity is hard even for k=2.
Inf. Process. Lett., 2015

A Provably, Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle.
CoRR, 2015

The Ignite Distributed Collaborative Scientific Visualization System.
Proceedings of the 7th IEEE International Conference on Cloud Computing Technology and Science, 2015

Reconfiguring a Chain of Cubes.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Towards software-adaptive green computing based on server power consumption.
Proceedings of the 3rd International Workshop on Green and Sustainable Software, 2014

How do biological networks differ from social networks? (an experimental study).
Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014

2013
On Evaluating Human Problem Solving of Computationally Hard Problems.
J. Probl. Solving, 2013

2012
Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover.
J. Probl. Solving, 2012

The Impact of Parameterized Complexity to Interdisciplinary Problem Solving.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

A Framework for Classification of Resource Consolidation Management Problems.
Proceedings of the 2012 IEEE Fifth International Conference on Cloud Computing, 2012

2011
Full-Text (Substring) Indexes in External Memory
Synthesis Lectures on Data Management, Morgan & Claypool Publishers, ISBN: 978-3-031-01885-5, 2011

Suffix trees for inputs larger than main memory.
Inf. Syst., 2011

Charge and reduce: A fixed-parameter algorithm for String-to-String Correction.
Discret. Optim., 2011

Reaching out to the media: become a computer science ambassador.
Commun. ACM, 2011

Draw a social network.
Proceedings of the 16th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2011

Characterizing problems for realizing policies in self-adaptive and self-managing systems.
Proceedings of the 2011 ICSE Symposium on Software Engineering for Adaptive and Self-Managing Systems, 2011

2010
Parameterized pursuit-evasion games.
Theor. Comput. Sci., 2010

A survey of practical algorithms for suffix tree construction in external memory.
Softw. Pract. Exp., 2010

Moving K-7 education into the information age.
Proceedings of the 15th Western Canadian Conference on Computing Education, 2010

A Fixed-Parameter Algorithm for String-to-String Correction.
Proceedings of the Theory of Computing 2010, 2010

2009
The Paradigm Recursion: Is It More Accessible When Introduced in Middle School?
J. Probl. Solving, 2009

Curing recursion aversion.
Proceedings of the 14th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2009

09142 Manifesto - Perspectives Workshop: Preventing the Brainware Crisis.
Proceedings of the Perspectives Workshop: Preventing the Brainware Crisis, 31.03., 2009

Suffix trees for very large genomic sequences.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

2008
A graph approach to the threshold all-against-all substring matching problem.
ACM J. Exp. Algorithmics, 2008

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Algorithmica, 2008

Information Brokers in Requirement-Dependency Social Networks.
Proceedings of the 16th IEEE International Requirements Engineering Conference, 2008

Parameterized Chess.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Autonomic Computing Now You See It, Now You Don't.
Proceedings of the Software Engineering, International Summer Schools, 2008

A new method for indexing genomes using on-disk suffix trees.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs.
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007

07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007

Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings.
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

2006
Perceptual or Analytical Processing? Evidence from Children's and Adult's Performance on the Euclidean Traveling Salesperson Problem.
J. Probl. Solving, 2006

A New Algorithm for Fast All-Against-All Substring Matching.
Proceedings of the String Processing and Information Retrieval, 2006

Politician's Firefighting.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005
A refined search tree technique for Dominating Set on planar graphs.
J. Comput. Syst. Sci., 2005

2003
Solving large FPT problems on coarse-grained parallel machines.
J. Comput. Syst. Sci., 2003

Analogs & duals of the MAST problem for sequences & trees.
J. Algorithms, 2003

A Parallel FPT Application For Clusters.
Proceedings of the 3rd IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2003), 2003

2002
An O(pn + 1.151<sup>p</sup>)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2000
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999
Computational Tractability: The View From Mars.
Bull. EATCS, 1999

Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
On the Multiple Gene Duplication Problem.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Analogs and Duals of the MAST Problem for Sequences and Trees.
Proceedings of the Algorithms, 1998

1997
Parameterized complexity: A framework for systematically confronting computational intractability.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997


  Loading...