Jochen Alber

1.5k total citations
17 papers, 455 citations indexed

About

Jochen Alber is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Jochen Alber has authored 17 papers receiving a total of 455 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 6 papers in Computer Networks and Communications and 3 papers in Computer Vision and Pattern Recognition. Recurrent topics in Jochen Alber's work include Advanced Graph Theory Research (11 papers), Complexity and Algorithms in Graphs (9 papers) and Optimization and Search Problems (5 papers). Jochen Alber is often cited by papers focused on Advanced Graph Theory Research (11 papers), Complexity and Algorithms in Graphs (9 papers) and Optimization and Search Problems (5 papers). Jochen Alber collaborates with scholars based in Germany, Australia and Netherlands. Jochen Alber's co-authors include Rolf Niedermeier, Michael R. Fellows, Henning Fernau, Hans L. Bodlaender, Ton Kloks, Jens Gramm, Jiřı́ Fiala, Nadja Betzler, Frederic Dorn and Jiong Guo and has published in prestigious journals such as Journal of the ACM, Annals of Operations Research and Theoretical Computer Science.

In The Last Decade

Jochen Alber

16 papers receiving 400 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jochen Alber Germany	11	373	193	74	44	30	17	455
Naomi Nishimura Canada	12	300 0.8×	180 0.9×	79 1.1×	45 1.0×	18 0.6×	34	385
Toshihiro Fujito Japan	10	287 0.8×	193 1.0×	45 0.6×	50 1.1×	23 0.8×	25	386
Avner Magen Canada	12	220 0.6×	70 0.4×	117 1.6×	67 1.5×	14 0.5×	32	325
Igor Razgon Ireland	11	370 1.0×	141 0.7×	51 0.7×	14 0.3×	48 1.6×	24	424
Leizhen Cai Hong Kong	12	474 1.3×	170 0.9×	49 0.7×	41 0.9×	33 1.1×	30	535
Janka Chlebı́ková Slovakia	8	241 0.6×	138 0.7×	32 0.4×	38 0.9×	11 0.4×	25	327
Dana Moshkovitz United States	7	184 0.5×	85 0.4×	120 1.6×	29 0.7×	21 0.7×	29	288
A. V. Pyatkin Russia	12	231 0.6×	65 0.3×	93 1.3×	50 1.1×	15 0.5×	63	404
Petr Hliněný Czechia	13	507 1.4×	132 0.7×	60 0.8×	131 3.0×	27 0.9×	79	576
Yngve Villanger Norway	17	604 1.6×	233 1.2×	97 1.3×	13 0.3×	61 2.0×	46	675

Countries citing papers authored by Jochen Alber

Since Specialization

Citations

This map shows the geographic impact of Jochen Alber's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jochen Alber with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jochen Alber more than expected).

Fields of papers citing papers by Jochen Alber

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jochen Alber. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jochen Alber. The network helps show where Jochen Alber may publish in the future.

Co-authorship network of co-authors of Jochen Alber

This figure shows the co-authorship network connecting the top 25 collaborators of Jochen Alber. A scholar is included among the top collaborators of Jochen Alber based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jochen Alber. Jochen Alber is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

17 of 17 papers shown

Alber, Jochen, et al.. (2006). Observability of Power Systems based on Fast Pseudorank Calculation of Sparse Sensitivity Matrices. 127–132. 7 indexed citations

Wernicke, Sebastian, Jochen Alber, Jens Gramm, Jiong Guo, & Rolf Niedermeier. (2006). THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS. International Journal of Foundations of Computer Science. 17(6). 1467–1484. 1 indexed citations

Alber, Jochen, Nadja Betzler, & Rolf Niedermeier. (2006). Experiments on data reduction for optimal domination in networks. Annals of Operations Research. 146(1). 105–117. 26 indexed citations

Alber, Jochen, Michael R. Fellows, Henning Fernau, et al.. (2004). A refined search tree technique for Dominating Set on planar graphs. Journal of Computer and System Sciences. 71(4). 385–405. 24 indexed citations

Alber, Jochen, Frederic Dorn, & Rolf Niedermeier. (2004). Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discrete Applied Mathematics. 145(2). 219–231. 16 indexed citations

Alber, Jochen, Michael R. Fellows, & Rolf Niedermeier. (2004). Polynomial-time data reduction for dominating set. Journal of the ACM. 51(3). 363–384. 108 indexed citations

Alber, Jochen & Jiřı́ Fiala. (2004). Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. Journal of Algorithms. 52(2). 134–151. 22 indexed citations

Alber, Jochen, Henning Fernau, & Rolf Niedermeier. (2003). Graph separators: a parameterized view. Journal of Computer and System Sciences. 67(4). 808–832. 16 indexed citations

Alber, Jochen, Jens Gramm, Jiong Guo, & Rolf Niedermeier. (2003). Computing the similarity of two sequences with nested arc annotations. Theoretical Computer Science. 312(2-3). 337–358. 14 indexed citations

10.

Alber, Jochen, Hans L. Bodlaender, Henning Fernau, Ton Kloks, & Rolf Niedermeier. (2002). Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica. 33(4). 461–493. 124 indexed citations

11.

Alber, Jochen, et al.. (2002). Towards Optimally Solving the Longest Common Subsequence Problem for Sequences with Nested Arc Annotations in Linear Time. 2 indexed citations

12.

Alber, Jochen. (2002). Exact Algorithms for NP-hard Problems on Networks: Design, Analysis, and Implementation. 10 indexed citations

13.

Alber, Jochen, Jens Gramm, & Rolf Niedermeier. (2001). Faster exact algorithms for hard problems: A parameterized point of view. Discrete Mathematics. 229(1-3). 3–27. 40 indexed citations

14.

Alber, Jochen, Henning Fernau, & Rolf Niedermeier. (2001). Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. Lecture notes in computer science. 52(1). 26–272. 4 indexed citations

15.

Alber, Jochen. (2001). On implemented semigroups. Semigroup Forum. 63(3). 371–386. 12 indexed citations

16.

Alber, Jochen, Hans L. Bodlaender, Henning Fernau, & Rolf Niedermeier. (2000). Fixed parameter algorithms for planar dominating set. Utrecht University Repository (Utrecht University). 1 indexed citations

17.

Alber, Jochen & Rolf Niedermeier. (2000). On Multidimensional Curves with Hilbert Property. Theory of Computing Systems. 33(4). 295–312. 28 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact