Jochen Alber

According to our database, Jochen Alber authored at least 22 papers between 1998 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.

Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier

Int. J. Found. Comput. Sci., 2006

Experiments on data reduction for optimal domination in networks.

Jochen Alber, Nadja Betzler, Rolf Niedermeier

Ann. Oper. Res., 2006

A General Data Reduction Scheme for Domination in Graphs.

Jochen Alber, Britta Dorn, Rolf Niedermeier

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Matrix Robustness, with an Application to Power System Observability.

Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005

A refined search tree technique for Dominating Set on planar graphs.

Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege

J. Comput. Syst. Sci., 2005

Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs.

Jochen Alber, Frederic Dorn, Rolf Niedermeier

Discret. Appl. Math., 2005

2004

Computing the similarity of two sequences with nested arc annotations.

Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier

Theor. Comput. Sci., 2004

Geometric separation and exact solutions for the parameterized independent set problem on disk graphs.

Jochen Alber, Jirí Fiala

J. Algorithms, 2004

Polynomial-time data reduction for dominating set.

Jochen Alber, Michael R. Fellows, Rolf Niedermeier

J. ACM, 2004

Avoiding Forbidden Submatrices by Row Deletions.

Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier

Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

2003

Graph separators: a parameterized view.

Jochen Alber, Henning Fernau, Rolf Niedermeier

J. Comput. Syst. Sci., 2003

Exakte Algorithmen für NP-harte Probleme auf Netzwerken.

Jochen Alber

Proceedings of the Ausgezeichnete Informatikdissertationen 2003, 2003

2002

Exact algorithms for NP hard problems on networks: design, analysis and implementation.

Jochen Alber

PhD thesis, 2002

Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs.

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

Algorithmica, 2002

Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.

Jochen Alber, Michael R. Fellows, Rolf Niedermeier

Proceedings of the Algorithm Theory, 2002

Improved Tree Decomposition Based Algorithms for Domination-like Problems.

Jochen Alber, Rolf Niedermeier

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time.

Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

Jochen Alber, Henning Fernau, Rolf Niedermeier

Electron. Colloquium Comput. Complex., 2001

Faster exact algorithms for hard problems: A parameterized point of view.

Jochen Alber, Jens Gramm, Rolf Niedermeier

Discret. Math., 2001

2000

On Multidimensional Curves with Hilbert Property.

Jochen Alber, Rolf Niedermeier

Theory Comput. Syst., 2000

Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems.

Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier

Proceedings of the Algorithm Theory, 2000

1998

On Multi-dimensional Hilbert Indexings.

Jochen Alber, Rolf Niedermeier

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998