Norbert Blüm
-
- Advanced Graph Theory Research 7
- semigroups and automata theory 6
- Complexity and Algorithms in Graphs 4
- Computability, Logic, AI Algorithms 2
- Artificial Intelligence top 10%
- Algorithms and Data Compression 5
-
- DNA and Biological Computing 4
-
- graph theory and CDMA systems 3
-
- Graph theory and applications 3
- Co-authors
- Kurt MehlhornHans Wilhelm AltMichael T. Y. PaulRobert J. KochYan LiangHans Friedrich Zacher
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
- Journals
- Theoretical Computer Science (5 papers)Acta Informatica (2 papers)Journal of Algorithms (1 paper)
- Partner nations
- GermanyUnited States
In The Last Decade
Norbert Blüm
21 papers receiving 270 citations
Peers
Comparison fields: 5 of 41
- Computational Theory and Mathematics 182
- Discrete Mathematics and Combinatorics 20
- Computer Graphics and Computer-Aided Design 16
- Artificial Intelligence 145
- Computer Networks and Communications 98
Countries citing papers authored by Norbert Blüm
This map shows the geographic impact of Norbert Blüm'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 Norbert Blüm with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Norbert Blüm more than expected).
Fields of papers citing papers by Norbert Blüm
This network shows the impact of papers produced by Norbert Blüm. 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 Norbert Blüm. The network helps show where Norbert Blüm may publish in the future.
Co-authorship network
The 6 scholars most cited alongside Norbert Blüm, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2004 | 2 | |
| 2 | 2004 | 1 | |
| 3 | 2001 | 1 | |
| 4 | 2001 | 1 | |
| 5 | 2000 | 1 | |
| 6 | 1999 | 18 | |
| 7 | 1996 | 11 | |
| 8 | 1995 | 16 | |
| 9 | Wie kann die Langzeitarbeitslosigkeit abgebaut werden | 1989 | 1 |
| 10 | 40 Jahre Sozialstaat Bundesrepublik Deutschland | 1989 | 1 |
| 11 | 1986 | 34 | |
| 12 | 1985 | 3 | |
| 13 | 1985 | 3 | |
| 14 | 1984 | 6 | |
| 15 | 1984 | 1 | |
| 16 | 1983 | 58 | |
| 17 | 1983 | 4 | |
| 18 | 1983 | 3 | |
| 19 | 1982 | 1 | |
| 20 | 1980 | 39 |
About Norbert Blüm
Norbert Blüm is a scholar working on Theoretical Computer Science, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics, having authored 22 papers that have together received 301 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (7 papers), semigroups and automata theory (6 papers), Algorithms and Data Compression (5 papers), DNA and Biological Computing (4 papers), Complexity and Algorithms in Graphs (4 papers), graph theory and CDMA systems (3 papers), Graph theory and applications (3 papers) and Computability, Logic, AI Algorithms (2 papers). The work is most often cited by research in Computational Theory and Mathematics (182 citations), Discrete Mathematics and Combinatorics (20 citations) and Computer Graphics and Computer-Aided Design (16 citations). Norbert Blüm has collaborated with scholars based in Germany and United States. Frequent co-authors include Kurt Mehlhorn, Hans Wilhelm Alt, Michael T. Y. Paul, Robert J. Koch, Yan Liang and Hans Friedrich Zacher. Their work appears in journals such as Theoretical Computer Science, Acta Informatica, Journal of Algorithms, SIAM Journal on Computing and Rechtsgeschichte - Legal History.
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.