| Publication | Date of Publication | Type |
|---|
| Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows | 2026-05-29 | Paper |
| Randomly coloring constant degree graphs | 2026-05-29 | Paper |
| Path coupling: a technique for proving rapid mixing in Markov chains | 2026-05-21 | Paper |
| Randomly colouring graphs with lower bounds on girth and maximum degree | 2026-05-08 | Paper |
| On counting independent sets in sparse graphs | 2026-05-06 | Paper |
| A dichotomy for bounded degree graph homomorphisms with nonnegative weights | 2026-03-18 | Paper |
Thick forests
Discrete Applied Mathematics | 2026-03-05 | Paper |
Triangle processes on graphs with given degree sequence
Random Structures & Algorithms | 2025-08-26 | Paper |
Counting independent sets in graphs with bounded bipartite pathwidth
Random Structures & Algorithms | 2023-10-12 | Paper |
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
Combinatorics, Probability and Computing | 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
Journal of Computer and System Sciences | 2023-01-09 | Paper |
Locating the phase transition in binary constraint satisfaction problems
Artificial Intelligence | 2022-09-22 | Paper |
A triangle process on regular graphs
(available as arXiv preprint) | 2022-03-22 | Paper |
Counting weighted independent sets beyond the permanent
SIAM Journal on Discrete Mathematics | 2021-06-28 | Paper |
Random walks on small world networks
ACM Transactions on Algorithms | 2021-05-03 | Paper |
A triangle process on regular graphs
(available as arXiv preprint) | 2020-12-23 | Paper |
| Counting independent sets in graphs with bounded bipartite pathwidth | 2020-02-24 | Paper |
Counting independent sets in graphs with bounded bipartite pathwidth
(available as arXiv preprint) | 2020-02-24 | Paper |
Quasimonotone graphs
Discrete Applied Mathematics | 2019-11-27 | Paper |
Counting perfect matchings and the switch chain
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
| Triangle-creation processes on cubic graphs | 2019-05-11 | Paper |
Counting independent sets in cocomparability graphs
Information Processing Letters | 2019-02-13 | Paper |
Counting independent sets in cocomparability graphs
Information Processing Letters | 2019-02-13 | Paper |
The flip Markov chain for connected regular graphs
Discrete Applied Mathematics | 2019-02-08 | Paper |
The flip Markov chain for connected regular graphs
Discrete Applied Mathematics | 2019-02-08 | Paper |
Counting independent sets in graphs with bounded bipartite pathwidth
(available as arXiv preprint) | 2018-12-07 | Paper |
Quasimonotone graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
Discordant Voting Processes on Finite Graphs
SIAM Journal on Discrete Mathematics | 2018-10-18 | Paper |
On the switch Markov chain for perfect matchings
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the switch Markov chain for perfect matchings
Journal of the ACM | 2018-05-17 | Paper |
| Discordant voting processes on finite graphs | 2017-12-19 | Paper |
| scientific article; zbMATH DE number 6783443 (Why is no real title available?) | 2017-09-29 | Paper |
| The complexity of approximating conservative counting CSPs | 2017-01-30 | Paper |
Counting 4 4 matrix partitions of graphs
Discrete Applied Mathematics | 2016-09-12 | Paper |
Graph classes and the switch Markov chain for matchings
Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI | 2016-02-19 | Paper |
Erratum to: ``Computational complexity of stochastic programming problems''
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
| scientific article; zbMATH DE number 6472599 (Why is no real title available?) | 2015-08-14 | Paper |
On the chromatic number of a random hypergraph
Journal of Combinatorial Theory. Series B | 2015-06-10 | Paper |
| Sampling regular graphs and a peer-to-peer network | 2014-10-13 | Paper |
The complexity of approximating conservative counting CSPs
Journal of Computer and System Sciences | 2014-09-22 | Paper |
On the complexity of \#CSP
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
The flip Markov chain and a randomising P2P protocol
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Structure and eigenvalues of heat-bath Markov chains
Linear Algebra and its Applications | 2014-06-04 | Paper |
The expressibility of functions on the Boolean domain, with applications to counting CSPs
Journal of the ACM | 2014-02-17 | Paper |
Randomly coloring constant degree graphs
Random Structures & Algorithms | 2013-10-09 | Paper |
An effective dichotomy for the counting constraint satisfaction problem
SIAM Journal on Computing | 2013-09-25 | Paper |
The complexity of approximating bounded-degree Boolean \(\#\)CSP
Information and Computation | 2013-01-17 | Paper |
| Log-supermodular functions, functional clones and counting CSPs | 2012-08-23 | Paper |
The complexity of weighted and unweighted \(\#\)CSP
Journal of Computer and System Sciences | 2012-05-11 | Paper |
| scientific article; zbMATH DE number 5999552 (Why is no real title available?) | 2012-01-23 | Paper |
| The complexity of approximating bounded-degree Boolean \#CSP | 2012-01-23 | Paper |
Pairwise-interaction games
Automata, Languages and Programming | 2011-07-06 | Paper |
Approximately counting integral flows and cell-bounded contingency tables
SIAM Journal on Computing | 2011-04-04 | Paper |
A complexity dichotomy for hypergraph partition functions
Computational Complexity | 2011-02-18 | Paper |
Randomly coloring random graphs
Random Structures & Algorithms | 2010-11-10 | Paper |
Approximate counting by dynamic programming
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Approximately counting integral flows and cell-bounded contingency tables
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Markov chain comparison
Probability Surveys | 2010-06-29 | Paper |
Markov chain comparison
Probability Surveys | 2010-06-29 | Paper |
An approximation trichotomy for Boolean \#CSP
Journal of Computer and System Sciences | 2010-05-25 | Paper |
The Complexity of Weighted Boolean #CSP
SIAM Journal on Computing | 2009-11-06 | Paper |
The Complexity of Weighted Boolean #CSP
SIAM Journal on Computing | 2009-11-06 | Paper |
The complexity of weighted Boolean \#CSP with mixed signs
Theoretical Computer Science | 2009-09-10 | Paper |
Matrix norms and rapid mixing for spin systems
The Annals of Applied Probability | 2009-04-02 | Paper |
On Counting Homomorphisms to Directed Acyclic Graphs
Automata, Languages and Programming | 2009-03-12 | Paper |
Stopping Times, Metrics and Approximate Counting
Automata, Languages and Programming | 2009-03-12 | Paper |
Dobrushin Conditions and Systematic Scan
Combinatorics, Probability and Computing | 2009-03-04 | Paper |
Random walks on the vertices of transportation polytopes with constant number of sources
Random Structures & Algorithms | 2009-03-04 | Paper |
On counting homomorphisms to directed acyclic graphs
Journal of the ACM | 2008-12-21 | Paper |
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Random Structures & Algorithms | 2008-06-05 | Paper |
Sampling Regular Graphs and a Peer-to-Peer Network
Combinatorics, Probability and Computing | 2008-01-18 | Paper |
Path coupling without contraction
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Dobrushin Conditions and Systematic Scan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
SIAM Journal on Computing | 2007-03-27 | Paper |
Randomly coloring sparse random graphs with fewer colors than the maximum degree
Random Structures & Algorithms | 2007-02-07 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Systematic scan for sampling colorings
The Annals of Applied Probability | 2006-06-29 | Paper |
Computational complexity of stochastic programming problems
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
| scientific article; zbMATH DE number 2151247 (Why is no real title available?) | 2005-04-04 | Paper |
| scientific article; zbMATH DE number 2151251 (Why is no real title available?) | 2005-04-04 | Paper |
Corrigendum: The complexity of counting graph homomorphisms
Random Structures & Algorithms | 2005-02-16 | Paper |
Counting and sampling \(H\)-colourings
Information and Computation | 2004-11-23 | Paper |
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
Journal of Computer and System Sciences | 2004-11-18 | Paper |
The relative complexity of approximate counting problems
Algorithmica | 2004-09-22 | Paper |
Mixing in time and space for lattice spin systems: A combinatorial view
Random Structures & Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2079356 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2040941 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 2019624 (Why is no real title available?) | 2003-12-17 | Paper |
| scientific article; zbMATH DE number 2019625 (Why is no real title available?) | 2003-12-17 | Paper |
| scientific article; zbMATH DE number 2019632 (Why is no real title available?) | 2003-12-17 | Paper |
Randomly coloring graphs with lower bounds on girth and maximum degree
Random Structures & Algorithms | 2003-11-10 | Paper |
Convergence of the Iterated Prisoner's Dilemma Game
Combinatorics, Probability and Computing | 2003-03-17 | Paper |
Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs
Random Structures & Algorithms | 2002-10-09 | Paper |
On Counting Independent Sets in Sparse Graphs
SIAM Journal on Computing | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1670534 (Why is no real title available?) | 2002-01-06 | Paper |
| scientific article; zbMATH DE number 1281304 (Why is no real title available?) | 2001-11-13 | Paper |
Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids
Journal of Mathematical Physics | 2001-08-30 | Paper |
On Markov chains for randomly H-coloring a graph
Journal of Algorithms | 2001-07-29 | Paper |
| scientific article; zbMATH DE number 1545676 (Why is no real title available?) | 2001-07-29 | Paper |
An extension of path coupling and its application to the Glauber dynamics for graph colorings
SIAM Journal on Computing | 2001-06-21 | Paper |
Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1445311 (Why is no real title available?) | 2001-03-02 | Paper |
| scientific article; zbMATH DE number 1445357 (Why is no real title available?) | 2000-10-23 | Paper |
On Markov Chains for Independent Sets
Journal of Algorithms | 2000-10-04 | Paper |
| scientific article; zbMATH DE number 1303576 (Why is no real title available?) | 2000-06-21 | Paper |
Faster random generation of linear extensions
Discrete Mathematics | 2000-04-27 | Paper |
| A more rapidly mixing Markov chain for graph colorings | 1999-12-19 | Paper |
| scientific article; zbMATH DE number 1342087 (Why is no real title available?) | 1999-11-21 | Paper |
On Approximately Counting Colorings of Small Degree Graphs
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1223716 (Why is no real title available?) | 1999-07-07 | Paper |
| scientific article; zbMATH DE number 1182931 (Why is no real title available?) | 1999-01-19 | Paper |
Approximately Counting Hamilton Paths and Cycles in Dense Graphs
SIAM Journal on Computing | 1998-09-20 | Paper |
On The Complexity of Computing Mixed Volumes
SIAM Journal on Computing | 1998-05-10 | Paper |
| Sampling contingency tables | 1998-04-05 | Paper |
| scientific article; zbMATH DE number 1003244 (Why is no real title available?) | 1998-01-25 | Paper |
| scientific article; zbMATH DE number 1303575 (Why is no real title available?) | 1998-01-01 | Paper |
On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
Mathematics of Operations Research | 1997-10-28 | Paper |
| scientific article; zbMATH DE number 1003265 (Why is no real title available?) | 1997-04-23 | Paper |
The worst-case running time of the random simplex algorithm is exponential in the height
Information Processing Letters | 1997-02-27 | Paper |
Randomized greedy matching. II
Random Structures & Algorithms | 1995-05-09 | Paper |
On key storage in secure networks
Journal of Cryptology | 1995-01-01 | Paper |
On a universal chain problem
Discrete Applied Mathematics | 1994-09-11 | Paper |
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM | 1994-08-21 | Paper |
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
Mathematical Programming. Series A. Series B | 1994-08-10 | Paper |
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
Combinatorics, Probability and Computing | 1994-04-28 | Paper |
The average performance of the greedy matching algorithm
The Annals of Applied Probability | 1993-10-28 | Paper |
Probabilistic analysis of the generalised assignment problem
Mathematical Programming. Series A. Series B | 1992-12-17 | Paper |
Volumes Spanned by Random Points in the Hypercube
Random Structures & Algorithms | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 18983 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 16685 (Why is no real title available?) | 1992-06-26 | Paper |
On patching algorithms for random asymmetric travelling salesman problems
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
Randomized greedy matching
Random Structures & Algorithms | 1992-06-25 | Paper |
On Counting Lattice Points in Polyhedra
SIAM Journal on Computing | 1991-01-01 | Paper |
Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph
Random Structures & Algorithms | 1991-01-01 | Paper |
Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics | 1990-01-01 | Paper |
On an optimization problem with nested constraints
Discrete Applied Mathematics | 1990-01-01 | Paper |
The solution of some random NP-hard problems in polynomial expected time
Journal of Algorithms | 1989-01-01 | Paper |
A randomized algorithm for fixed-dimensional linear programming
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
Probabilistic Analysis of the Multidimensional Knapsack Problem
Mathematics of Operations Research | 1989-01-01 | Paper |
On the Complexity of Computing the Volume of a Polyhedron
SIAM Journal on Computing | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4059455 (Why is no real title available?) | 1987-01-01 | Paper |
Planar 3DM is NP-complete
Journal of Algorithms | 1986-01-01 | Paper |
On linear programs with random costs
Mathematical Programming | 1986-01-01 | Paper |
On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
SIAM Journal on Computing | 1986-01-01 | Paper |
A simple heuristic for the p-centre problem
Operations Research Letters | 1985-01-01 | Paper |
On the complexity of partitioning graphs into connected subgraphs
Discrete Applied Mathematics | 1985-01-01 | Paper |
Analysis of heuristics for finding a maximum weight planar subgraph
European Journal of Operational Research | 1985-01-01 | Paper |
An O(n) algorithm for the multiple-choice knapsack linear program
Mathematical Programming | 1984-01-01 | Paper |
Linear Time Algorithms for Two- and Three-Variable Linear Programs
SIAM Journal on Computing | 1984-01-01 | Paper |
A partitioning algorithm for minimum weighted Euclidean matching
Information Processing Letters | 1984-01-01 | Paper |
Partitioning heuristics for two geometric maximization problems
Operations Research Letters | 1984-01-01 | Paper |
The Complexity of Vertex Enumeration Methods
Mathematics of Operations Research | 1983-01-01 | Paper |
An improved vertex enumeration algorithm
European Journal of Operational Research | 1982-01-01 | Paper |
Calculating surrogate constraints
Mathematical Programming | 1980-01-01 | Paper |
Eliminating extraneous edges in Greenberg's algorithm
Mathematical Programming | 1980-01-01 | Paper |
An algorithm for determining all extreme points of a convex polytope
Mathematical Programming | 1977-01-01 | Paper |
Note—On the Validity of Marginal Analysis for Allocating Servers in <i>M</i>/<i>M</i>/<i>c</i> Queues
Management Science | 1977-01-01 | Paper |
Thick Forests
(available as arXiv preprint) | N/A | Paper |
