Jan Óbdržálek
Jan Óbdržálek publishes mostly in Computational Theory and Mathematics, Artificial Intelligence and Hardware and Architecture, on topics such as Formal Methods in Verification, Advanced Graph Theory Research and Complexity and Algorithms in Graphs.
- World rank
- #147,148 of 1,633,909 ranked researchers
- Rank in Czechia
- #302 of 9,029
- Works
- 25
- Citations
- 173
- Citations per work
- 6.9
What does Jan Óbdržálek research?
Shares of their own output, by the field each of their topics belongs to. The grey slice is everything not listed.
- 1Computational Theory and Mathematics44% of their works
- 2Artificial Intelligence16% of their works
- 3Hardware and Architecture12% of their works
- 4Computer Networks and Communications8% of their works
- 5Computer Vision and Pattern Recognition4% of their works
- 6Physical and Theoretical Chemistry4% of their works
Research topics
Which keywords describe Jan Óbdržálek's research?
The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Model Checking, Temporal Logic, High-Performance Computing, Satisfiability Modulo Theories, Symbolic Model Checker and Combinatorial Optimization.
- Partially Ordered Sets
- Bayesian Networks
- Parallel Computing
- Grid Computing
- Answer Set Programming
- Graph Theory
- Combinatorial Optimization
- Satisfiability Modulo Theories
- Temporal Logic
- Approximation Algorithms
- Algorithmic Applications
- Model Checking
- High-Performance Computing
- Symbolic Model Checker
- Complexity Theory
- Parameterized Complexity
- Distributed Systems
- Modal Logic
- Performance Optimization
- Causal Inference
- Periodic Table
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.
All 21 words, with their numbers
- Algorithmic Applications62 topics
- Approximation Algorithms62 topics
- Model Checking62 topics
- Temporal Logic62 topics
- High-Performance Computing42 topics
- Satisfiability Modulo Theories41 topic
- Symbolic Model Checker41 topic
- Combinatorial Optimization31 topic
- Complexity Theory31 topic
- Graph Theory31 topic
- Parameterized Complexity31 topic
- Answer Set Programming21 topic
- Distributed Systems21 topic
- Grid Computing21 topic
- Modal Logic21 topic
- Parallel Computing21 topic
- Performance Optimization21 topic
- Bayesian Networks11 topic
- Causal Inference11 topic
- Partially Ordered Sets11 topic
- Periodic Table11 topic
Where does Jan Óbdržálek work?
Jan Óbdržálek's main affiliation in the publication record is Masaryk University, Czechia.
How many publications and citations does Jan Óbdržálek have?
Science Explorer counts 25 works and 173 citations for Jan Óbdržálek, ranking #147,148 of 1,633,909 researchers worldwide on the composite score.
Ranked on field-normalised 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 are in the interactive view on the map. Is this your page? Request a correction or removal.