World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
33
Citations
8436
World Ranking
12402
National Ranking
5027

Overview

Marijn J. H. Heule is affiliated with Carnegie Mellon University in the United States. Their research primarily spans the field of Computer Science, with a strong focus on subfields such as Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering, and Software.

The academic work of Marijn J. H. Heule covers a range of topics including Logic, Programming, and Type Systems; Formal Methods in Verification; Constraint Satisfaction and Optimization; Logic, Reasoning, and Knowledge; Advanced Graph Theory Research; Graph Theory and CDMA Systems; and Model-Driven Software Engineering Techniques.

Recent selected papers by Marijn J. H. Heule illustrate their research interests and contributions:

  • SAT Competition 2020, 2021, published in Artificial Intelligence
  • New ways to multiply 3 × 3-matrices, 2020, published in Journal of Symbolic Computation
  • Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries (Short Paper), 2024, published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • The Resolution of Keller's Conjecture, 2022, published in Journal of Automated Reasoning
  • Sensitivity Analysis of Locked Circuits, 2020, published in EPiC series in computing

Marijn J. H. Heule frequently collaborates with other researchers. Notable coauthors include Bernardo Subercaseaux, Randal E. Bryant, Armin Biere, Joseph E. Reeves, and John Mackey. Collaborations with these colleagues have contributed to interdisciplinary studies within their research fields.

The scientist has published extensively in several venues, with numerous contributions in the following outlets:

  • arXiv (Cornell University), 14 publications
  • Zenodo (CERN European Organization for Nuclear Research), 6 publications
  • Journal of Automated Reasoning, 5 publications
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl), 5 publications
  • EPiC series in computing, 3 publications

The body of work reflects substantial engagement with formal and theoretical aspects of computer science, particularly in logical methods, automated reasoning, and computational optimization. The research outputs indicate contributions to both foundational theory and applied methodologies.

Best Publications

  • Handbook of Satisfiability

    Armin Biere;Marijn Heule;Hans van Maaren;Toby Walsh

  • Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

    A. Biere;M. Heule;H. van Maaren;T. Walsh

  • Inprocessing rules

    Matti Järvisalo;Marijn J. H. Heule;Armin Biere

  • DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs

    Nathan Wetzler;Marijn J. H. Heule;Warren A. Hunt

  • Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer

    Marijn J. H. Heule;Oliver Kullmann;Victor W. Marek

  • Cube and conquer: guiding CDCL SAT solvers by lookaheads

    Marijn J. H. Heule;Oliver Kullmann;Siert Wieringa;Armin Biere

  • Blocked clause elimination

    Matti Järvisalo;Armin Biere;Marijn Heule

  • Exact DFA identification using SAT solvers

    Marijn J. H. Heule;Sicco Verwer

  • Trimming while checking clausal proofs

    Marijn J. H. Heule;Warren A. Hunt;Nathan Wetzler

  • March_eq: implementing additional reasoning into an efficient look-ahead SAT solver

    Marijn Heule;Mark Dufour;Joris van Zwieten;Hans van Maaren

  • The science of brute force

    Marijn J. H. Heule;Oliver Kullmann

  • Clause elimination procedures for CNF formulas

    Marijn Heule;Matti Järvisalo;Armin Biere

  • Efficient Certified RAT Verification

    Luís Cruz-Filipe;Marijn J. H. Heule;Warren A. Hunt;Matt Kaufmann

  • SAT Competition 2016 : Recent Developments

    Tomas Balyo;Marijn J.H. Heule;Matti Järvisalo

  • Automated reencoding of boolean formulas

    Norbert Manthey;Marijn J. H. Heule;Armin Biere

  • Efficient CNF simplification based on binary implication graphs

    Marijn J. H. Heule;Matti Järvisalo;Armin Biere

  • Verifying refutations with extended resolution

    Marijn J. H. Heule;Warren A. Hunt;Nathan Wetzler

  • Clause elimination for SAT and QSAT

    Marijn Heule;Matti Järvisalo;Florian Lonsing;Martina Seidl

  • SAT Competition 2020

    Nils Froleyks;Marijn Heule;Markus Iser;Matti Järvisalo

  • Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer

    Marijn J. H. Heule;Oliver Kullmann;Victor W. Marek

  • A New Method to Construct Lower Bounds for Van der Waerden Numbers

    P. R. Herwig;M.J.H. Heule;P. M. van Lambalgen;H. van Maaren

  • Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions

    Tomáš Balyo;Marijn J. H. Heule;Matti Järvisalo

  • Chapter 5. Look-Ahead Based SAT Solvers

    Marijn J.H. Heule;Hans van Maaren

Frequent Co-Authors

Armin Biere
Armin Biere University of Freiburg
Toby Walsh
Toby Walsh University of New South Wales
Randal E. Bryant
Randal E. Bryant Carnegie Mellon University
Larry Pileggi
Larry Pileggi Carnegie Mellon University
Isil Dillig
Isil Dillig The University of Texas at Austin
Joao Marques-Silva
Joao Marques-Silva Institució Catalana de Recerca i Estudis Avançats
Mohamed G. Gouda
Mohamed G. Gouda The University of Texas at Austin
Scott Aaronson
Scott Aaronson The University of Texas at Austin

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

Exploring computer science in the USA opens many academic and career opportunities, especially through flexible online programs. For those new to higher education or career changers, associate degrees online provide a strong foundation and can often be completed in less time than a traditional degree.

Cost is another major consideration for students. Many affordable online colleges offer recognized computer science programs that help you manage expenses without sacrificing educational quality.

If you’re worried about meeting strict academic requirements, several online graduate schools with low gpa requirements give more applicants a chance to pursue advanced degrees and further their careers in technology and related fields.

Finally, computer science skills can open doors in diverse sectors. For example, an environmental science degree increasingly includes computational knowledge, preparing graduates for work at the intersection of data, technology, and sustainability.

Best Scientists Citing Marijn J. H. Heule

Trending Scientists

Recently Published Articles