Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. - Rastislav Kralovic; Branislav Rovan; Peter Ruzicka; Daniel Stefankovic (DISC, 1998)

Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms. - Daniel Stefankovic (Inf. Process. Lett., 2000)

The complexity of shortest path and dilation bounded interval routing. - Rastislav Kralovic; Peter Ruzicka; Daniel Stefankovic (Theor. Comput. Sci., 2000)

On the complexity of multi-dimensional interval routing schemes. - Peter Ruzicka; Daniel Stefankovic (Theor. Comput. Sci., 2000)

Set Systems with Restricted Intersections modulo Prime Powers. - László Babai; Peter Frankl; Samuel Kutin; Daniel Stefankovic (J. Comb. Theory A, 2001)

Algorithms for Normal Curves and Surfaces. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (COCOON, 2002)

Recognizing string graphs in NP. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (J. Comput. Syst. Sci., 2003)

Train Tracks and Confluent Drawings. - Peter Hui; Marcus Schaefer 001; Daniel Stefankovic (GD, 2004)

Simultaneous diophantine approximation with excluded primes. - László Babai; Daniel Stefankovic (SODA, 2004)

Decidability of string graphs. - Marcus Schaefer 001; Daniel Stefankovic (J. Comput. Syst. Sci., 2004)

Odd Crossing Number Is Not Crossing Number. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (GD, 2005)

On the computational complexity of Nash equilibria for (0, 1) bimatrix games. - Bruno Codenotti; Daniel Stefankovic (Inf. Process. Lett., 2005)

Solvability of Graph Inequalities. - Marcus Schaefer 001; Daniel Stefankovic (SIAM J. Discret. Math., 2005)

Locally testable cyclic codes. - László Babai; Amir Shpilka; Daniel Stefankovic (IEEE Trans. Inf. Theory, 2005)

Spiralling and Folding: The Topological View. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (CCCG, 2007)

Crossing Number of Graphs with Rotation Systems. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (GD, 2007)

Crossing Numbers and Parameterized Complexity. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (GD, 2007)

Worst-Case Synchronous Grammar Rules. - Daniel Gildea; Daniel Stefankovic (HLT-NAACL, 2007)

Train Tracks and Confluent Drawings. - Peter Hui; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Algorithmica, 2007)

Removing Even Crossings on Surfaces. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Electron. Notes Discret. Math., 2007)

Folding and Spiralling: The Word View. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (Electron. Notes Discret. Math., 2007)

Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions. - Daniel Stefankovic; Eric Vigoda (J. Comput. Biol., 2007)

Removing even crossings. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (J. Comb. Theory B, 2007)

Behavioral Shaping for Geometric Concepts. - Manu Chhabra; Robert A. Jacobs; Daniel Stefankovic (J. Mach. Learn. Res., 2007)

Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (CCCG, 2008)

Density Estimation in Linear Time. - Satyaki Mahalanabis; Daniel Stefankovic (COLT, 2008)

Odd Crossing Number and Crossing Number Are Not the Same. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Discret. Comput. Geom., 2008)

Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. - Ivona Bezáková; Daniel Stefankovic; Vijay V. Vazirani; Eric Vigoda (SIAM J. Comput., 2008)

Approximating L1-distances Between Mixture Distributions Using Random Projections. - Satyaki Mahalanabis; Daniel Stefankovic (ANALCO, 2009)

Adaptive simulated annealing: A near-optimal connection between sampling and counting. - Daniel Stefankovic; Santosh S. Vempala; Eric Vigoda (J. ACM, 2009)

Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species - Daniel Stefankovic; Eric Vigoda (CoRR, 2010)

Removing Independently Even Crossings. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (SIAM J. Discret. Math., 2010)

An FPTAS for #Knapsack and Related Counting Problems. - Parikshit Gopalan; Adam R. Klivans; Raghu Meka; Daniel Stefankovic; Santosh S. Vempala; Eric Vigoda (FOCS, 2011)

