| Publication | Date of Publication | Type |
|---|
| 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 | 2024-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147349 | 2024-01-15 | Paper |
| The Swendsen-Wang Dynamics on Trees | 2023-11-20 | Paper |
| The Swendsen–Wang dynamics on trees | 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 | 2023-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875505 | 2023-02-03 | Paper |
| On mixing of Markov chains: coupling, spectral independence, and entropy factorization | 2022-12-08 | Paper |
| Implementations and the independent set polynomial below the Shearer threshold | 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 | 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 | 2022-03-22 | 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 | 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 | 2020-10-26 | Paper |
| Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models | 2020-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111358 | 2020-05-27 | Paper |
| Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models | 2020-04-22 | Paper |
| Sampling in uniqueness from the Potts and random-cluster models on random regular graphs | 2020-03-26 | Paper |
| On counting perfect matchings in general graphs | 2020-02-12 | Paper |
| Inapproximability of the independent set polynomial in the complex plane | 2019-08-22 | Paper |
| Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model | 2019-05-07 | Paper |
| Approximation via Correlation Decay When Strong Spatial Mixing Fails | 2019-05-07 | Paper |
| Swendsen-Wang algorithm on the mean-field Potts model | 2019-02-20 | Paper |
| Structure Learning of $H$-colorings | 2019-02-06 | Paper |
| Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region | 2018-08-02 | Paper |
| The complexity of tensor rank | 2018-07-23 | Paper |
| Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs | 2018-04-22 | Paper |
| Sampling random colorings of sparse random graphs | 2018-03-15 | Paper |
| Approximation via correlation decay when strong spatial mixing fails | 2017-12-19 | Paper |
| Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models | 2017-10-10 | Paper |
| Spatial mixing and the connective constant: optimal bounds | 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 | 2017-08-31 | Paper |
| Spatial mixing and the connective constant: optimal bounds | 2017-06-22 | Paper |
| Fixed points, Nash equilibria, and the existential theory of the reals | 2017-03-31 | Paper |
| Ferromagnetic Potts model: refined \#BIS-hardness and related results | 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 | 2017-02-10 | Paper |
| Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results | 2016-12-13 | Paper |
| Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms | 2016-06-16 | Paper |
| \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region | 2016-04-18 | Paper |
| Adaptive simulated annealing: A near-optimal connection between sampling and counting | 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 | 2015-06-26 | Paper |
| Decidability of string graphs | 2015-02-27 | Paper |
| Phase transition for Glauber dynamics for independent sets on regular trees | 2014-09-26 | Paper |
| Improved inapproximability results for counting independent sets in the hard-core model | 2014-08-25 | Paper |
| An FPTAS for #Knapsack and Related Counting Problems | 2014-07-30 | Paper |
| Block additivity of \(\mathbb Z_{2}\)-embeddings | 2013-12-20 | Paper |
| Hanani-Tutte, monotone drawings, and level-planarity | 2013-09-25 | Paper |
| Negative examples for sequential importance sampling of binary contingency tables | 2013-04-03 | Paper |
| Adjacent crossings do matter | 2012-12-07 | Paper |
| A graph polynomial for independent sets of bipartite graphs | 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 | 2012-08-10 | Paper |
| The complexity of counting Eulerian tours in 4-regular graphs | 2012-04-26 | Paper |
| Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species | 2012-03-15 | Paper |
| Adjacent Crossings Do Matter | 2012-03-09 | Paper |
| Hanani-Tutte and monotone drawings | 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 | 2011-08-17 | Paper |
| Crossing numbers of graphs with rotation systems | 2011-06-30 | Paper |
| Spiraling and folding: the word view | 2011-06-30 | Paper |
| Removing Independently Even Crossings | 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 | 2010-08-16 | Paper |
| Recognizing string graphs in NP | 2010-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576669 | 2010-07-30 | Paper |
| The complexity of counting Eulerian tours in 4-regular graphs | 2010-04-27 | Paper |
| Removing independently even crossings | 2010-04-27 | Paper |
| On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games | 2009-12-04 | Paper |
| Removing even crossings on surfaces | 2009-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619952 | 2009-04-14 | Paper |
| Locally Testable Cyclic Codes | 2008-12-21 | Paper |
| Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems | 2008-10-28 | Paper |
| Removing Even Crossings on Surfaces | 2008-06-05 | Paper |
| Folding and Spiralling: The Word View | 2008-06-05 | Paper |
| Odd crossing number and crossing number are not the same | 2008-04-16 | Paper |
| Crossing Numbers and Parameterized Complexity | 2008-03-25 | Paper |
| Crossing Number of Graphs with Rotation Systems | 2008-03-25 | Paper |
| Negative examples for sequential importance sampling of binary contingency tables | 2008-03-11 | Paper |
| Removing even crossings | 2007-06-08 | Paper |
| Train tracks and confluent drawings | 2007-05-10 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Solvability of Graph Inequalities | 2006-06-01 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5317672 | 2005-09-19 | Paper |
| Decidability of string graphs | 2004-11-22 | Paper |
| Recognizing string graphs in NP | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808657 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536937 | 2002-11-06 | Paper |
| Set systems with restricted intersections modulo prime powers | 2001-10-21 | Paper |
| The complexity of shortest path and dilation bounded interval routing | 2000-08-21 | Paper |
| On the complexity of multi-dimensional interval routing schemes | 2000-08-21 | Paper |
