#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1998

2006

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jochen Alber, Michael R. Fellows, Rolf Niedermeier
- J. ACM
- 2004

Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In particular, we prove that… (More)

- Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
- Algorithmica
- 2002

Abstract. We present an algorithm that constructively produces a solution to the k -DOMINATING SET problem for planar graphs in time O(c^ \sqrt k n) , where c=4^ 6\sqrt 34 . To obtain this result, we… (More)

- Jochen Alber, Jirí Fiala
- IFIP TCS
- 2002

We consider the parameterized problem, whether for a given set D of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. We expose an algorithm… (More)

- Jochen Alber, Rolf Niedermeier
- LATIN
- 2002

- Jochen Alber, Rolf Niedermeier
- Theory of Computing Systems
- 2000

Indexing schemes for grids based on space-filling curves (e.g., Hilbert curves) find applications in numerous fields, ranging from parallel processing over data structures to image processing.… (More)

- Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
- Theor. Comput. Sci.
- 2004

We present exact algorithms for the NP-complete Longest Common Subsequence problem for sequences with nested arc annotations, a problem occurring in structure comparison of RNA. Given two sequences… (More)

- Jochen Alber, Henning Fernau, Rolf Niedermeier
- Electronic Colloquium on Computational Complexity
- 2001

We discuss general techniques, centered around the “Layerwise Separation Property” (LSP) of a planar graph problem, that allow to develop algorithms with running time c √ k|G|, given an instance G of… (More)

- Jochen Alber, Jens Gramm, Rolf Niedermeier
- Discrete Mathematics
- 2001

Recent times have seen quite some progress in the development of ‘e cient’ exponential-time algorithms for NP-hard problems. These results are also tightly related to the so-called theory of xed… (More)

- Jochen Alber, Henning Fernau, Rolf Niedermeier
- J. Comput. Syst. Sci.
- 2003

Graph separation is a well-known tool to make (hard) graph problems accessible to a divide-and-conquer approach. We show how to use graph separator theorems in combination with (linear) problem… (More)

- Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
- CPM
- 2002

We present exact algorithms for the NP-complete Longest Common Subsequence problem for sequences with nested arc annotations, a problem occurring in structure comparison of RNA. Given two sequences… (More)