Hanani-Tutte and Monotone Drawings. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (WG, 2011)

Crossing Numbers of Graphs with Rotation Systems. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Algorithmica, 2011)

Spiraling and Folding: The Word View. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (Algorithmica, 2011)

Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species. - Daniel Stefankovic; Eric Vigoda (SIAM J. Discret. Math., 2011)

Modeling the Locality in Graph Traversals. - Liang Yuan; Chen Ding; Daniel Stefankovic; Yunquan Zhang (ICPP, 2012)

Slice Normalized Dynamic Markov Logic Networks. - Tivadar Papai; Henry A. Kautz; Daniel Stefankovic (NIPS, 2012)

Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. - Ivona Bezáková; Alistair Sinclair; Daniel Stefankovic; Eric Vigoda (Algorithmica, 2012)

The Complexity of Counting Eulerian Tours in 4-regular Graphs. - Qi Ge; Daniel Stefankovic (Algorithmica, 2012)

Subset Selection for Gaussian Markov Random Fields - Satyaki Mahalanabis; Daniel Stefankovic (CoRR, 2012)

A Graph Polynomial for Independent Sets of Bipartite Graphs. - Qi Ge; Daniel Stefankovic (Comb. Probab. Comput., 2012)

Adjacent Crossings Do Matter. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (J. Graph Algorithms Appl., 2012)

A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions. - Daniel Stefankovic; Santosh S. Vempala; Eric Vigoda (SIAM J. Comput., 2012)

Block Additivity of ℤ2-Embeddings. - Marcus Schaefer 001; Daniel Stefankovic (GD, 2013)

Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5. - Tivadar Papai; Henry A. Kautz; Daniel Stefankovic (TARK, 2013)

BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (CoRR, 2013)

Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (STOC, 2014)

Sampling Tree Fragments from Forests. - Tagyoung Chung; Licheng Fang; Daniel Gildea; Daniel Stefankovic (Comput. Linguistics, 2014)

Improved inapproximability results for counting independent sets in the hard-core model. - Andreas Galanis; Qi Ge; Daniel Stefankovic; Eric Vigoda; Linji Yang (Random Struct. Algorithms, 2014)

Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. - Ricardo Restrepo; Daniel Stefankovic; Juan Carlos Vera 001; Eric Vigoda; Linji Yang (SIAM J. Discret. Math., 2014)

Spatial mixing and the connective constant: Optimal bounds. - Alistair Sinclair; Piyush Srivastava 001; Daniel Stefankovic; Yitong Yin (SODA, 2015)

Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (J. ACM, 2015)

Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (Comb. Probab. Comput., 2016)

#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. - Jin-Yi Cai; Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Mark Jerrum; Daniel Stefankovic; Eric Vigoda (J. Comput. Syst. Sci., 2016)

Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda; Linji Yang (SIAM J. Comput., 2016)

Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. - Sejun Park; Yunhun Jang; Andreas Galanis; Jinwoo Shin; Daniel Stefankovic; Eric Vigoda (AISTATS, 2017)

Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences. - Rupam Acharyya; Daniel Stefankovic (APPROX-RANDOM, 2017)

Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. - Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (ICALP, 2017)

On The Projection Operator to A Three-view Cardinality Constrained Set. - Haichuan Yang; Shupeng Gui; Chuyang Ke; Daniel Stefankovic; Ryohei Fujimaki; Ji Liu 002 (ICML, 2017)

Fixed Points, Nash Equilibria, and the Existential Theory of the Reals. - Marcus Schaefer 001; Daniel Stefankovic (Theory Comput. Syst., 2017)

On Counting Perfect Matchings in General Graphs. - Daniel Stefankovic; Eric Vigoda; John Wilmes (LATIN, 2018)

Sampling Random Colorings of Sparse Random Graphs. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (SODA, 2018)

