The following pages link to Martin Dyer (Q247119):
Displaying 50 items.
- Counting \(4 \times 4\) matrix partitions of graphs (Q313799) (← links)
- The complexity of weighted and unweighted \(\#\)CSP (Q414939) (← links)
- (Q583108) (redirect page) (← links)
- On an optimization problem with nested constraints (Q583110) (← links)
- A complexity dichotomy for hypergraph partition functions (Q626694) (← links)
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- The average performance of the greedy matching algorithm (Q687707) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- Erratum to: ``Computational complexity of stochastic programming problems'' (Q747782) (← links)
- A simple heuristic for the p-centre problem (Q761233) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
- The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)
- Formulating the single machine sequencing problem with release dates as a mixed integer program (Q909575) (← links)
- An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
- Markov chain comparison (Q980750) (← links)
- Matrix norms and rapid mixing for spin systems (Q1009479) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Analysis of heuristics for finding a maximum weight planar subgraph (Q1062924) (← links)
- An improved vertex enumeration algorithm (Q1160560) (← links)
- Probabilistic analysis of the generalised assignment problem (Q1196166) (← links)
- Faster random generation of linear extensions (Q1301730) (← links)
- On a universal chain problem (Q1317044) (← links)
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) (← links)
- The flip Markov chain for connected regular graphs (Q1720312) (← links)
- Counting independent sets in cocomparability graphs (Q1721932) (← links)
- On patching algorithms for random asymmetric travelling salesman problems (Q1813831) (← links)
- A randomized algorithm for fixed-dimensional linear programming (Q1823854) (← links)
- The relative complexity of approximate counting problems (Q1879247) (← links)
- Counting and sampling \(H\)-colourings (Q1887143) (← links)
- On key storage in secure networks (Q1903344) (← links)
- The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
- A triangle process on regular graphs (Q2115867) (← links)
- Counting independent sets in graphs with bounded bipartite pathwidth (Q2301551) (← links)
- On the chromatic number of a random hypergraph (Q2347844) (← links)
- Structure and eigenvalues of heat-bath Markov chains (Q2451698) (← links)
- Path coupling without contraction (Q2457299) (← links)
- Computational complexity of stochastic programming problems (Q2492669) (← links)
- Systematic scan for sampling colorings (Q2494577) (← links)
- Locating the phase transition in binary constraint satisfaction problems (Q2674182) (← links)
- A dichotomy for bounded degree graph homomorphisms with nonnegative weights (Q2678252) (← links)
- Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems (Q2706119) (← links)
- An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings (Q2719118) (← links)
- On Markov Chains for Randomly H-Coloring a Graph (Q2731604) (← links)
- Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids (Q2737882) (← links)
- (Q2753731) (← links)
- An Effective Dichotomy for the Counting Constraint Satisfaction Problem (Q2848220) (← links)
- Randomly coloring constant degree graphs (Q2852546) (← links)
- On the complexity of #CSP (Q2875200) (← links)
- (Q2904771) (← links)
