Daniel Štefankovič

2.1k total citations
72 papers, 727 citations indexed

About

Daniel Štefankovič is a scholar working on Statistics and Probability, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Daniel Štefankovič has authored 72 papers receiving a total of 727 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Statistics and Probability, 31 papers in Computational Theory and Mathematics and 24 papers in Artificial Intelligence. Recurrent topics in Daniel Štefankovič's work include Markov Chains and Monte Carlo Methods (31 papers), Stochastic processes and statistical mechanics (18 papers) and Computational Geometry and Mesh Generation (15 papers). Daniel Štefankovič is often cited by papers focused on Markov Chains and Monte Carlo Methods (31 papers), Stochastic processes and statistical mechanics (18 papers) and Computational Geometry and Mesh Generation (15 papers). Daniel Štefankovič collaborates with scholars based in United States, Slovakia and United Kingdom. Daniel Štefankovič's co-authors include Eric Vigoda, Marcus Schaefer, Andreas Galanis, Eric Sedgwick, Santosh Vempala, Michael J. Pelsmajer, Ivona Bezáková, Vijay V. Vazirani, László Babai and Linji Yang and has published in prestigious journals such as IEEE Transactions on Information Theory, Systematic Biology and Communications in Mathematical Physics.

In The Last Decade

Daniel Štefankovič

64 papers receiving 677 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Daniel Štefankovič United States 17 297 271 258 157 136 72 727
Gilles Schaeffer France 18 172 0.6× 249 0.9× 195 0.8× 505 3.2× 116 0.9× 46 970
Hsien‐Kuei Hwang Taiwan 20 227 0.8× 238 0.9× 518 2.0× 567 3.6× 53 0.4× 89 1.1k
Jeff Kahn United States 23 239 0.8× 847 3.1× 233 0.9× 225 1.4× 42 0.3× 78 1.4k
Catherine Greenhill Australia 18 401 1.4× 412 1.5× 188 0.7× 202 1.3× 23 0.2× 59 989
Dana Randall United States 14 330 1.1× 160 0.6× 143 0.6× 251 1.6× 29 0.2× 57 706
Günter Last Germany 17 327 1.1× 98 0.4× 102 0.4× 399 2.5× 46 0.3× 87 1.1k
J. Spencer United States 16 77 0.3× 474 1.7× 227 0.9× 135 0.9× 61 0.4× 41 928
N. C. Wormald Australia 18 93 0.3× 507 1.9× 81 0.3× 170 1.1× 84 0.6× 52 981
Ehud Friedgut Israel 19 94 0.3× 841 3.1× 307 1.2× 118 0.8× 73 0.5× 39 1.3k
Michael Drmota Austria 16 142 0.5× 256 0.9× 275 1.1× 522 3.3× 16 0.1× 72 920

Countries citing papers authored by Daniel Štefankovič

Since Specialization
Citations

This map shows the geographic impact of Daniel Štefankovič'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 Daniel Štefankovič with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Štefankovič more than expected).

Fields of papers citing papers by Daniel Štefankovič

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniel Štefankovič. 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 Daniel Štefankovič. The network helps show where Daniel Štefankovič may publish in the future.

