Follow
Daniel Stefankovic
Daniel Stefankovic
Verified email at cs.rochester.edu
Title
Cited by
Cited by
Year
Recognizing string graphs in NP
M Schaefer, E Sedgwick, D Štefankovič
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 1-6, 2002
1932002
Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
A Galanis, D Štefankovič, E Vigoda
Combinatorics, Probability and Computing 25 (4), 500-559, 2016
1472016
Adaptive simulated annealing: A near-optimal connection between sampling and counting
D Štefankovič, S Vempala, E Vigoda
Journal of the ACM (JACM) 56 (3), 1-36, 2009
1282009
Fixed points, Nash equilibria, and the existential theory of the reals
M Schaefer, D Štefankovič
Theory of Computing Systems 60 (2), 172-193, 2017
1272017
Accelerating simulated annealing for the permanent and combinatorial counting problems
I BezŠkovŠ, D Štefankovič, VV Vazirani, E Vigoda
SIAM Journal on Computing 37 (5), 1429-1454, 2008
1232008
Decidability of string graphs
M Schaefer, D Stefankovic
Proceedings of the thirty-third annual ACM symposium on Theory of computing†…, 2001
1142001
Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region
A Galanis, D Štefankovič, E Vigoda
Journal of the ACM (JACM) 62 (6), 1-60, 2015
982015
An FPTAS for# knapsack and related counting problems
P Gopalan, A Klivans, R Meka, D Štefankovic, S Vempala, E Vigoda
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 817-826, 2011
812011
Removing even crossings
MJ Pelsmajer, M Schaefer, D Štefankovič
Journal of Combinatorial Theory, Series B 97 (4), 489-500, 2007
722007
Improved inapproximability results for counting independent sets in the hard‐core model
A Galanis, Q Ge, D Štefankovič, E Vigoda, L Yang
Random Structures & Algorithms 45 (1), 78-110, 2014
692014
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization∗
A Blanca, P Caputo, Z Chen, D Parisi, D Štefankovič, E Vigoda
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms†…, 2022
662022
Spatial mixing and the connective constant: Optimal bounds
A Sinclair, P Srivastava, D Štefankovič, Y Yin
Probability Theory and Related Fields 168, 153-197, 2017
632017
Ferromagnetic Potts model: Refined# BIS-hardness and related results
A Galanis, D Stefankovic, E Vigoda, L Yang
SIAM Journal on Computing 45 (6), 2004-2065, 2016
602016
Rapid mixing for colorings via spectral independence
Z Chen, A Galanis, D Štefankovič, E Vigoda
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA†…, 2021
562021
Hanani–Tutte, monotone drawings, and level-planarity
R Fulek, MJ Pelsmajer, M Schaefer, D Štefankovič
Thirty essays on geometric graph theory, 263-287, 2013
502013
A deterministic polynomial-time approximation scheme for counting knapsack solutions
D Štefankovič, S Vempala, E Vigoda
SIAM Journal on Computing 41 (2), 356-366, 2012
482012
Odd crossing number and crossing number are not the same
MJ Pelsmajer, M Schaefer, D Štefankovic
Twentieth Anniversary Volume: Discrete & Computational Geometry, 1-13, 2009
462009
Negative examples for sequential importance sampling of binary contingency tables
I BezŠkovŠ, A Sinclair, D Štefankovič, E Vigoda
Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland†…, 2006
46*2006
On the computational complexity of Nash equilibria for (0, 1) bimatrix games
B Codenotti, D Štefankovič
Information Processing Letters 94 (3), 145-150, 2005
452005
Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
C Efthymiou, TP Hayes, D Stefankovic, E Vigoda, Y Yin
SIAM Journal on Computing 48 (2), 581-643, 2019
432019
The system can't perform the operation now. Try again later.
Articles 1–20