Year |
Citation |
Score |
2021 |
Bezáková I, Galanis A, Goldberg LA, Štefankovič D. The Complexity of Approximating the Matching Polynomial in the Complex Plane Acm Transactions On Computation Theory. 13: 1-37. DOI: 10.1145/3448645 |
0.35 |
|
2020 |
Blanca A, Galanis A, Goldberg LA, Štefankovič D, Vigoda E, Yang K. Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs Siam Journal On Discrete Mathematics. 34: 742-793. DOI: 10.1137/18M1219722 |
0.383 |
|
2019 |
Efthymiou C, Hayes TP, Štefankovič D, Vigoda E, Yin Y. Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model Siam Journal On Computing. 48: 581-643. DOI: 10.1137/17M1127144 |
0.391 |
|
2019 |
Galanis A, Štefankovič D, Vigoda E. Swendsen‐Wang algorithm on the mean‐field Potts model Random Structures and Algorithms. 54: 82-147. DOI: 10.1002/Rsa.20768 |
0.385 |
|
2018 |
Schaefer M, Štefankovič D. The Complexity of Tensor Rank Theory of Computing Systems \/ Mathematical Systems Theory. 62: 1161-1174. DOI: 10.1007/S00224-017-9800-Y |
0.301 |
|
2016 |
Galanis A, Štefankovič D, Vigoda E, Yang L. Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results Siam Journal On Computing. 45: 2004-2065. DOI: 10.1137/140997580 |
0.427 |
|
2016 |
GALANIS A, ŠTEFANKOVIČ D, VIGODA E. Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models Combinatorics Probability and Computing. 1-60. DOI: 10.1017/S0963548315000401 |
0.477 |
|
2015 |
Galanis A, Štefankovič D, Vigoda E. Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region Journal of the Acm. 62. DOI: 10.1145/2785964 |
0.426 |
|
2014 |
Chung T, Fang L, Gildea D, Štefankovič D. Sampling tree fragments from forests Computational Linguistics. 40: 203-229. DOI: 10.1162/Coli_A_00170 |
0.318 |
|
2014 |
Galanis A, Štefankovič D, Vigoda E. Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region Proceedings of the Annual Acm Symposium On Theory of Computing. 823-831. DOI: 10.1145/2591796.2591878 |
0.312 |
|
2014 |
Restrepo R, Štefankovič D, Vera JC, Vigoda E, Yang L. Phase transition for glauber dynamics for independent sets on regular trees Siam Journal On Discrete Mathematics. 28: 835-861. DOI: 10.1137/120885498 |
0.381 |
|
2014 |
Cai JY, Galanis A, Goldberg LA, Guo H, Jerrum M, Štefankovič D, Vigoda E. #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region Journal of Computer and System Sciences. DOI: 10.1016/J.Jcss.2015.11.009 |
0.395 |
|
2014 |
Galanis A, Ge Q, Štefankovič D, Vigoda E, Yang L. Improved inapproximability results for counting independent sets in the hard-core model Random Structures and Algorithms. 45: 78-110. DOI: 10.1002/Rsa.20479 |
0.498 |
|
2013 |
Fulek R, Pelsmajer MJ, Schaefer M, Štefankovič D. Hanani-Tutte, monotone drawings, and level-planarity Thirty Essays On Geometric Graph Theory. 2147483647: 263-287. DOI: 10.1007/978-1-4614-0110-0_14 |
0.314 |
|
2012 |
Fulek R, Pelsmajer MJ, Schaefer M, Štefankovič D. Adjacent crossings do matter Journal of Graph Algorithms and Applications. 16: 759-782. DOI: 10.7155/Jgaa.00266 |
0.4 |
|
2012 |
Štefankovič D, Vempala S, Vigoda E. A deterministic polynomial-time approximation scheme for counting knapsack solutions Siam Journal On Computing. 41: 356-366. DOI: 10.1137/11083976X |
0.359 |
|
2012 |
Ge Q, Štefankovič D. A graph polynomial for independent sets of bipartite graphs Combinatorics Probability and Computing. 21: 695-714. DOI: 10.1017/S0963548312000296 |
0.468 |
|
2012 |
Ge Q, Štefankovič D. The complexity of counting eulerian tours in 4-regular graphs Algorithmica. 63: 588-601. DOI: 10.1007/S00453-010-9463-4 |
0.406 |
|
2011 |
Štefankovič D, Vigoda E. Fast convergence of Markov chain Monte Carlo algorithms for phylogenetic reconstruction with homogeneous data on closely related species Siam Journal On Discrete Mathematics. 25: 1194-1211. DOI: 10.1137/100790550 |
0.358 |
|
2011 |
Pelsmajer MJ, Schaefer M, Štefankovič D. Crossing numbers of graphs with rotation systems Algorithmica (New York). 60: 679-702. DOI: 10.1007/S00453-009-9343-Y |
0.418 |
|
2011 |
Fulek R, Pelsmajer MJ, Schaefer M, Štefankovič D. Hanani-Tutte and monotone drawings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6986: 283-294. DOI: 10.1007/978-3-642-25870-1_26 |
0.355 |
|
2011 |
Galanis A, Ge Q, Štefankovič D, Vigoda E, Yang L. Improved inapproximability results for counting independent sets in the hard-core model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6845: 567-578. DOI: 10.1007/978-3-642-22935-0_48 |
0.426 |
|
2009 |
Stefankovic D, Vempala S, Vigoda E. Adaptive simulated annealing: A near-optimal connection between sampling and counting Journal of the Acm. 56. DOI: 10.1145/1516512.1516520 |
0.36 |
|
2009 |
Pelsmajer MJ, Schaefer M, Štefankovič D. Removing even crossings on surfaces European Journal of Combinatorics. 30: 1704-1717. DOI: 10.1016/J.Ejc.2009.03.002 |
0.328 |
|
2008 |
Pelsmajer MJ, Schaefer M, Štefankovič D. Odd crossing number and crossing number are not the same Discrete and Computational Geometry. 39: 442-454. DOI: 10.1007/S00454-008-9058-X |
0.416 |
|
2008 |
Pelsmajer MJ, Schaefer M, Štefankovič D. Crossing number of graphs with rotation systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4875: 3-12. DOI: 10.1007/978-3-540-77537-9_3 |
0.332 |
|
2007 |
Stefankovic D, Vigoda E. Phylogeny of mixture models: robustness of maximum likelihood and non-identifiable distributions. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 14: 156-89. PMID 17456014 DOI: 10.1089/Cmb.2006.0126 |
0.362 |
|
2007 |
Stefankovic D, Vigoda E. Pitfalls of heterogeneous processes for phylogenetic reconstruction. Systematic Biology. 56: 113-24. PMID 17366141 DOI: 10.1080/10635150701245388 |
0.353 |
|
2007 |
Pelsmajer MJ, Schaefer M, Štefankovič D. Removing even crossings Journal of Combinatorial Theory, Series B. 97: 489-500. DOI: 10.1016/J.Jctb.2006.08.001 |
0.455 |
|
2007 |
Hui P, Pelsmajer MJ, Schaefer M, Štefankovič D. Train tracks and confluent drawings Algorithmica (New York). 47: 465-479. DOI: 10.1007/S00453-006-0165-X |
0.432 |
|
2006 |
Bezáková I, Štefankovič D, Vazirani VV, Vigoda E. Accelerating simulated annealing for the permanent and combinatorial counting problems Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 900-907. DOI: 10.1137/050644033 |
0.326 |
|
2006 |
Pelsmajer MJ, Schaefer M, Štefankovič D. Odd crossing number is not crossing number Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3843: 386-396. DOI: 10.1007/11618058_35 |
0.328 |
|
2005 |
Schaefer M, Stefankovic D. Solvability of Graph Inequalities Siam Journal On Discrete Mathematics. 19: 728-743. DOI: 10.1137/S0895480199360655 |
0.434 |
|
2004 |
Schaefer M, Štefankovič D. Decidability of string graphs Journal of Computer and System Sciences. 68: 319-334. DOI: 10.1016/J.Jcss.2003.07.002 |
0.431 |
|
2003 |
Babai L, Shpilka A, Štefankovič D. Locally testable cyclic codes Annual Symposium On Foundations of Computer Science - Proceedings. 116-125. DOI: 10.1109/Tit.2005.851735 |
0.521 |
|
2001 |
Babai L, Frankl P, Kutin S, Štefankovič D. Set Systems with Restricted Intersections modulo Prime Powers Journal of Combinatorial Theory. Series A. 95: 39-73. DOI: 10.1006/Jcta.2000.3149 |
0.551 |
|
2000 |
Ružička P, Štefankovič D. On the complexity of multi-dimensional interval routing schemes Theoretical Computer Science. 245: 255-280. DOI: 10.1016/S0304-3975(99)00284-4 |
0.33 |
|
2000 |
Kráľovič R, Ružička P, Štefankovič D. The complexity of shortest path and dilation bounded interval routing Theoretical Computer Science. 234: 85-107. DOI: 10.1016/S0304-3975(98)00042-5 |
0.342 |
|
2000 |
Štefankovič D. Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms Information Processing Letters. 73: 221-225. DOI: 10.1016/S0020-0190(00)00022-3 |
0.37 |
|
Show low-probability matches. |