| Publication | Date of Publication | Type |
|---|
| Locally testable cyclic codes | 2026-05-29 | Paper |
Optimal mixing via tensorization for random independent sets on arbitrary trees
Combinatorics, Probability and Computing | 2025-12-29 | Paper |
| The complexity of approximating averages on bounded-degree graphs | 2025-08-12 | Paper |
| Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model | 2025-08-06 | Paper |
Complexity of high-dimensional identity testing with coordinate conditional sampling
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Fast sampling via spectral independence beyond bounded-degree graphs
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Optimal mixing via tensorization for random independent sets on arbitrary trees | 2025-01-14 | Paper |
| Sampling colorings and independent sets of random regular bipartite graphs in the non-uniqueness region | 2024-07-19 | Paper |
| On mixing of Markov chains: coupling, spectral independence, and entropy factorization | 2024-07-19 | Paper |
| Fast sampling via spectral independence beyond bounded-degree graphs | 2024-06-24 | Paper |
| Metastability of the Potts ferromagnet on random regular graphs | 2024-06-24 | Paper |
| Approximating observables is as hard as counting | 2024-06-24 | Paper |
Beyond the Existential Theory of the Reals
Theory of Computing Systems | 2024-04-21 | Paper |
scientific article; zbMATH DE number 7788432 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| The Swendsen-Wang Dynamics on Trees | 2023-11-20 | Paper |
The Swendsen–Wang dynamics on trees
Random Structures & Algorithms | 2023-10-23 | Paper |
| Lecture Notes on Spectral Independence and Bases of a Matroid: Local-to-Global and Trickle-Down from a Markov Chain Perspective | 2023-07-25 | Paper |
Metastability of the Potts ferromagnet on random regular graphs
Communications in Mathematical Physics | 2023-06-23 | Paper |
scientific article; zbMATH DE number 7650115 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
On mixing of Markov chains: coupling, spectral independence, and entropy factorization
Electronic Journal of Probability | 2022-12-08 | Paper |
Implementations and the independent set polynomial below the Shearer threshold
Theoretical Computer Science | 2022-11-17 | Paper |
| The hardness of sampling connected subgraphs | 2022-10-13 | Paper |
| The complexity of approximating the matching polynomial in the complex plane | 2022-07-21 | Paper |
| Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling | 2022-07-19 | Paper |
The degenerate crossing number and higher-genus embeddings
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
| Spiraling and Folding: The Topological View | 2022-06-15 | Paper |
The Complexity of Approximating the Matching Polynomial in the Complex Plane
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
The Complexity of Approximating the Matching Polynomial in the Complex Plane
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
Hardness of identity testing for restricted Boltzmann machines and Potts models
(available as arXiv preprint) | 2021-10-27 | Paper |
| Hardness of identity testing for restricted Boltzmann machines and Potts models | 2021-10-27 | Paper |
Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
| Glauber dynamics for Ising model on convergent dense graph sequences | 2021-07-28 | Paper |
| Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region | 2021-05-04 | Paper |
Inapproximability of the independent set polynomial in the complex plane
SIAM Journal on Computing | 2020-10-26 | Paper |
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
(available as arXiv preprint) | 2020-10-05 | Paper |
| Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models | 2020-10-05 | Paper |
| scientific article; zbMATH DE number 7204480 (Why is no real title available?) | 2020-05-27 | Paper |
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models
(available as arXiv preprint) | 2020-04-22 | Paper |
Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
SIAM Journal on Discrete Mathematics | 2020-03-26 | Paper |
On counting perfect matchings in general graphs
(available as arXiv preprint) | 2020-02-12 | Paper |
Inapproximability of the independent set polynomial in the complex plane
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
SIAM Journal on Computing | 2019-05-07 | Paper |
Approximation via Correlation Decay When Strong Spatial Mixing Fails
SIAM Journal on Computing | 2019-05-07 | Paper |
Swendsen-Wang algorithm on the mean-field Potts model
Random Structures & Algorithms | 2019-02-20 | Paper |
| Structure Learning of H-colorings | 2019-02-06 | Paper |
Structure Learning of H-colorings
(available as arXiv preprint) | 2019-02-06 | Paper |
Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region
Journal of the ACM | 2018-08-02 | Paper |
The complexity of tensor rank
Theory of Computing Systems | 2018-07-23 | Paper |
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
(available as arXiv preprint) | 2018-04-22 | Paper |
| Sampling random colorings of sparse random graphs | 2018-03-15 | Paper |
Sampling random colorings of sparse random graphs
(available as arXiv preprint) | 2018-03-15 | Paper |
Approximation via correlation decay when strong spatial mixing fails
(available as arXiv preprint) | 2017-12-19 | Paper |
Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Spatial mixing and the connective constant: optimal bounds
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Phase transition for Glauber dynamics for independent sets on regular trees | 2017-09-29 | Paper |
Swendsen-Wang algorithm on the mean-field Potts model
(available as arXiv preprint) | 2017-08-31 | Paper |
Spatial mixing and the connective constant: optimal bounds
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2017-06-22 | Paper |
Fixed points, Nash equilibria, and the existential theory of the reals
Theory of Computing Systems | 2017-03-31 | Paper |
Ferromagnetic Potts model: refined \#BIS-hardness and related results
(available as arXiv preprint) | 2017-03-22 | Paper |
| \#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region | 2017-03-22 | Paper |
The Degenerate Crossing Number and Higher-Genus Embeddings
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
SIAM Journal on Computing | 2016-12-13 | Paper |
Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
Information Processing Letters | 2016-06-16 | Paper |
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Journal of the ACM | 2015-11-11 | Paper |
| Simultaneous Diophantine approximation with excluded primes | 2015-08-03 | Paper |
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Decidability of string graphs
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Phase transition for Glauber dynamics for independent sets on regular trees
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Improved inapproximability results for counting independent sets in the hard-core model
Random Structures & Algorithms | 2014-08-25 | Paper |
An FPTAS for #Knapsack and Related Counting Problems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Block additivity of \(\mathbb Z_{2}\)-embeddings
Graph Drawing | 2013-12-20 | Paper |
Hanani-Tutte, monotone drawings, and level-planarity
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
Negative examples for sequential importance sampling of binary contingency tables
Algorithmica | 2013-04-03 | Paper |
Adjacent crossings do matter
Journal of Graph Algorithms and Applications | 2012-12-07 | Paper |
A graph polynomial for independent sets of bipartite graphs
Combinatorics, Probability and Computing | 2012-09-12 | Paper |
| A graph polynomial for independent sets of bipartite graphs | 2012-08-29 | Paper |
A deterministic polynomial-time approximation scheme for counting knapsack solutions
SIAM Journal on Computing | 2012-08-10 | Paper |
The complexity of counting Eulerian tours in 4-regular graphs
Algorithmica | 2012-04-26 | Paper |
Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Adjacent Crossings Do Matter
Graph Drawing | 2012-03-09 | Paper |
Hanani-Tutte and monotone drawings
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
| Behavioral shaping for geometric concepts | 2011-10-12 | Paper |
Improved inapproximability results for counting independent sets in the hard-core model
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Crossing numbers of graphs with rotation systems
Algorithmica | 2011-06-30 | Paper |
Spiraling and folding: the word view
Algorithmica | 2011-06-30 | Paper |
Removing Independently Even Crossings
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
| Strong spatial mixing of q-colorings on Bethe lattices | 2011-02-14 | Paper |
Accelerating simulated annealing for the permanent and combinatorial counting problems
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Recognizing string graphs in NP
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
| scientific article; zbMATH DE number 5763167 (Why is no real title available?) | 2010-07-30 | Paper |
Removing independently even crossings
Graph Drawing | 2010-04-27 | Paper |
The complexity of counting Eulerian tours in 4-regular graphs
Lecture Notes in Computer Science | 2010-04-27 | Paper |
On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
Information Processing Letters | 2009-12-04 | Paper |
Removing even crossings on surfaces
European Journal of Combinatorics | 2009-11-30 | Paper |
| scientific article; zbMATH DE number 5542505 (Why is no real title available?) | 2009-04-14 | Paper |
Locally Testable Cyclic Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
SIAM Journal on Computing | 2008-10-28 | Paper |
Removing Even Crossings on Surfaces
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Folding and Spiralling: The Word View
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Odd crossing number and crossing number are not the same
Discrete & Computational Geometry | 2008-04-16 | Paper |
Crossing Numbers and Parameterized Complexity
Graph Drawing | 2008-03-25 | Paper |
Crossing Number of Graphs with Rotation Systems
Graph Drawing | 2008-03-25 | Paper |
Negative examples for sequential importance sampling of binary contingency tables
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Removing even crossings
Journal of Combinatorial Theory. Series B | 2007-06-08 | Paper |
Train tracks and confluent drawings
Algorithmica | 2007-05-10 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Solvability of Graph Inequalities
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2206367 (Why is no real title available?) | 2005-09-19 | Paper |
Decidability of string graphs
Journal of Computer and System Sciences | 2004-11-22 | Paper |
Recognizing string graphs in NP
Journal of Computer and System Sciences | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2089992 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 1760012 (Why is no real title available?) | 2002-11-06 | Paper |
Set systems with restricted intersections modulo prime powers
Journal of Combinatorial Theory. Series A | 2001-10-21 | Paper |
The complexity of shortest path and dilation bounded interval routing
Theoretical Computer Science | 2000-08-21 | Paper |
On the complexity of multi-dimensional interval routing schemes
Theoretical Computer Science | 2000-08-21 | Paper |
