default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJochen Alber
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j12]Jochen Alber, Nadja Betzler, Rolf Niedermeier:
Experiments on data reduction for optimal domination in networks. Ann. Oper. Res. 146(1): 105-117 (2006)- [j11]Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. Int. J. Found. Comput. Sci. 17(6): 1467-1484 (2006) - [c12]Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier:
Matrix Robustness, with an Application to Power System Observability. ACiD 2006: 37-48 - [c11]Jochen Alber, Britta Dorn, Rolf Niedermeier:
A General Data Reduction Scheme for Domination in Graphs. SOFSEM 2006: 137-147 - 2005
- [j10]Jochen Alber, Frederic Dorn, Rolf Niedermeier:
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discret. Appl. Math. 145(2): 219-231 (2005) - [j9]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. J. Comput. Syst. Sci. 71(4): 385-405 (2005) - 2004
- [j8]Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Polynomial-time data reduction for dominating set. J. ACM 51(3): 363-384 (2004) - [j7]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1): 26-56 (2004) - [j6]Jochen Alber, Jirí Fiala:
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms 52(2): 134-151 (2004) - [j5]Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Computing the similarity of two sequences with nested arc annotations. Theor. Comput. Sci. 312(2-3): 337-358 (2004) - [c10]Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Avoiding Forbidden Submatrices by Row Deletions. SOFSEM 2004: 349-360 - 2003
- [j4]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Graph separators: a parameterized view. J. Comput. Syst. Sci. 67(4): 808-832 (2003) - [p1]Jochen Alber:
Exakte Algorithmen für NP-harte Probleme auf Netzwerken. Ausgezeichnete Informatikdissertationen 2003: 19-28 - 2002
- [b1]Jochen Alber:
Exact algorithms for NP hard problems on networks: design, analysis and implementation. University of Tübingen, Germany, 2002, pp. 1-171 - [j3]Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier:
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica 33(4): 461-493 (2002) - [c9]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. CPM 2002: 99-114 - [c8]Jochen Alber, Jirí Fiala:
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs. IFIP TCS 2002: 26-37 - [c7]Jochen Alber, Rolf Niedermeier:
Improved Tree Decomposition Based Algorithms for Domination-like Problems. LATIN 2002: 613-628 - [c6]Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. SWAT 2002: 150-159 - [i2]Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Polynomial Time Data Reduction for Dominating Set. CoRR cs.DS/0207066 (2002) - 2001
- [j2]Jochen Alber, Jens Gramm, Rolf Niedermeier:
Faster exact algorithms for hard problems: A parameterized point of view. Discret. Math. 229(1-3): 3-27 (2001) - [c5]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Graph Separators: A Parameterized View. COCOON 2001: 318-327 - [c4]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. ICALP 2001: 261-272 - [c3]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. MFCS 2001: 111-122 - [i1]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j1]Jochen Alber, Rolf Niedermeier:
On Multidimensional Curves with Hilbert Property. Theory Comput. Syst. 33(4): 295-312 (2000) - [c2]Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier:
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT 2000: 97-110
1990 – 1999
- 1998
- [c1]Jochen Alber, Rolf Niedermeier:
On Multi-dimensional Hilbert Indexings. COCOON 1998: 329-338
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
