The following pages link to Jochen Alber (Q175573):
Displayed 24 items.
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- Item:Q175573 (redirect page) (← links)
- On multidimensional curves with Hilbert property (Q1587370) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs (Q1849745) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- (Q2721971) (← links)
- (Q3044360) (← links)
- (Q3046487) (← links)
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
- Polynomial-time data reduction for dominating set (Q3583575) (← links)
- (Q4218436) (← links)
- (Q4535799) (← links)
- (Q4551370) (← links)
- (Q4737693) (← links)
- (Q4779138) (← links)
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs (Q4815769) (← links)
- Parameterized complexity: exponential speed-up for planar graph problems (Q4828563) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5897978) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902007) (← links)
- Faster exact algorithms for hard problems: A parameterized point of view (Q5931443) (← links)
- On implemented semigroups (Q5952239) (← links)