The following pages link to Ulrike Stege (Q456694):
Displaying 25 items.
- Charge and reduce: A fixed-parameter algorithm for string-to-string correction (Q456695) (← links)
- \(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690) (← links)
- Parameterized pursuit-evasion games (Q604466) (← links)
- Minesweeper may not be NP-complete but is hard nonetheless (Q660171) (← links)
- (Q958208) (redirect page) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- Connecting a set of circles with minimum sum of radii (Q1699280) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- Connectivity graphs of uncertainty regions (Q2408099) (← links)
- Sources of complexity in subset choice (Q2483826) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- (Q3024787) (← links)
- Parameterized Chess (Q3503588) (← links)
- (Q4249534) (← links)
- (Q4252027) (← links)
- (Q4263467) (← links)
- (Q4425960) (← links)
- (Q4472448) (← links)
- (Q4779138) (← links)
- Analogs & duals of the MAST problem for sequences & trees (Q4820910) (← links)
- (Q4940885) (← links)
- A graph approach to the threshold all-against-all substring matching problem (Q5269280) (← links)
- Politician’s Firefighting (Q5459155) (← links)
- Algorithms – ESA 2004 (Q5464589) (← links)
