Martin E. Dyer

ORCID

Publication Activity (10 Years)

Years Active: 1977-2023
Publications (10 Years): 40

Top Venues

CoRR

SIAM J. Discret. Math.

Discret. Appl. Math.

J. Comput. Syst. Sci.

Publications

Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
A triangle process on graphs with given degree sequence. CoRR (2023)
Martin E. Dyer, Haiko Müller
Thick Forests. CoRR (2023)
Artem Govorov, Jin-Yi Cai, Martin E. Dyer
A dichotomy for bounded degree graph homomorphisms with nonnegative weights. J. Comput. Syst. Sci. 132 (2023)
Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Comb. Probab. Comput. 30 (6) (2021)
Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms 59 (2) (2021)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
A Triangle Process on Regular Graphs. IWOCA (2021)
Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic
Counting Weighted Independent Sets beyond the Permanent. SIAM J. Discret. Math. 35 (2) (2021)
Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie
Sampling hypergraphs with given degrees. Discret. Math. 344 (11) (2021)
Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. CoRR (2020)
Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie
Sampling hypergraphs with given degrees. CoRR (2020)
Artem Govorov, Jin-Yi Cai, Martin E. Dyer
A dichotomy for bounded degree graph homomorphisms with nonnegative weights. CoRR (2020)
Artem Govorov, Jin-Yi Cai, Martin E. Dyer
A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights. ICALP (2020)
Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda
Random Walks on Small World Networks. ACM Trans. Algorithms 16 (3) (2020)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
A triangle process on regular graphs. CoRR (2020)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
The flip Markov chain for connected regular graphs. Discret. Appl. Math. 254 (2019)
Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. WG (2019)
James Dyer, Martin E. Dyer, Karim Djemame
Order-preserving encryption using approximate common divisors. J. Inf. Secur. Appl. 49 (2019)
Martin E. Dyer, Haiko Müller
Counting Perfect Matchings and the Switch Chain. SIAM J. Discret. Math. 33 (3) (2019)
James Dyer, Martin E. Dyer, Jie Xu
Practical homomorphic encryption over the integers for secure computation in the cloud. Int. J. Inf. Sec. 18 (5) (2019)
Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic
Counting weighted independent sets beyond the permanent. CoRR (2019)
Martin E. Dyer, Haiko Müller
Quasimonotone graphs. Discret. Appl. Math. 271 (2019)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
Triangle-creation processes on cubic graphs. CoRR (2019)
Martin E. Dyer, Haiko Müller
Counting independent sets in cocomparability graphs. Inf. Process. Lett. 144 (2019)
Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolás Rivera
Discordant Voting Processes on Finite Graphs. SIAM J. Discret. Math. 32 (4) (2018)
Martin E. Dyer, Haiko Müller
Quasimonotone Graphs. WG (2018)
Martin E. Dyer, Haiko Müller
Quasimonotone graphs. CoRR (2018)
Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
Counting independent sets in graphs with bounded bipartite pathwidth. CoRR (2018)
Martin E. Dyer, Haiko Müller
Counting Independent Sets in Cocomparability Graphs. CoRR (2018)
James Dyer, Martin E. Dyer, Jie Xu
Practical Homomorphic Encryption Over the Integers for Secure Computation in the Cloud. IMACC (2017)
Martin E. Dyer, Haiko Müller
Counting perfect matchings and the switch chain. CoRR (2017)
Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda
Random Walks on Small World Networks. CoRR (2017)
Martin E. Dyer, Mark Jerrum, Haiko Müller
On the Switch Markov Chain for Perfect Matchings. J. ACM 64 (2) (2017)
James Dyer, Martin E. Dyer, Jie Xu
Order-Preserving Encryption Using Approximate Integer Common Divisors. CoRR (2017)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
The flip Markov chain for connected regular graphs. CoRR (2017)
James Dyer, Martin E. Dyer, Jie Xu
Order-Preserving Encryption Using Approximate Integer Common Divisors. DPM/CBT@ESORICS (2017)
James Dyer, Martin E. Dyer, Jie Xu
Practical Homomorphic Encryption Over the Integers. CoRR (2017)
Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
Discordant Voting Processes on Finite Graphs. ICALP (2016)
Martin E. Dyer, Mark Jerrum, Haiko Müller
On the switch Markov chain for perfect matchings. SODA (2016)
Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
Discordant voting processes on finite graphs. CoRR (2016)
Martin E. Dyer, Leslie Ann Goldberg, David Richerby
Counting 4×4 matrix partitions of graphs. Discret. Appl. Math. 213 (2016)
Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. 81 (1) (2015)
Martin E. Dyer, Leen Stougie
Erratum to: Computational complexity of stochastic programming problems. Math. Program. 153 (2) (2015)
Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill
On the chromatic number of a random hypergraph. J. Comb. Theory, Ser. B 113 (2015)
Martin E. Dyer, Mark Jerrum, Haiko Müller
On the switch Markov chain for perfect matchings. CoRR (2015)
Martin E. Dyer, Leslie Ann Goldberg, David Richerby
Counting 4×4 Matrix Partitions of Graphs. CoRR (2014)
Martin E. Dyer, Ravi Kannan, Leen Stougie
A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming. Math. Program. 147 (1-2) (2014)
Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
Randomly coloring constant degree graphs. Random Struct. Algorithms 43 (2) (2013)
Martin E. Dyer, David Richerby
An Effective Dichotomy for the Counting Constraint Satisfaction Problem. SIAM J. Comput. 42 (3) (2013)
Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
The complexity of approximating conservative counting CSPs. STACS (2013)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan
The expressibility of functions on the boolean domain, with applications to counting CSPs. J. ACM 60 (5) (2013)
Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill
On the chromatic number of a random hypergraph CoRR (2012)
Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
The complexity of approximating conservative counting CSPs CoRR (2012)
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. 220 (2012)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. 78 (2) (2012)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
Log-supermodular functions, functional clones and counting CSPs. STACS (2012)
Colin Cooper, Martin E. Dyer, Velumailum Mohanaraj
On the Imitation Strategy for Games on Graphs CoRR (2011)
Martin E. Dyer, Velumailum Mohanaraj
Pairwise-Interaction Games. ICALP (1) (2011)
Martin E. Dyer, David Richerby
The #CSP Dichotomy is Decidable. STACS (2011)
Martin E. Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). Dagstuhl Reports 1 (6) (2011)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
Log-supermodular functions, functional clones and counting CSPs CoRR (2011)
Martin E. Dyer, Velumailum Mohanaraj
The Iterated Prisoner's Dilemma on a Cycle CoRR (2011)
Colin Cooper, Martin E. Dyer, Andrew J. Handley
Networks of random cycles. SODA (2011)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
The complexity of weighted and unweighted #CSP CoRR (2010)
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
A Complexity Dichotomy For Hypergraph Partition Functions. Comput. Complex. 19 (4) (2010)
Mary Cryan, Martin E. Dyer, Dana Randall
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables. SIAM J. Comput. 39 (7) (2010)
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. 76 (3-4) (2010)
Martin E. Dyer, Alan M. Frieze
Randomly coloring random graphs. Random Struct. Algorithms 36 (3) (2010)
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) CoRR (2010)
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS (2010)
Martin E. Dyer, David Richerby
On the complexity of #CSP. STOC (2010)
Martin E. Dyer, David Richerby
The Complexity of #CSP CoRR (2010)
Colin Cooper, Martin E. Dyer, Andrew J. Handley
The flip markov chain and a randomising P2P protocol. PODC (2009)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. 410 (38-40) (2009)
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The Complexity of Approximating Bounded-Degree Boolean #CSP CoRR (2009)
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
The Complexity of Weighted Boolean #CSP. SIAM J. Comput. 38 (5) (2009)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The Complexity of Weighted Boolean #CSP with Mixed Signs CoRR (2008)
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
Dobrushin Conditions and Systematic Scan. Comb. Probab. Comput. 17 (6) (2008)
Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie
Random walks on the vertices of transportation polytopes with constant number of sources. Random Struct. Algorithms 33 (3) (2008)
Martin E. Dyer, Mark Jerrum, Marek Karpinski
08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Design and Analysis of Randomized and Approximation Algorithms (2008)
Magnus Bordewich, Martin E. Dyer, Marek Karpinski
Path coupling using stopping times and counting independent sets and colorings in hypergraphs. Random Struct. Algorithms 32 (3) (2008)
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
A complexity dichotomy for hypergraph partition functions CoRR (2008)
Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
On counting homomorphisms to directed acyclic graphs. J. ACM 54 (6) (2007)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
Sampling Regular Graphs and a Peer-to-Peer Network. Comb. Probab. Comput. 16 (4) (2007)
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
An approximation trichotomy for Boolean #CSP CoRR (2007)
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
Matrix norms and rapid mixing for spin systems CoRR (2007)
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
The Complexity of Weighted Boolean #CSP CoRR (2007)
Magnus Bordewich, Martin E. Dyer
Path coupling without contraction. J. Discrete Algorithms 5 (2) (2007)
Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda
Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms 29 (4) (2006)
Martin E. Dyer, Leen Stougie
Computational complexity of stochastic programming problems. Math. Program. 106 (3) (2006)
Magnus Bordewich, Martin E. Dyer, Marek Karpinski
Stopping Times, Metrics and Approximate Counting. ICALP (1) (2006)
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
Dobrushin Conditions and Systematic Scan. APPROX-RANDOM (2006)
Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
On Counting Homomorphisms to Directed Acyclic Graphs. ICALP (1) (2006)
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. SIAM J. Comput. 36 (1) (2006)
Magnus Bordewich, Martin E. Dyer, Marek Karpinski
Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs Electron. Colloquium Comput. Complex. (002) (2005)
Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
On counting homomorphisms to directed acyclic graphs Electron. Colloquium Comput. Complex. (121) (2005)
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
Dobrushin conditions and Systematic Scan Electron. Colloquium Comput. Complex. (075) (2005)
Mary Cryan, Martin E. Dyer, Dana Randall
Approximately counting integral flows and cell-bounded contingency tables. STOC (2005)
Magnus Bordewich, Martin E. Dyer, Marek Karpinski
Path Coupling Using Stopping Times. FCT (2005)
Martin E. Dyer, Mark Jerrum, Marek Karpinski
05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Design and Analysis of Randomized and Approximation Algorithms (2005)
Magnus Bordewich, Martin E. Dyer, Marek Karpinski
Metric Construction, Stopping Times and Path Coupling. Electron. Colloquium Comput. Complex. (151) (2005)

Martin E. Dyer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin E. Dyer