Co-authorship network of co-authors of Daniel Štefankovič

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Štefankovič. A scholar is included among the top collaborators of Daniel Štefankovič 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 Daniel Štefankovič. Daniel Štefankovič is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Coja‐Oghlan, Amin, et al.. (2023). Metastability of the Potts Ferromagnet on Random Regular Graphs. Communications in Mathematical Physics. 401(1). 185–225. 4 indexed citations
2.
Schaefer, Marcus & Daniel Štefankovič. (2023). Beyond the Existential Theory of the Reals. Theory of Computing Systems. 68(2). 195–226. 1 indexed citations
3.
Bezáková, Ivona, Andreas Galanis, Leslie Ann Goldberg, & Daniel Štefankovič. (2018). The complexity of approximating the matching polynomial in the complex\n plane. arXiv (Cornell University). 2 indexed citations
4.
Galanis, Andreas, et al.. (2018). Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 1 indexed citations
5.
Sinclair, Alistair, Piyush Srivastava, Daniel Štefankovič, & Yitong Yin. (2016). Spatial mixing and the connective constant: optimal bounds. Probability Theory and Related Fields. 168(1-2). 153–197. 18 indexed citations
6.
Cai, Jin‐Yi, Andreas Galanis, Leslie Ann Goldberg, et al.. (2015). #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. Journal of Computer and System Sciences. 82(5). 690–711. 13 indexed citations
7.
Kautz, Henry, et al.. (2012). Slice Normalized Dynamic Markov Logic Networks. Neural Information Processing Systems. 25. 1907–1915. 9 indexed citations
8.
Ge, Qi & Daniel Štefankovič. (2010). The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica. 63(3). 588–601. 4 indexed citations
9.
Pelsmajer, Michael J., Marcus Schaefer, & Daniel Štefankovič. (2009). Removing even crossings on surfaces. European Journal of Combinatorics. 30(7). 1704–1717. 7 indexed citations
10.
Schaefer, Marcus, Eric Sedgwick, & Daniel Štefankovič. (2008). Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. Canadian Conference on Computational Geometry. 7 indexed citations
11.
Gildea, Daniel & Daniel Štefankovič. (2007). Worst-Case Synchronous Grammar Rules. North American Chapter of the Association for Computational Linguistics. 147–154. 8 indexed citations
12.
Jacobs, Robert A., et al.. (2007). Behavioral Shaping for Geometric Concepts. Journal of Machine Learning Research. 8(64). 1835–1865.
13.
Bezáková, Ivona, Daniel Štefankovič, Vijay V. Vazirani, & Eric Vigoda. (2006). Accelerating simulated annealing for the permanent and combinatorial counting problems. Symposium on Discrete Algorithms. 900–907. 13 indexed citations
14.
Pelsmajer, Michael J., Marcus Schaefer, & Daniel Štefankovič. (2006). Removing even crossings. Journal of Combinatorial Theory Series B. 97(4). 489–500. 12 indexed citations
15.
Pelsmajer, Michael J., Marcus Schaefer, & Daniel Štefankovič. (2005). Odd crossing number is not crossing number. 1 indexed citations
16.
Schaefer, Marcus, Eric Sedgwick, & Daniel Štefankovič. (2003). Recognizing string graphs in NP. Journal of Computer and System Sciences. 67(2). 365–380. 29 indexed citations
17.
Schaefer, Marcus & Daniel Štefankovič. (2003). Decidability of string graphs. Journal of Computer and System Sciences. 68(2). 319–334. 19 indexed citations
18.
Babai, László, Péter Frankl, Samuel Kutin, & Daniel Štefankovič. (2001). Set Systems with Restricted Intersections modulo Prime Powers. Journal of Combinatorial Theory Series A. 95(1). 39–73. 11 indexed citations
19.
Růžička, Peter & Daniel Štefankovič. (2000). On the complexity of multi-dimensional interval routing schemes. Theoretical Computer Science. 245(2). 255–280. 5 indexed citations
20.
Kráľovič, Rastislav, Peter Růžička, & Daniel Štefankovič. (2000). The complexity of shortest path and dilation bounded interval routing. Theoretical Computer Science. 234(1-2). 85–107. 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

Breakdown of academic impact, for papers by Gilles Schaeffer Breakdown of academic impact, for papers by Hsien‐Kuei Hwang Breakdown of academic impact, for papers by Jeff Kahn Breakdown of academic impact, for papers by Catherine Greenhill Breakdown of academic impact, for papers by Dana Randall Breakdown of academic impact, for papers by Günter Last Breakdown of academic impact, for papers by J. Spencer Breakdown of academic impact, for papers by N. C. Wormald Breakdown of academic impact, for papers by Ehud Friedgut Breakdown of academic impact, for papers by Michael Drmota
Rankless by CCL
2026