Jan Óbdržálek

1.2k total citations
23 papers, 379 citations indexed

About

Jan Óbdržálek is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Jan Óbdržálek has authored 23 papers receiving a total of 379 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 6 papers in Artificial Intelligence. Recurrent topics in Jan Óbdržálek's work include Advanced Graph Theory Research (14 papers), Complexity and Algorithms in Graphs (10 papers) and Formal Methods in Verification (9 papers). Jan Óbdržálek is often cited by papers focused on Advanced Graph Theory Research (14 papers), Complexity and Algorithms in Graphs (10 papers) and Formal Methods in Verification (9 papers). Jan Óbdržálek collaborates with scholars based in Czechia, United Kingdom and Germany. Jan Óbdržálek's co-authors include J. Mark Bull, Lorna Smith, Petr Hliněný, Robert Ganian, Paul Hunter, Dietmar Berwanger, Peter Rossmanith, Anuj Dawar, Stephan Kreutzer and Václav Brožek and has published in prestigious journals such as Journal of Computer and System Sciences, Discrete Applied Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

Jan Óbdržálek

22 papers receiving 353 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jan Óbdržálek Czechia	9	195	178	151	100	52	23	379
Philippe Clauss France	11	231 1.2×	74 0.4×	287 1.9×	87 0.9×	24 0.5×	31	374
Antoni Mazurkiewicz Poland	7	109 0.6×	329 1.8×	41 0.3×	209 2.1×	15 0.3×	18	412
Kristof Beyls Belgium	7	269 1.4×	42 0.2×	321 2.1×	57 0.6×	92 1.8×	19	408
Gary Levin United States	10	237 1.2×	131 0.7×	62 0.4×	166 1.7×	53 1.0×	24	385
Harry G. Mairson United States	15	104 0.5×	315 1.8×	54 0.4×	429 4.3×	38 0.7×	37	476
Roger Villemaire Canada	9	88 0.5×	197 1.1×	28 0.2×	210 2.1×	121 2.3×	33	362
Ana Sokolova Austria	13	196 1.0×	169 0.9×	145 1.0×	212 2.1×	46 0.9×	42	410
E. Dubinsky United States	5	94 0.5×	125 0.7×	90 0.6×	162 1.6×	28 0.5×	13	298
Jean-Jacques Lévy France	12	110 0.6×	534 3.0×	117 0.8×	729 7.3×	58 1.1×	25	790
Tudor Jebelean Austria	11	42 0.2×	231 1.3×	22 0.1×	279 2.8×	66 1.3×	46	337

Countries citing papers authored by Jan Óbdržálek

Since Specialization

Citations

This map shows the geographic impact of Jan Óbdržálek'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 Jan Óbdržálek with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan Óbdržálek more than expected).

Fields of papers citing papers by Jan Óbdržálek

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jan Óbdržálek. 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 Jan Óbdržálek. The network helps show where Jan Óbdržálek may publish in the future.

Co-authorship network of co-authors of Jan Óbdržálek

This figure shows the co-authorship network connecting the top 25 collaborators of Jan Óbdržálek. A scholar is included among the top collaborators of Jan Óbdržálek based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jan Óbdržálek. Jan Óbdržálek is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Hliněný, Petr, O‐joung Kwon, Jan Óbdržálek, & Sebastian Ordyniak. (2016). Tree-depth and vertex-minors. European Journal of Combinatorics. 56. 46–56. 5 indexed citations

Hliněný, Petr, Jan Óbdržálek, Sebastian Ordyniak, et al.. (2016). Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences. 84. 219–242. 11 indexed citations

Hliněný, Petr, et al.. (2016). A New Perspective on FO Model Checking of Dense Graph Classes. 176–184. 7 indexed citations

Ganian, Robert, Petr Hliněný, Joachim Kneis, et al.. (2015). Are there any good digraph width measures?. Journal of Combinatorial Theory Series B. 116. 250–286. 7 indexed citations

Ganian, Robert, et al.. (2015). FO Model Checking of Interval Graphs. Logical Methods in Computer Science. Volume 11, Issue 4. 3 indexed citations

Hliněný, Petr, Daniel Lokshtanov, Jan Óbdržálek, et al.. (2015). FO Model Checking on Posets of Bounded Width. Warwick Research Archive Portal (University of Warwick). 6. 963–974. 7 indexed citations

Ganian, Robert, Petr Hliněný, Alexander Langer, et al.. (2013). Lower bounds on the complexity ofMSO1model-checking. Journal of Computer and System Sciences. 80(1). 180–194. 8 indexed citations

Ganian, Robert, Petr Hliněný, Joachim Kneis, et al.. (2013). Digraph width measures in parameterized algorithmics. Discrete Applied Mathematics. 168. 88–107. 12 indexed citations

Ganian, Robert, Petr Hliněný, & Jan Óbdržálek. (2013). Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Fundamenta Informaticae. 123(1). 59–76. 13 indexed citations

10.

Ganian, Robert, Petr Hliněný, & Jan Óbdržálek. (2012). A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. European Journal of Combinatorics. 34(3). 680–701. 7 indexed citations

11.

Berwanger, Dietmar, Anuj Dawar, Paul Hunter, Stephan Kreutzer, & Jan Óbdržálek. (2012). The dag-width of directed graphs. Journal of Combinatorial Theory Series B. 102(4). 900–923. 30 indexed citations

12.

Brázdil, Tomǎš, Václav Brožek, Antonı́n Kučera, & Jan Óbdržálek. (2011). Qualitative reachability in stochastic BPA games. Information and Computation. 209(8). 1160–1183. 15 indexed citations

13.

Ganian, Robert, Petr Hliněný, & Jan Óbdržálek. (2010). Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

14.

Brázdil, Tomǎš, Václav Brožek, Antonı́n Kučera, & Jan Óbdržálek. (2009). Qualitative Reachability in Stochastic BPA Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3. 218. 6 indexed citations

15.

Óbdržálek, Jan. (2006). DAG-width: connectivity measure for directed graphs. Symposium on Discrete Algorithms. 814–821. 37 indexed citations

16.

Óbdržálek, Jan. (2005). The essential Turing, edited by B. Jack Copeland, Oxford University Press, 2004, vii + 613 pp.. Bulletin of Symbolic Logic. 11(4). 541–542. 1 indexed citations

17.

Bull, J. Mark, et al.. (2004). Towards OpenMP for Java. 13 indexed citations

18.

Óbdržálek, Jan. (2003). Fast Mu-calculus Model Checking when Tree-width is Bounded.

19.

Smith, Lorna, J. Mark Bull, & Jan Óbdržálek. (2001). A parallel java grande benchmark suite. 8–8. 163 indexed citations

20.

Óbdržálek, Jan, et al.. (2001). An OpenMP‐like interface for parallel programming in Java. Concurrency and Computation Practice and Experience. 13(8-9). 793–814. 8 indexed citations

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.

Explore authors with similar magnitude of impact