Search the dblp DataBase
Jochen Alber: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier
Matrix Robustness, with an Application to Power System Observability. [Citation Graph (0, 0)][DBLP]
ACiD, 2006, pp:37-48 [Conf] - Jochen Alber, Henning Fernau, Rolf Niedermeier
Graph Separators: A Parameterized View. [Citation Graph (0, 0)][DBLP]
COCOON, 2001, pp:318-327 [Conf] - Jochen Alber, Rolf Niedermeier
On Multi-dimensional Hilbert Indexings. [Citation Graph (0, 0)][DBLP]
COCOON, 1998, pp:329-338 [Conf] - Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. [Citation Graph (0, 0)][DBLP]
CPM, 2002, pp:99-114 [Conf] - Jochen Alber, Henning Fernau, Rolf Niedermeier
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. [Citation Graph (0, 0)][DBLP]
ICALP, 2001, pp:261-272 [Conf] - Jochen Alber, Jirí Fiala
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs. [Citation Graph (0, 0)][DBLP]
IFIP TCS, 2002, pp:26-37 [Conf] - Jochen Alber, Rolf Niedermeier
Improved Tree Decomposition Based Algorithms for Domination-like Problems. [Citation Graph (0, 0)][DBLP]
LATIN, 2002, pp:613-628 [Conf] - Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
Refined Search Tree Technique for DOMINATING SET on Planar Graphs. [Citation Graph (0, 0)][DBLP]
MFCS, 2001, pp:111-122 [Conf] - Jochen Alber, Britta Dorn, Rolf Niedermeier
A General Data Reduction Scheme for Domination in Graphs. [Citation Graph (0, 0)][DBLP]
SOFSEM, 2006, pp:137-147 [Conf] - Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
Avoiding Forbidden Submatrices by Row Deletions. [Citation Graph (0, 0)][DBLP]
SOFSEM, 2004, pp:349-360 [Conf] - Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. [Citation Graph (0, 0)][DBLP]
SWAT, 2000, pp:97-110 [Conf] - Jochen Alber, Michael R. Fellows, Rolf Niedermeier
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:150-159 [Conf] - Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2002, v:33, n:4, pp:461-493 [Journal] - Jochen Alber, Michael R. Fellows, Rolf Niedermeier
Polynomial Time Data Reduction for Dominating Set [Citation Graph (0, 0)][DBLP]
CoRR, 2002, v:0, n:, pp:- [Journal] - Jochen Alber, Frederic Dorn, Rolf Niedermeier
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2005, v:145, n:2, pp:219-231 [Journal] - Jochen Alber, Jens Gramm, Rolf Niedermeier
Faster exact algorithms for hard problems: A parameterized point of view. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2001, v:229, n:1-3, pp:3-27 [Journal] - Jochen Alber, Henning Fernau, Rolf Niedermeier
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:23, pp:- [Journal] - Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1467-1484 [Journal] - Jochen Alber, Michael R. Fellows, Rolf Niedermeier
Polynomial-time data reduction for dominating set. [Citation Graph (0, 0)][DBLP]
J. ACM, 2004, v:51, n:3, pp:363-384 [Journal] - Jochen Alber, Jirí Fiala
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2004, v:52, n:2, pp:134-151 [Journal] - Jochen Alber, Henning Fernau, Rolf Niedermeier
Parameterized complexity: exponential speed-up for planar graph problems. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2004, v:52, n:1, pp:26-56 [Journal] - Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
A refined search tree technique for Dominating Set on planar graphs. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 2005, v:71, n:4, pp:385-405 [Journal] - Jochen Alber, Henning Fernau, Rolf Niedermeier
Graph separators: a parameterized view. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 2003, v:67, n:4, pp:808-832 [Journal] - Jochen Alber, Rolf Niedermeier
On Multidimensional Curves with Hilbert Property. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2000, v:33, n:4, pp:295-312 [Journal] - Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
Computing the similarity of two sequences with nested arc annotations. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2004, v:312, n:2-3, pp:337-358 [Journal]
Search in 0.004secs, Finished in 0.005secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002