Demo Data from EDBT 2026 / reviewers in the wild / expert
Jochen Alber
dblp:39/5831
· DBLP profile ↗
15ranked-venue papers
14as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 11 · 11 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Graph algorithms and graph theory · 59% Computational complexity · 29% Algorithms and data structures · 12% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory
dominating set |
0.0 | 1 | 2004 | Polynomial-time data reduction for dominating set · J. ACM 2004 |
Graph algorithms and graph theory
graph algorithms |
0.0 | 1 | 2004 | Polynomial-time data reduction for dominating set · J. ACM 2004 |
Computational complexity › parameterized complexity
kernelization |
0.0 | 1 | 2004 | Polynomial-time data reduction for dominating set · J. ACM 2004 |
Algorithms and data structures
parameterized algorithms |
0.0 | 1 | 2001 | Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems · ICALP 2001 |
Computational complexity
parameterized complexity |
0.0 | 1 | 2001 | Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems · ICALP 2001 |
Graph algorithms and graph theory
planar graphs |
0.0 | 1 | 2001 | Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems · ICALP 2001 |
Graph algorithms and graph theory › planar graphs
planar graph problems |
0.0 | 1 | 2001 | Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems · ICALP 2001 |
Methods — techniques the papers use, named apart from their topics
data reduction rules · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | A General Data Reduction Scheme for Domination in Graphs
Jochen Alber, Britta Dorn, Rolf Niedermeier |
SOFSEM | 1 |
| 2005 | Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Jochen Alber, Frederic Dorn, Rolf Niedermeier |
Discret. Appl. Math. | 1 |
| 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. | 1 |
| 2004 | Avoiding Forbidden Submatrices by Row Deletions
Sebastian Wernicke 0001, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier |
SOFSEM | 2 |
| 2004 | Polynomial-time data reduction for dominating setabstractDealing 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 Dominating Set restricted to planar graphs has a so-called problem kernel of linear size, achieved by two simple and easy-to-implement reduction rules. Moreover, having implemented our reduction rules, first experiments indicate the impressive practical potential of these rules. Thus, this work seems to open up a new and prospective way how to cope with one of the most important problems in graph theory and combinatorial optimization. Jochen Alber, Michael R. Fellows, Rolf Niedermeier |
J. ACM | 1 |
| 2004 | Computing the similarity of two sequences with nested arc annotations
Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier |
Theor. Comput. Sci. | 1 |
| 2003 | Graph separators: a parameterized view
Jochen Alber, Henning Fernau, Rolf Niedermeier |
J. Comput. Syst. Sci. | 1 |
| 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 |
CPM | 1 |
| 2002 | Improved Tree Decomposition Based Algorithms for Domination-like Problems
Jochen Alber, Rolf Niedermeier |
LATIN | 1 |
| 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 | 1 |
| 2001 | Graph Separators: A Parameterized View
Jochen Alber, Henning Fernau, Rolf Niedermeier |
COCOON | 1 |
| 2001 | Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
Jochen Alber, Henning Fernau, Rolf Niedermeier |
ICALP | 1 |
| 2001 | 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 |
MFCS | 1 |
| 2000 | On Multidimensional Curves with Hilbert Property
Jochen Alber, Rolf Niedermeier |
Theory Comput. Syst. | 1 |
| 1998 | On Multi-dimensional Hilbert Indexings
Jochen Alber, Rolf Niedermeier |
COCOON | 1 |