| Publication | Date of Publication | Type |
|---|
| Parameterised and fine-grained subgraph counting, modulo 2 | 2024-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187014 | 2024-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147392 | 2024-01-15 | Paper |
| Metastability of the Potts ferromagnet on random regular graphs | 2023-06-23 | Paper |
| Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics | 2023-05-22 | Paper |
| The Complexity of Approximately Counting Retractions | 2022-12-05 | Paper |
| Implementations and the independent set polynomial below the Shearer threshold | 2022-11-17 | Paper |
| The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs | 2022-09-21 | Paper |
| Counting Solutions to Random CNF Formulas | 2022-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091171 | 2022-07-21 | Paper |
| The complexity of approximating the complex-valued Potts model | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090447 | 2022-07-18 | Paper |
| The complexity of approximating the complex-valued Potts model | 2022-04-12 | Paper |
| Instability of backoff protocols with arbitrary arrival rates | 2022-03-31 | Paper |
| The Complexity of Approximating the Matching Polynomial in the Complex Plane | 2022-03-22 | Paper |
| The Complexity of Approximately Counting Retractions to Square-free Graphs | 2022-02-16 | Paper |
| Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 | 2021-12-01 | Paper |
| Faster exponential-time algorithms for approximately counting independent sets | 2021-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009528 | 2021-08-04 | Paper |
| Holant Clones and the Approximability of Conservative Holant Problems | 2021-05-03 | Paper |
| Random Walks on Small World Networks | 2021-05-03 | Paper |
| The complexity of approximating the complex-valued Ising model on bounded degree graphs | 2021-05-01 | Paper |
| Inapproximability of the Independent Set Polynomial in the Complex Plane | 2020-10-26 | Paper |
| Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems | 2020-10-23 | Paper |
| Phase transitions of the Moran process and algorithmic consequences | 2020-06-19 | Paper |
| The Complexity of Computing the Sign of the Tutte Polynomial | 2020-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111357 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111358 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111872 | 2020-05-27 | Paper |
| The complexity of approximating the complex-valued Potts model | 2020-05-03 | Paper |
| Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs | 2020-03-26 | Paper |
| Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin | 2020-02-24 | Paper |
| Approximating Pairwise Correlations in the Ising Model | 2019-12-16 | Paper |
| A Complexity Trichotomy for Approximately Counting List H -Colorings | 2019-12-06 | Paper |
| Counting Homomorphisms to Square-Free Graphs, Modulo 2 | 2019-12-06 | Paper |
| The Complexity of Approximately Counting Retractions | 2019-10-15 | Paper |
| A fixed-parameter perspective on \#BIS | 2019-09-10 | Paper |
| The Complexity of Counting Surjective Homomorphisms and Compactions | 2019-08-29 | Paper |
| Inapproximability of the independent set polynomial in the complex plane | 2019-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743450 | 2019-05-10 | Paper |
| Approximation via Correlation Decay When Strong Spatial Mixing Fails | 2019-05-07 | Paper |
| Fast algorithms at low temperatures via Markov chains | 2019-01-20 | Paper |
| Asymptotically optimal amplifiers for the Moran process | 2019-01-10 | Paper |
| Uniqueness for the 3-state antiferromagnetic Potts model on the tree | 2018-10-25 | Paper |
| Amplifiers for the Moran Process | 2018-08-02 | Paper |
| The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs | 2018-07-16 | Paper |
| Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs | 2018-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608005 | 2018-03-15 | Paper |
| Amplifiers for the Moran Process | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598184 | 2017-12-19 | Paper |
| A complexity trichotomy for approximately counting list H-colourings | 2017-12-19 | Paper |
| The complexity of approximating complex-valued Ising and Tutte partition functions | 2017-12-18 | Paper |
| On the fixation probability of superstars | 2017-09-29 | Paper |
| Functional clones and expressibility of partition functions | 2017-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969647 | 2017-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969651 | 2017-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965497 | 2017-03-03 | Paper |
| A complexity classification of spin systems with an external field | 2017-02-16 | Paper |
| The complexity of approximating conservative counting CSPs. | 2017-01-30 | Paper |
| The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs | 2016-11-18 | Paper |
| The complexity of counting homomorphisms to cactus graphs modulo 2 | 2016-10-24 | Paper |
| Counting \(4 \times 4\) matrix partitions of graphs | 2016-09-12 | Paper |
| Absorption time of the Moran process | 2016-09-07 | Paper |
| Approximately counting locally-optimal structures | 2016-06-13 | Paper |
| Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard | 2016-06-01 | Paper |
| The complexity of counting locally maximal satisfying assignments of Boolean CSPs | 2016-05-18 | Paper |
| \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region | 2016-04-18 | Paper |
| Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard | 2015-10-27 | Paper |
| Counting Homomorphisms to Square-Free Graphs, Modulo 2 | 2015-10-27 | Paper |
| Approximately Counting Locally-Optimal Structures | 2015-10-27 | Paper |
| The Complexity of Approximately Counting Tree Homomorphisms | 2015-09-03 | Paper |
| Counting List Matrix Partitions of Graphs | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501795 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501839 | 2015-08-14 | Paper |
| Polynomial space polynomial delay algorithms for listing families of graphs | 2015-05-07 | Paper |
| Approximating fixation probabilities in the generalized Moran process | 2014-11-19 | Paper |
| The complexity of approximating conservative counting CSPs | 2014-09-22 | Paper |
| Approximating the partition function of planar two-state spin systems | 2014-09-22 | Paper |
| The expressibility of functions on the boolean domain, with applications to counting CSPs | 2014-02-17 | Paper |
| Approximating the Partition Function of the Ferromagnetic Potts Model | 2014-02-17 | Paper |
| A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid | 2013-09-25 | Paper |
| The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) | 2013-08-12 | Paper |
| Ranking games that have competitiveness-based strategies | 2013-04-17 | Paper |
| Adaptive drift analysis | 2013-03-05 | Paper |
| Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials | 2013-02-21 | Paper |
| The complexity of approximating bounded-degree Boolean \(\#\)CSP | 2013-01-17 | Paper |
| Inapproximability of the Tutte polynomial of a planar graph | 2012-12-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904771 | 2012-08-23 | Paper |
| The complexity of approximately counting stable roommate assignments | 2012-08-17 | Paper |
| The complexity of approximately counting stable matchings | 2012-08-08 | Paper |
| A counterexample to rapid mixing of the Ge-Stefankovic process | 2012-06-22 | Paper |
| The complexity of weighted and unweighted \(\#\)CSP | 2012-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5390002 | 2012-04-24 | Paper |
| The Complexity of Approximating Bounded-Degree Boolean #CSP | 2012-01-23 | Paper |
| A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid | 2011-07-06 | Paper |
| A Complexity Dichotomy for Partition Functions with Mixed Signs | 2011-04-04 | Paper |
| A complexity dichotomy for hypergraph partition functions | 2011-02-18 | Paper |
| Efficient Algorithms for Listing Combinatorial Structures | 2011-01-25 | Paper |
| The mixing time of Glauber dynamics for coloring regular trees | 2010-11-24 | Paper |
| The Complexity of Approximately Counting Stable Matchings | 2010-09-10 | Paper |
| Approximating the Partition Function of the Ferromagnetic Potts Model | 2010-09-07 | Paper |
| Distributed selfish load balancing | 2010-08-16 | Paper |
| The complexity of choosing an H -colouring (nearly) uniformly at random | 2010-08-05 | Paper |
| Markov chain comparison | 2010-06-29 | Paper |
| An approximation trichotomy for Boolean \#CSP | 2010-05-25 | Paper |
| On the computational complexity of weighted voting games | 2010-03-15 | Paper |
| The Complexity of Weighted Boolean #CSP | 2009-11-06 | Paper |
| The complexity of weighted Boolean \#CSP with mixed signs | 2009-09-10 | Paper |
| A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications | 2009-08-14 | Paper |
| Matrix norms and rapid mixing for spin systems | 2009-04-02 | Paper |
| On Counting Homomorphisms to Directed Acyclic Graphs | 2009-03-12 | Paper |
| Dobrushin Conditions and Systematic Scan | 2009-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549645 | 2009-01-05 | Paper |
| On counting homomorphisms to directed acyclic graphs | 2008-12-21 | Paper |
| Inapproximability of the Tutte polynomial | 2008-08-14 | Paper |
| Distributed Selfish Load Balancing | 2008-08-14 | Paper |
| Dobrushin Conditions and Systematic Scan | 2007-08-28 | Paper |
| Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2 | 2007-04-04 | Paper |
| Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows | 2007-03-27 | Paper |
| The Complexity of Ferromagnetic Ising with Local Fields | 2007-03-20 | Paper |
| Utilitarian resource assignment | 2007-02-14 | Paper |
| Contention resolution with constant expected delay | 2006-09-12 | Paper |
| Systematic scan for sampling colorings | 2006-06-29 | Paper |
| Strong Spatial Mixing with Fewer Colors for Lattice Graphs | 2006-06-01 | Paper |
| A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols | 2005-02-21 | Paper |
| The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random | 2005-02-21 | Paper |
| Counting and sampling \(H\)-colourings | 2004-11-23 | Paper |
| The relative complexity of approximate counting problems | 2004-09-22 | Paper |
| Random sampling of 3‐colorings in ℤ2 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440427 | 2003-12-17 | Paper |
| The computational complexity of two‐state spin systems | 2003-11-10 | Paper |
| The Natural Work-Stealing Algorithm is Stable | 2003-09-28 | Paper |
| Convergence of the Iterated Prisoner's Dilemma Game | 2003-03-17 | Paper |
| The Complexity of Gene Placement | 2002-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501533 | 2002-06-13 | Paper |
| The ‘Burnside Process’ Converges Slowly | 2002-05-14 | Paper |
| Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753731 | 2002-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754194 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754189 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741175 | 2001-09-09 | Paper |
| An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings | 2001-06-21 | Paper |
| Better Approximation Guarantees for Job-Shop Scheduling | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952676 | 2000-10-23 | Paper |
| Counting Unlabelled Subtrees of a Tree is #P-complete | 2000-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247204 | 2000-09-24 | Paper |
| Analysis of practical backoff protocols for contention resolution with multiple servers | 2000-06-29 | Paper |
| Randomly Sampling Molecules | 2000-03-19 | Paper |
| Approximation algorithms for the fixed-topology phylogenetic number problem | 2000-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252311 | 1999-09-15 | Paper |
| An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks | 1998-09-20 | Paper |
| Constructing Computer Virus Phylogenies | 1998-02-09 | Paper |
| Minimizing phylogenetic number to find good evolutionary trees | 1998-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875230 | 1996-09-22 | Paper |
| Listing graphs that satisfy first-order sentences | 1994-12-04 | Paper |
| Efficient Algorithms for Listing Combinatorial Structures | 1994-02-17 | Paper |
| Automating Pólya theory: The computational complexity of the cycle index polynomial | 1993-09-01 | Paper |
| Efficient algorithms for listing unlabeled graphs | 1992-06-28 | Paper |
