Dieter Kratsch
Dieter Kratsch publishes mostly in Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics, on topics such as Advanced Graph Theory Research, Complexity and Algorithms in Graphs and Graph Labeling and Dimension Problems.
- World rank
- #546,652 of 7,710,434 ranked researchers
- Rank in Norway
- #3,393 of 33,005
- Works
- 253
- Citations
- 6.1k
- Citations per work
- 24.3
What does Dieter Kratsch research?
Dieter Kratsch's work is mostly in Computer Science (80%), Mathematics (8%), Engineering (4%).
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
- Physical Sciences23191.5%
- Computer Science20179.5%
- Mathematics218.2%
- Engineering103.8%
- Everything else228.5%
- 1Computational Theory and Mathematics64% of their works
- 2Computer Networks and Communications12% of their works
- 3Discrete Mathematics and Combinatorics6% of their works
- 4Electrical and Electronic Engineering4% of their works
- 5Artificial Intelligence4% of their works
- 6Geometry and Topology2% of their works
Research topics
Which keywords describe Dieter Kratsch's research?
The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Graph Theory, Parameterized Complexity, Combinatorial Optimization, Complexity Theory, Graph Labeling and Metric Dimension.
- Suffix Arrays
- Spectral Amplitude Coding
- Online Algorithms
- Networks on Chip
- Szemerédi's Theorem
- Metric Dimension
- Complexity Theory
- Parameterized Complexity
- Approximation Algorithms
- Algorithmic Applications
- Graph Theory
- Combinatorial Optimization
- Graph Labeling
- Graph Limits
- Interconnection Networks
- Mobile Robots
- Fiber Bragg Grating
- Compression
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 18 words, with their numbers
- Algorithmic Applications3582 topics
- Approximation Algorithms3582 topics
- Graph Theory2231 topic
- Parameterized Complexity2231 topic
- Combinatorial Optimization1351 topic
- Complexity Theory1351 topic
- Graph Labeling881 topic
- Metric Dimension881 topic
- Graph Limits431 topic
- Szemerédi's Theorem431 topic
- Interconnection Networks341 topic
- Networks on Chip341 topic
- Mobile Robots271 topic
- Online Algorithms271 topic
- Fiber Bragg Grating231 topic
- Spectral Amplitude Coding231 topic
- Compression161 topic
- Suffix Arrays161 topic
Where does Dieter Kratsch work?
Dieter Kratsch's main affiliation in the publication record is University of Bergen, Norway.
How many publications and citations does Dieter Kratsch have?
OpenAlex counts 253 works and 6,145 citations for Dieter Kratsch, an h-index of 43, ranking #546,652 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 Dieter Kratsch. 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.