Daniel Štefankovič
Impact in
-
- Computational Geometry and Mesh Generation
- Statistics and Probability top 1%
- Markov Chains and Monte Carlo Methods
Papers in
-
- Markov Chains and Monte Carlo Methods 31
-
- Topological and Geometric Data Analysis 12
- Advanced Graph Theory Research 12
- Complexity and Algorithms in Graphs 8
- Co-authors
- Eric Vigoda (28 shared papers)Marcus Schaefer (23 shared papers)Andreas Galanis (14 shared papers)Eric Sedgwick (5 shared papers)Santosh Vempala (4 shared papers)Michael J. Pelsmajer (11 shared papers)Ivona Bezáková (6 shared papers)Vijay V. Vazirani (3 shared papers)
- Journals
- Algorithmica (5 papers)SIAM Journal on Discrete Mathematics (5 papers)SIAM Journal on Computing (4 papers)Theoretical Computer Science (3 papers)Theory of Computing Systems (3 papers)
- Partner nations
- United StatesSlovakiaUnited Kingdom
In The Last Decade
Daniel Štefankovič
64 papers receiving 677 citations
Peers
Comparison fields: 5 of 58
- Computer Graphics and Computer-Aided Design 136
- Statistics and Probability 297
- Computational Mathematics 12
- Mathematical Physics 157
- Computational Theory and Mathematics 271
Countries citing papers authored by Daniel Štefankovič
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č
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-authors
The 25 scholars most cited alongside Daniel Štefankovič, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 72 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 49 | |
| 2 | 2009 | 47 | |
| 3 | 2002 | 46 | |
| 4 | 2008 | 43 | |
| 5 | 2015 | 35 | |
| 6 | 2003 | 29 | |
| 7 | 2015 | 23 | |
| 8 | 2001 | 23 | |
| 9 | 2016 | 22 | |
| 10 | 2007 | 21 | |
| 11 | 2007 | 20 | |
| 12 | 2003 | 19 | |
| 13 | 2016 | 18 | |
| 14 | 2007 | 18 | |
| 15 | 2012 | 18 | |
| 16 | 2012 | 18 | |
| 17 | 2005 | 18 | |
| 18 | 2006 | 13 | |
| 19 | 2015 | 13 | |
| 20 | 2006 | 12 |
About Daniel Štefankovič
Daniel Štefankovič is a scholar working on Statistics and Probability, Computational Theory and Mathematics, Artificial Intelligence, Mathematical Physics and Computer Graphics and Computer-Aided Design, having authored 72 papers that have together received 727 indexed citations. Recurring topics across this work include Markov Chains and Monte Carlo Methods (31 papers), Stochastic processes and statistical mechanics (18 papers), Computational Geometry and Mesh Generation (15 papers), Topological and Geometric Data Analysis (12 papers), Advanced Graph Theory Research (12 papers), Data Management and Algorithms (11 papers), Bayesian Modeling and Causal Inference (11 papers) and Complexity and Algorithms in Graphs (8 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (136 citations), Statistics and Probability (297 citations), Computational Mathematics (12 citations), Mathematical Physics (157 citations) and Computational Theory and Mathematics (271 citations). Daniel Štefankovič has collaborated with scholars based in United States, Slovakia and United Kingdom. Frequent 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. Their work appears in journals such as Algorithmica, SIAM Journal on Discrete Mathematics, SIAM Journal on Computing, Theoretical Computer Science and Theory of Computing Systems.
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.