Martin Böhm
Martin Böhm publishes mostly in Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics, on topics such as Optimization and Search Problems, Complexity and Algorithms in Graphs and Optimization and Packing Problems.
- World rank
- #5,831,104 of 7,710,434 ranked researchers
- Rank in Czechia
- #22,627 of 39,303
- Works
- 35
- Citations
- 159
- Citations per work
- 4.5
What does Martin Böhm research?
Martin Böhm's work is mostly in Computer Science (53%), Engineering (29%), Decision Sciences (5%).
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 Sciences2982.3%
- Computer Science1952.9%
- Engineering1029.4%
- Everything else412.8%
- Social Sciences24.9%
- Decision Sciences24.9%
- 1Computer Networks and Communications28% of their works
- 2Industrial and Manufacturing Engineering24% of their works
- 3Computational Theory and Mathematics21% of their works
- 4Electrical and Electronic Engineering5% of their works
- 5Management Science and Operations Research5% of their works
- 6Artificial Intelligence4% of their works
Research topics
Which keywords describe Martin Böhm's research?
The keywords of their largest research topics: Mobile Robots, Online Algorithms, Algorithmic Applications, Approximation Algorithms, Genetic Algorithm, Combinatorial Optimization, Complexity Theory and Cutting.
- Graph Labeling
- Auction Theory
- Graph Theory
- Scheduling
- Manufacturing
- Cutting
- Combinatorial Optimization
- Approximation Algorithms
- Online Algorithms
- Mobile Robots
- Algorithmic Applications
- Genetic Algorithm
- Complexity Theory
- Packing
- Order Picking
- Warehouse Design
- Parameterized Complexity
- Mechanism Design
- Metric Dimension
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 19 words, with their numbers
- Mobile Robots251 topic
- Online Algorithms251 topic
- Algorithmic Applications192 topics
- Approximation Algorithms192 topics
- Genetic Algorithm182 topics
- Combinatorial Optimization131 topic
- Complexity Theory131 topic
- Cutting111 topic
- Packing111 topic
- Manufacturing71 topic
- Order Picking71 topic
- Scheduling71 topic
- Warehouse Design71 topic
- Graph Theory61 topic
- Parameterized Complexity61 topic
- Auction Theory31 topic
- Mechanism Design31 topic
- Graph Labeling21 topic
- Metric Dimension21 topic
Where does Martin Böhm work?
Martin Böhm's main affiliation in the publication record is Charles University, Czechia.
How many publications and citations does Martin Böhm have?
OpenAlex counts 35 works and 159 citations for Martin Böhm, an h-index of 7, ranking #5,831,104 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.
Other researchers named Martin Böhm
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 Martin Böhm. 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.