Norbert Blüm
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- semigroups and automata theory
Papers in
-
- Advanced Graph Theory Research 11
- semigroups and automata theory 9
- Complexity and Algorithms in Graphs 6
-
- Graph theory and applications 3
- Co-authors
- Kurt Mehlhorn (2 shared papers)Hans Wilhelm Alt (1 shared paper)Michael T. Y. Paul (1 shared paper)Robert J. Koch (2 shared papers)Yan Liang (1 shared paper)Hans Friedrich Zacher (1 shared paper)DIETER K. SCHRODER (1 shared paper)
- Journals
- Theoretical Computer Science (5 papers)Acta Informatica (2 papers)Information and Computation (1 paper)SIAM Journal on Computing (1 paper)Rechtsgeschichte - Legal History (1 paper)
- Partner nations
- GermanyUnited States
In The Last Decade
Norbert Blüm
33 papers receiving 451 citations
Peers
Comparison fields: 5 of 50
- Computational Theory and Mathematics 311
- Discrete Mathematics and Combinatorics 27
- Artificial Intelligence 239
- Computer Networks and Communications 151
- Computer Graphics and Computer-Aided Design 23
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-authors
The 7 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
Showing the 20 most-cited of 37 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1991 | 109 | |
| 2 | 1983 | 84 | |
| 3 | 1980 | 53 | |
| 4 | 1986 | 48 | |
| 5 | 2005 | 36 | |
| 6 | 1995 | 30 | |
| 7 | 1999 | 26 | |
| 8 | 1996 | 21 | |
| 9 | 40 Jahre Sozialstaat Bundesrepublik Deutschland | 1989 | 16 |
| 10 | 1984 | 9 | |
| 11 | 1983 | 8 | |
| 12 | A Simplified Realization of the Hopcroft-Karp Approach to Maximum Matching in General Graphs | 2001 | 8 |
| 13 | 1997 | 7 | |
| 14 | 1983 | 6 | |
| 15 | 1985 | 5 | |
| 16 | 2009 | 5 | |
| 17 | 1985 | 4 | |
| 18 | 2005 | 3 | |
| 19 | Die Grenzen des Sozialstaates | 1976 | 3 |
| 20 | 1984 | 3 |
About Norbert Blüm
Norbert Blüm is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Artificial Intelligence, Discrete Mathematics and Combinatorics and Molecular Biology, having authored 37 papers that have together received 507 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (11 papers), semigroups and automata theory (9 papers), Algorithms and Data Compression (8 papers), Complexity and Algorithms in Graphs (6 papers), DNA and Biological Computing (6 papers), graph theory and CDMA systems (5 papers), Graph theory and applications (3 papers) and Limits and Structures in Graph Theory (3 papers). The work is most often cited by research in Computational Theory and Mathematics (311 citations), Discrete Mathematics and Combinatorics (27 citations), Artificial Intelligence (239 citations), Computer Networks and Communications (151 citations) and Computer Graphics and Computer-Aided Design (23 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, Hans Friedrich Zacher and DIETER K. SCHRODER. Their work appears in journals such as Theoretical Computer Science, Acta Informatica, Information and Computation, 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.