World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
59
Citations
12070
World Ranking
3469
National Ranking
211

Mathematics

D-Index
58
Citations
11850
World Ranking
643
National Ranking
49

Overview

Martin Dyer is a researcher affiliated with the University of Leeds in the United Kingdom. Their work spans primarily the fields of Mathematics and Computer Science, with a strong focus on Statistics and Probability, Computational Theory and Mathematics, and Mathematical Physics among others.

The main topics addressed in their research include Markov Chains and Monte Carlo Methods, Advanced Graph Theory Research, Stochastic Processes and Statistical Mechanics, Graph Theory and Applications, Topological and Geometric Data Analysis, Theoretical and Computational Physics, and Sparse and Compressive Sensing Techniques.

Dyer has contributed to several publication venues, notably:

  • Queen Mary Research Online (Queen Mary University of London)
  • Random Structures and Algorithms
  • Journal of Computer and System Sciences
  • Discrete Mathematics
  • SIAM Journal on Discrete Mathematics

Some recent papers include:

  • "Counting weighted independent sets beyond the permanent," 2021, Queen Mary Research Online (Queen Mary University of London)
  • "Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs," 2021, Queen Mary Research Online (Queen Mary University of London)
  • "A dichotomy for bounded degree graph homomorphisms with nonnegative weights," 2022, Journal of Computer and System Sciences
  • "Sampling hypergraphs with given degrees," 2021, Discrete Mathematics
  • "Counting Weighted Independent Sets beyond the Permanent," 2021, SIAM Journal on Discrete Mathematics

Frequent collaborators include Haiko Müller, Mark Jerrum, Catherine Greenhill, Kristina Vušković, and Marc Heinrich. These coauthors have worked with Dyer on multiple occasions, indicating ongoing research partnerships.

Best Publications

  • A random polynomial-time algorithm for approximating the volume of convex bodies

    Martin Dyer;Alan Frieze;Ravi Kannan

  • Path coupling: A technique for proving rapid mixing in Markov chains

    R. Bubley;M. Dyer

  • On the complexity of computing the volume of a polyhedron

    M. E. Dyer;A. M. Frieze

  • Locating the phase transition in binary constraint satisfaction problems

    Barbara M. Smith;Martin E. Dyer

  • Formulating the single machine sequencing problem with release dates as a mixed integer program

    M. E. Dyer;L. A. Wolsey

  • Computational complexity of stochastic programming problems

    Martin Dyer;Leen Stougie

  • On the relative complexity of approximate counting problems

    Martin E. Dyer;Leslie Ann Goldberg;Catherine S. Greenhill;Mark Jerrum

  • The complexity of counting graph homomorphisms

    Martin Dyer;Catherine Greenhill

  • Faster random generation of linear extensions

    Russ Bubley;Martin Dyer

  • Linear Time Algorithms for Two- and Three-Variable Linear Programs

    Martin E. Dyer

  • A simple heuristic for the p-centre problem

    M.E Dyer;A.M Frieze

  • The Complexity of Vertex Enumeration Methods

    Martin E. Dyer

  • The solution of some random NP-hard problems in polynomial expected time

    M. E. Dyer;A. M. Frieze

  • Sampling Regular Graphs and a Peer-to-Peer Network

    Colin Cooper;Martin Dyer;Catherine Greenhill

  • On Counting Independent Sets in Sparse Graphs

    Martin Dyer;Alan Frieze;Mark Jerrum

  • On the complexity of partitioning graphs into connected subgraphs

    Martin E. Dyer;Alan M. Frieze

  • On a multidimensional search technique and its application to the Euclidean one centre problem

    M E Dyer

  • Computing the volume of convex bodies : a case where randomness provably helps

    Martin Dyer

  • Planar 3DM is NP -complete

    M E Dyer;A M Frieze;A M Frieze

  • On Markov Chains for Independent Sets

    Martin Dyer;Catherine Greenhill

  • A random polynomial time algorithm for approximating the volume of convex bodies

    M. Dyer;A. Frieze

Frequent Co-Authors

Alan Frieze
Alan Frieze Carnegie Mellon University
Mark Jerrum
Mark Jerrum Queen Mary University of London
Leslie Ann Goldberg
Leslie Ann Goldberg University of Oxford
Colin Cooper
Colin Cooper University of East Anglia
Eric Vigoda
Eric Vigoda University of California, Santa Barbara
Leen Stougie
Leen Stougie Centrum Wiskunde & Informatica
Marek Karpinski
Marek Karpinski University of Bonn
Ravi Kannan
Ravi Kannan Microsoft (United States)
Mike Paterson
Mike Paterson University of Warwick
Colin McDiarmid
Colin McDiarmid University of Oxford

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to diverse career paths, especially when combined with related fields like data analytics and business administration. For those looking to enhance their quantitative skills, pursuing one of the best masters in data analytics programs offers a practical focus on interpreting complex data—a valuable asset in today’s job market.

Alternatively, professionals eager to move into leadership roles often consider earning an MBA. Finding the easiest mba to get into can make this transition smoother, providing essential business knowledge alongside mathematical expertise without undue admissions barriers.

Additionally, online options such as the easiest online mba programs offer flexible schedules that accommodate working students and allow continued career advancement. For those focused on higher-level business research or consultancy, exploring the cheapest online dba can provide an affordable path to a Doctor of Business Administration.

By integrating mathematics with these complementary degrees, students can significantly broaden their career prospects in analytics, management, and beyond.

Best Scientists Citing Martin Dyer

Trending Scientists

Recently Published Articles