Daniel Štefankovič

Most-cited papers

Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
Andreas Galanis, Daniel Štefankovič, Eric Vigoda
2012Combinatorics, probability & computing161 citations Open access
Semantic Scholar
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
Daniel Štefankovič, S. Vempala, Eric Vigoda
2006IEEE Annual Symposium on Foundations of Computer Science144 citations Open access
Semantic Scholar
Fixed Points, Nash Equilibria, and the Existential Theory of the Reals
M. Schaefer, Daniel Štefankovič
2017Theory of Computing Systems134 citations
Semantic Scholar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Nicole Megow, Adam D. Smith, Marcin Bieńkowski, Yuri Faenza +56 more
2007Lecture Notes in Computer Science134 citations
Semantic Scholar
Accelerating simulated annealing for the permanent and combinatorial counting problems
Ivona Bezáková, Daniel Štefankovič, V. Vazirani, Eric Vigoda
2006ACM-SIAM Symposium on Discrete Algorithms130 citations Open access
Semantic Scholar
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization
Antonio Blanca, Pietro Caputo, Zongchen Chen, D. Parisi +2 more
2021ACM-SIAM Symposium on Discrete Algorithms101 citations Open access
Semantic Scholar
An FPTAS for #Knapsack and Related Counting Problems
Parikshit Gopalan, Adam R. Klivans, Raghu Meka, Daniel Štefankovič +2 more
2011IEEE Annual Symposium on Foundations of Computer Science71 citations
Semantic Scholar
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
Andreas Galanis, Daniel Štefankovič, Eric Vigoda, Linji Yang
2013SIAM journal on computing (Print)67 citations Open access
Semantic Scholar
Rapid Mixing for Colorings via Spectral Independence
Zongchen Chen, Andreas Galanis, Daniel Štefankovič, Eric Vigoda
2020ACM-SIAM Symposium on Discrete Algorithms66 citations Open access
Semantic Scholar
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
Jin-Yi Cai, Andreas Galanis, L. Goldberg, Heng Guo +3 more
2013Journal of computer and system sciences (Print)64 citations Open access
Semantic Scholar
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region
Andreas Galanis, Daniel Štefankovič, Eric Vigoda
2013Symposium on the Theory of Computing64 citations Open access
Semantic Scholar
Removing even crossings
M. Pelsmajer, M. Schaefer, Daniel Štefankovič
2007J. Comb. Theory B64 citations Open access
Semantic Scholar
Improved inapproximability results for counting independent sets in the hard‐core model
Andreas Galanis, Qi Ge, Daniel Štefankovič, Eric Vigoda +1 more
2011Random Struct. Algorithms62 citations Open access
Semantic Scholar
Spatial mixing and the connective constant: optimal bounds
A. Sinclair, P. Srivastava, Daniel Štefankovič, Yitong Yin
2014ACM-SIAM Symposium on Discrete Algorithms58 citations Open access
Semantic Scholar
Approximation via Correlation Decay when Strong Spatial Mixing Fails
Ivona Bezáková, Andreas Galanis, L. Goldberg, Heng Guo +1 more
2015International Colloquium on Automata, Languages and Programming52 citations Open access
Semantic Scholar
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
Daniel Štefankovič, S. Vempala, Eric Vigoda
2010SIAM journal on computing (Print)45 citations Open access
Semantic Scholar
The Complexity of Tensor Rank
M. Schaefer, Daniel Štefankovič
2016Theory of Computing Systems44 citations Open access
Semantic Scholar
Swendsen‐Wang algorithm on the mean‐field Potts model
Andreas Galanis, Daniel Štefankovič, Eric Vigoda
2015International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques44 citations Open access
Semantic Scholar
Hanani–Tutte, Monotone Drawings, and Level-Planarity
R. Fulek, M. Pelsmajer, M. Schaefer, Daniel Štefankovič
201341 citations
Semantic Scholar
Crossing Numbers of Graphs with Rotation Systems
M. Pelsmajer, M. Schaefer, Daniel Štefankovič
2007Algorithmica41 citations Open access
Semantic Scholar
Inapproximability of the independent set polynomial in the complex plane
Ivona Bezáková, Andreas Galanis, L. Goldberg, Daniel Štefankovič
2017Symposium on the Theory of Computing40 citations Open access
Semantic Scholar
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model
Charilaos Efthymiou, T. Hayes, Daniel Štefankovič, Eric Vigoda +1 more
2016IEEE Annual Symposium on Foundations of Computer Science40 citations Open access
Semantic Scholar
On the computational complexity of Nash equilibria for (0, 1) bimatrix games
B. Codenotti, Daniel Štefankovič
2005Information Processing Letters39 citations
Semantic Scholar
Removing even crossings on surfaces
M. Pelsmajer, M. Schaefer, Daniel Štefankovič
2007European journal of combinatorics (Print)37 citations Open access
Semantic Scholar
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables
Ivona Bezáková, A. Sinclair, Daniel Štefankovič, Eric Vigoda
2006Algorithmica37 citations Open access
Semantic Scholar
Odd Crossing Number and Crossing Number Are Not the Same
M. Pelsmajer, M. Schaefer, Daniel Štefankovič
2008Discrete & Computational Geometry35 citations Open access
Semantic Scholar
Pitfalls of heterogeneous processes for phylogenetic reconstruction.
Daniel Štefankovič, Eric Vigoda
2007Systematic Biology32 citations
Semantic Scholar
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
Antonio Blanca, Andreas Galanis, L. Goldberg, Daniel Štefankovič +2 more
2018International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques31 citations Open access
Semantic Scholar
Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions
Daniel Štefankovič, Eric Vigoda
2006J. Comput. Biol.31 citations Open access
Semantic Scholar
Density Estimation in Linear Time
Satyaki Mahalanabis, Daniel Štefankovič
2007Annual Conference Computational Learning Theory29 citations
Semantic Scholar
Sampling Random Colorings of Sparse Random Graphs
Charilaos Efthymiou, T. Hayes, Daniel Štefankovič, Eric Vigoda
2017ACM-SIAM Symposium on Discrete Algorithms28 citations Open access
Semantic Scholar
Slice Normalized Dynamic Markov Logic Networks
T. Papai, Henry A. Kautz, Daniel Štefankovič
2012Neural Information Processing Systems28 citations
Semantic Scholar
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time
M. Schaefer, E. Sedgwick, Daniel Štefankovič
2008Canadian Conference on Computational Geometry28 citations
Semantic Scholar
A Graph Polynomial for Independent Sets of Bipartite Graphs
Qi Ge, Daniel Štefankovič
2009Combinatorics, probability & computing27 citations Open access
Semantic Scholar
Locally testable cyclic codes
L. Babai, Amir Shpilka, Daniel Štefankovič
2005IEEE Transactions on Information Theory24 citations Open access
Semantic Scholar
Metastability of the Potts Ferromagnet on Random Regular Graphs
Amin Coja-Oghlan, Andreas Galanis, L. Goldberg, J. B. Ravelomanana +2 more
2022Communications in Mathematical Physics23 citations Open access
Semantic Scholar
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Štefankovič +1 more
2019Annual Conference Computational Learning Theory22 citations
Semantic Scholar
Odd Crossing Number Is Not Crossing Number
M. Pelsmajer, M. Schaefer, Daniel Štefankovič
2005International Symposium Graph Drawing and Network Visualization22 citations
Semantic Scholar
Phase transition for Glauber dynamics for independent sets on regular trees
Ricardo Restrepo, Daniel Štefankovič, Juan C. Vera, Eric Vigoda +1 more
2010ACM-SIAM Symposium on Discrete Algorithms20 citations Open access
Semantic Scholar
The Complexity of Counting Eulerian Tours in 4-regular Graphs
Qi Ge, Daniel Štefankovič
2010Algorithmica19 citations
Semantic Scholar
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region
Zongchen Chen, Andreas Galanis, Daniel Štefankovič, Eric Vigoda
2021ACM-SIAM Symposium on Discrete Algorithms18 citations Open access
Semantic Scholar
Spatial mixing and the connective constant: optimal bounds
A. Sinclair, P. Srivastava, Daniel Štefankovič, Yitong Yin
2016Probability theory and related fields18 citations
Semantic Scholar
Removing Independently Even Crossings
M. Pelsmajer, M. Schaefer, Daniel Štefankovič
2009SIAM Journal on Discrete Mathematics18 citations Open access
Semantic Scholar
Beyond the Existential Theory of the Reals
M. Schaefer, Daniel Štefankovič
2022Theory of Computing Systems17 citations Open access
Semantic Scholar
On Counting Perfect Matchings in General Graphs
Daniel Štefankovič, Eric Vigoda, John Wilmes
2017Latin American Symposium on Theoretical Informatics17 citations Open access
Semantic Scholar
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold
Andreas Galanis, L. Goldberg, Daniel Štefankovič
2016International Colloquium on Automata, Languages and Programming16 citations
Semantic Scholar
The Swendsen–Wang dynamics on trees
Antonio Blanca, Zongchen Chen, Daniel Štefankovič, Eric Vigoda
2020International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques14 citations Open access
Semantic Scholar
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs
Ivona Bezáková, Andreas Galanis, L. Goldberg, Daniel Štefankovič
2021International Colloquium on Automata, Languages and Programming13 citations Open access
Semantic Scholar
Improved Strong Spatial Mixing for Colorings on Trees
Charilaos Efthymiou, Andreas Galanis, T. Hayes, Daniel Štefankovič +1 more
2019International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques13 citations
Semantic Scholar
The Complexity of Approximating the Matching Polynomial in the Complex Plane
Ivona Bezáková, Andreas Galanis, L. Goldberg, Daniel Štefankovič
2018International Colloquium on Automata, Languages and Programming13 citations Open access
Semantic Scholar