Ulrike Stege

Available identifiers

zbMath Open stege.ulrikeMaRDI QIDQ456694

List of research outcomes

Publication	Date of Publication	Type
Profit parameterizations of \textsc{Dominating Set}	2024-02-23	Paper
Connecting a set of circles with minimum sum of radii	2018-02-19	Paper
Connectivity graphs of uncertainty regions	2017-10-09	Paper
A graph approach to the threshold all-against-all substring matching problem	2017-06-15	Paper
\(k\)-attribute-anonymity is hard even for \(k=2\)	2014-12-09	Paper
Charge and reduce: A fixed-parameter algorithm for string-to-string correction	2012-10-16	Paper
The Impact of Parameterized Complexity to Interdisciplinary Problem Solving	2012-09-05	Paper
Minesweeper may not be NP-complete but is hard nonetheless	2012-01-29	Paper
Connecting a set of circles with minimum sum of radii	2011-08-12	Paper
Connectivity graphs of uncertainty regions	2010-12-09	Paper
Parameterized pursuit-evasion games	2010-11-11	Paper
Faster fixed-parameter tractable algorithms for matching and packing problems	2008-12-02	Paper
Parameterized Chess	2008-06-05	Paper
Politician’s Firefighting	2008-04-24	Paper
A refined search tree technique for dominating set on planar graphs	2005-12-07	Paper
Algorithms – ESA 2004	2005-08-18	Paper
Sources of complexity in subset choice	2005-08-01	Paper
https://portal.mardi4nfdi.de/entity/Q3024787	2005-07-04	Paper
Analogs & duals of the MAST problem for sequences & trees	2004-10-01	Paper
Solving large FPT problems on coarse-grained parallel machines	2004-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q4472448	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4425960	2003-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q4779138	2002-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4263467	2000-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q4940885	2000-04-06	Paper
https://portal.mardi4nfdi.de/entity/Q4252027	2000-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4249534	1999-11-10	Paper

Research outcomes over time

This page was built for person: Ulrike Stege