Science Explorer Back to mapMap
Discussion
Researcher · Universität Hamburg · Germany

Rudolf Halin

Rudolf Halin publishes mostly in Computational Theory and Mathematics, Geometry and Topology and Computer Vision and Pattern Recognition, on topics such as Advanced Graph Theory Research, Graph theory and applications and Graph Labeling and Dimension Problems.

OpenAlex
World rank
#1,214,835
of 7,710,434 ranked researchers
Rank in Germany
#59,817
of 364,343
Works
56
Citations
1.6k
Citations per work
28.1
h-index
19
i10-index 34Top 15% in Computational Theory and Mathematics
Rudolf Halin

What does Rudolf Halin research?

Rudolf Halin's work is mostly in Computer Science (61%), Mathematics (19%), Engineering (5%).

Physical Sciences: 48 works · 85.5% of their workComputer Science: 34 works · 61.4% of their workComputational Theory and Mathematics: 27 works · 48.2% of their workComputer Vision and Pattern Recognition: 5 works · 8.8% of their workComputer Graphics and Computer-Aided Design: 2 works · 4.4% of their workMathematics: 11 works · 19.0% of their workGeometry and Topology: 7 works · 12.4% of their workDiscrete Mathematics and Combinatorics: 4 works · 6.6% of their workEngineering: 3 works · 5.1% of their workElectrical and Electronic Engineering: 3 works · 5.1% of their workEverything else: 8 works · 14.5% of their workTHEIR WORKRudolf Halin56works
Physical Sciences86%

Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.

The fields and subfields, with their numbers
    1. Computer Science3461.4%
    2. Mathematics1119.0%
    3. Engineering35.1%
  2. Everything else814.5%
  1. 1Computational Theory and Mathematics48% of their works
  2. 2Geometry and Topology12% of their works
  3. 3Computer Vision and Pattern Recognition9% of their works
  4. 4Discrete Mathematics and Combinatorics7% of their works
  5. 5Electrical and Electronic Engineering5% of their works
  6. 6Computer Graphics and Computer-Aided Design4% of their works

Research topics

Which keywords describe Rudolf Halin's research?

The keywords of their largest research topics: Approximation Algorithms, Graph Theory, Parameterized Complexity, Graph Spectra, Topological Indices, Graph Labeling, Metric Dimension and Graph Matching.

Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.

All 17 words, with their numbers
  1. Approximation Algorithms472 topics
  2. Graph Theory411 topic
  3. Parameterized Complexity411 topic
  4. Graph Spectra141 topic
  5. Topological Indices141 topic
  6. Graph Labeling131 topic
  7. Metric Dimension131 topic
  8. Graph Matching81 topic
  9. Graph Processing81 topic
  10. Fiber Bragg Grating71 topic
  11. Spectral Amplitude Coding71 topic
  12. Delaunay Triangulations61 topic
  13. Fuzzy Logic61 topic
  14. Mesh Generation61 topic
  15. Residuated Lattices61 topic
  16. Graph Limits51 topic
  17. Szemerédi's Theorem51 topic

Where does Rudolf Halin work?

Rudolf Halin's main affiliation in the publication record is Universität Hamburg, Germany.

How many publications and citations does Rudolf Halin have?

OpenAlex counts 56 works and 1,572 citations for Rudolf Halin, an h-index of 19, ranking #1,214,835 of 7,710,434 researchers worldwide on the quality score.

Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.

Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.

Discussion

Ask a question or share a note about Rudolf Halin. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.