The Complexity of Tensor Rank. - Marcus Schaefer 001; Daniel Stefankovic (Theory Comput. Syst., 2018)

Improved Strong Spatial Mixing for Colorings on Trees. - Charilaos Efthymiou 001; Andreas Galanis; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (APPROX-RANDOM, 2019)

Swendsen-Wang algorithm on the mean-field Potts model. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (Random Struct. Algorithms, 2019)

Approximation via Correlation Decay When Strong Spatial Mixing Fails. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Daniel Stefankovic (SIAM J. Comput., 2019)

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda; Yitong Yin (SIAM J. Comput., 2019)

The complexity of approximating averages on bounded-degree graphs. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (FOCS, 2020)

The Hardness of Sampling Connected Subgraphs. - Andrew Read-McFarland; Daniel Stefankovic (LATIN, 2020)

Understanding Diversity based Pruning of Neural Networks - Statistical Mechanical Analysis. - Rupam Acharyya; Boyu Zhang; Ankani Chattoraj; Shouman Das; Daniel Stefankovic (CoRR, 2020)

Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models. - Ivona Bezáková; Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (J. Mach. Learn. Res., 2020)

Inapproximability of the Independent Set Polynomial in the Complex Plane. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (SIAM J. Comput., 2020)

Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. - Antonio Blanca; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic; Eric Vigoda; Kuan Yang 001 (SIAM J. Discret. Math., 2020)

Structure Learning of H-Colorings. - Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (ACM Trans. Algorithms, 2020)

Rapid Mixing for Colorings via Spectral Independence. - Zongchen Chen; Andreas Galanis; Daniel Stefankovic; Eric Vigoda (SODA, 2021)

Statistical mechanical analysis of neural network pruning. - Rupam Acharyya; Ankani Chattoraj; Boyu Zhang; Shouman Das; Daniel Stefankovic (UAI, 2021)

Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. - Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (J. Mach. Learn. Res., 2021)

The Complexity of Approximating the Matching Polynomial in the Complex Plane. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (ACM Trans. Comput. Theory, 2021)

Metastability of the Potts Ferromagnet on Random Regular Graphs. - Amin Coja-Oghlan; Andreas Galanis; Leslie Ann Goldberg; Jean Bernoulli Ravelomanana; Daniel Stefankovic; Eric Vigoda (ICALP, 2022)

Approximating Observables Is as Hard as Counting. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (ICALP, 2022)

On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. - Antonio Blanca; Pietro Caputo; Zongchen Chen; Daniel Parisi; Daniel Stefankovic; Eric Vigoda (SODA, 2022)

Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. - Zongchen Chen; Andreas Galanis; Daniel Stefankovic; Eric Vigoda (SODA, 2022)

Identity Testing for High-Dimensional Distributions via Entropy Tensorization. - Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (CoRR, 2022)

The Degenerate Crossing Number and Higher-Genus Embeddings. - Marcus Schäfer 001; Daniel Stefankovic (J. Graph Algorithms Appl., 2022)

Spectral Independence Lecture Notes. - Daniel Stefankovic; Eric Vigoda (CoRR, 2023)

Implementations and the independent set polynomial below the Shearer threshold. - Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (Theor. Comput. Sci., 2023)

The Swendsen-Wang dynamics on trees. - Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (Random Struct. Algorithms, 2023)

Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (ACM Trans. Algorithms, 2024)

Beyond the Existential Theory of the Reals. - Marcus Schaefer 001; Daniel Stefankovic (Theory Comput. Syst., 2024)

Spiraling and Folding: The Topological View. - Jan Kyncl; Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (Discret. Comput. Geom., 2024)

Optimal mixing via tensorization for random independent sets on arbitrary trees. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (Comb. Probab. Comput., 2025)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. - Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (ACM Trans. Algorithms, 2025)

How Hard is it to be a Star? Convex Geometry and the Real Hierarchy. - Marcus Schaefer 001; Daniel Stefankovic (CoRR, 2025)