| Publication | Date of Publication | Type |
|---|
| Counting independent sets in graphs with bounded bipartite pathwidth | 2023-10-12 | Paper |
| Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs | 2023-03-30 | Paper |
| A triangle process on graphs with given degree sequence | 2023-01-20 | Paper |
| A dichotomy for bounded degree graph homomorphisms with nonnegative weights | 2023-01-09 | Paper |
| Locating the phase transition in binary constraint satisfaction problems | 2022-09-22 | Paper |
| A triangle process on regular graphs | 2022-03-22 | Paper |
| Counting Weighted Independent Sets beyond the Permanent | 2021-06-28 | Paper |
| Random Walks on Small World Networks | 2021-05-03 | Paper |
| A triangle process on regular graphs | 2020-12-23 | Paper |
| Counting independent sets in graphs with bounded bipartite pathwidth | 2020-02-24 | Paper |
| Quasimonotone graphs | 2019-11-27 | Paper |
| Counting Perfect Matchings and the Switch Chain | 2019-08-29 | Paper |
| Triangle-creation processes on cubic graphs | 2019-05-11 | Paper |
| Counting independent sets in cocomparability graphs | 2019-02-13 | Paper |
| The flip Markov chain for connected regular graphs | 2019-02-08 | Paper |
| Counting independent sets in graphs with bounded bipartite pathwidth | 2018-12-07 | Paper |
| Quasimonotone graphs | 2018-11-22 | Paper |
| Discordant Voting Processes on Finite Graphs | 2018-10-18 | Paper |
| On the switch Markov chain for perfect matchings | 2018-07-16 | Paper |
| On the Switch Markov Chain for Perfect Matchings | 2018-05-17 | Paper |
| Discordant Voting Processes on Finite Graphs | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365091 | 2017-09-29 | Paper |
| The complexity of approximating conservative counting CSPs. | 2017-01-30 | Paper |
| Counting \(4 \times 4\) matrix partitions of graphs | 2016-09-12 | Paper |
| Graph classes and the switch Markov chain for matchings | 2016-02-19 | Paper |
| Erratum to: ``Computational complexity of stochastic programming problems | 2015-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501802 | 2015-08-14 | Paper |
| On the chromatic number of a random hypergraph | 2015-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921768 | 2014-10-13 | Paper |
| The complexity of approximating conservative counting CSPs | 2014-09-22 | Paper |
| On the complexity of #CSP | 2014-08-13 | Paper |
| The flip markov chain and a randomising P2P protocol | 2014-07-23 | Paper |
| Structure and eigenvalues of heat-bath Markov chains | 2014-06-04 | Paper |
| The expressibility of functions on the boolean domain, with applications to counting CSPs | 2014-02-17 | Paper |
| Randomly coloring constant degree graphs | 2013-10-09 | Paper |
| An Effective Dichotomy for the Counting Constraint Satisfaction Problem | 2013-09-25 | Paper |
| The complexity of approximating bounded-degree Boolean \(\#\)CSP | 2013-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904771 | 2012-08-23 | Paper |
| The complexity of weighted and unweighted \(\#\)CSP | 2012-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113690 | 2012-01-23 | Paper |
| The Complexity of Approximating Bounded-Degree Boolean #CSP | 2012-01-23 | Paper |
| Pairwise-Interaction Games | 2011-07-06 | Paper |
| Approximately Counting Integral Flows and Cell-Bounded Contingency Tables | 2011-04-04 | Paper |
| A complexity dichotomy for hypergraph partition functions | 2011-02-18 | Paper |
| Randomly coloring random graphs | 2010-11-10 | Paper |
| Approximate counting by dynamic programming | 2010-08-16 | Paper |
| Approximately counting integral flows and cell-bounded contingency tables | 2010-08-16 | Paper |
| A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant | 2010-08-05 | Paper |
| Markov chain comparison | 2010-06-29 | Paper |
| An approximation trichotomy for Boolean \#CSP | 2010-05-25 | Paper |
| The Complexity of Weighted Boolean #CSP | 2009-11-06 | Paper |
| The complexity of weighted Boolean \#CSP with mixed signs | 2009-09-10 | Paper |
| Matrix norms and rapid mixing for spin systems | 2009-04-02 | Paper |
| On Counting Homomorphisms to Directed Acyclic Graphs | 2009-03-12 | Paper |
| Stopping Times, Metrics and Approximate Counting | 2009-03-12 | Paper |
| Dobrushin Conditions and Systematic Scan | 2009-03-04 | Paper |
| Random walks on the vertices of transportation polytopes with constant number of sources | 2009-03-04 | Paper |
| On counting homomorphisms to directed acyclic graphs | 2008-12-21 | Paper |
| Path coupling using stopping times and counting independent sets and colorings in hypergraphs | 2008-06-05 | Paper |
| Sampling Regular Graphs and a Peer-to-Peer Network | 2008-01-18 | Paper |
| Path coupling without contraction | 2007-10-30 | Paper |
| Dobrushin Conditions and Systematic Scan | 2007-08-28 | Paper |
| Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows | 2007-03-27 | Paper |
| Randomly coloring sparse random graphs with fewer colors than the maximum degree | 2007-02-07 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Systematic scan for sampling colorings | 2006-06-29 | Paper |
| Computational complexity of stochastic programming problems | 2006-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660717 | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660721 | 2005-04-04 | Paper |
| Corrigendum: The complexity of counting graph homomorphisms | 2005-02-16 | Paper |
| Counting and sampling \(H\)-colourings | 2004-11-23 | Paper |
| A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant | 2004-11-18 | Paper |
| The relative complexity of approximate counting problems | 2004-09-22 | Paper |
| Mixing in time and space for lattice spin systems: A combinatorial view | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471315 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452091 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440427 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440428 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440435 | 2003-12-17 | Paper |
| Randomly coloring graphs with lower bounds on girth and maximum degree | 2003-11-10 | Paper |
| Convergence of the Iterated Prisoner's Dilemma Game | 2003-03-17 | Paper |
| Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs | 2002-10-09 | Paper |
| On Counting Independent Sets in Sparse Graphs | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753731 | 2002-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4240600 | 2001-11-13 | Paper |
| Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids | 2001-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4521549 | 2001-07-29 | Paper |
| On Markov Chains for Randomly H-Coloring a Graph | 2001-07-29 | Paper |
| An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings | 2001-06-21 | Paper |
| Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952624 | 2001-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952676 | 2000-10-23 | Paper |
| On Markov Chains for Independent Sets | 2000-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250202 | 2000-06-21 | Paper |
| Faster random generation of linear extensions | 2000-04-27 | Paper |
| A more rapidly mixing Markov chain for graph colorings | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263659 | 1999-11-21 | Paper |
| On Approximately Counting Colorings of Small Degree Graphs | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219031 | 1999-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401028 | 1999-01-19 | Paper |
| Approximately Counting Hamilton Paths and Cycles in Dense Graphs | 1998-09-20 | Paper |
| On The Complexity of Computing Mixed Volumes | 1998-05-10 | Paper |
| Sampling contingency tables | 1998-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335204 | 1998-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250201 | 1998-01-01 | Paper |
| On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension | 1997-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128893 | 1997-04-23 | Paper |
| The worst-case running time of the random simplex algorithm is exponential in the height | 1997-02-27 | Paper |
| Randomized greedy matching. II | 1995-05-09 | Paper |
| On key storage in secure networks | 1995-01-01 | Paper |
| On a universal chain problem | 1994-09-11 | Paper |
| A random polynomial-time algorithm for approximating the volume of convex bodies | 1994-08-21 | Paper |
| Random walks, totally unimodular matrices, and a randomised dual simplex algorithm | 1994-08-10 | Paper |
| A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem | 1994-04-28 | Paper |
| The average performance of the greedy matching algorithm | 1993-10-28 | Paper |
| Probabilistic analysis of the generalised assignment problem | 1992-12-17 | Paper |
| Volumes Spanned by Random Points in the Hypercube | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973370 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976408 | 1992-06-26 | Paper |
| On patching algorithms for random asymmetric travelling salesman problems | 1992-06-25 | Paper |
| Randomized greedy matching | 1992-06-25 | Paper |
| Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph | 1991-01-01 | Paper |
| On Counting Lattice Points in Polyhedra | 1991-01-01 | Paper |
| On an optimization problem with nested constraints | 1990-01-01 | Paper |
| Formulating the single machine sequencing problem with release dates as a mixed integer program | 1990-01-01 | Paper |
| A randomized algorithm for fixed-dimensional linear programming | 1989-01-01 | Paper |
| The solution of some random NP-hard problems in polynomial expected time | 1989-01-01 | Paper |
| Probabilistic Analysis of the Multidimensional Knapsack Problem | 1989-01-01 | Paper |
| On the Complexity of Computing the Volume of a Polyhedron | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3794221 | 1987-01-01 | Paper |
| On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem | 1986-01-01 | Paper |
| On linear programs with random costs | 1986-01-01 | Paper |
| Planar 3DM is NP-complete | 1986-01-01 | Paper |
| A simple heuristic for the p-centre problem | 1985-01-01 | Paper |
| On the complexity of partitioning graphs into connected subgraphs | 1985-01-01 | Paper |
| Analysis of heuristics for finding a maximum weight planar subgraph | 1985-01-01 | Paper |
| A partitioning algorithm for minimum weighted Euclidean matching | 1984-01-01 | Paper |
| Partitioning heuristics for two geometric maximization problems | 1984-01-01 | Paper |
| Linear Time Algorithms for Two- and Three-Variable Linear Programs | 1984-01-01 | Paper |
| An O(n) algorithm for the multiple-choice knapsack linear program | 1984-01-01 | Paper |
| The Complexity of Vertex Enumeration Methods | 1983-01-01 | Paper |
| An improved vertex enumeration algorithm | 1982-01-01 | Paper |
| Eliminating extraneous edges in Greenberg's algorithm | 1980-01-01 | Paper |
| Calculating surrogate constraints | 1980-01-01 | Paper |
| Note—On the Validity of Marginal Analysis for Allocating Servers in M/M/c Queues | 1977-01-01 | Paper |
| An algorithm for determining all extreme points of a convex polytope | 1977-01-01 | Paper |
