On the use of second order derivatives for the satisfiability problem. - Hans van Maaren (Satisfiability Problem: Theory and Applications, 1996)

Inverse barriers and CES-functions in linear programming. - Hans van Maaren; Tamás Terlaky (Oper. Res. Lett., 1997)

Improved Solutions to the Steiner Triple Covering Problem. - Michiel A. Odijk; Hans van Maaren (Inf. Process. Lett., 1998)

A Simplicial Approach to the Determination of an Integer Point of a Simplex. - Chuangyin Dang; Hans van Maaren (Math. Oper. Res., 1998)

A two-phase algorithm for solving a class of hard satisfiability problems. - Joost P. Warners; Hans van Maaren (Oper. Res. Lett., 1998)

An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex. - Chuangyin Dang; Hans van Maaren (Comput. Optim. Appl., 1999)

Elliptic Approximations of Propositional Formulae. - Hans van Maaren (Discret. Appl. Math., 1999)

Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. - Hans van Maaren; Joost P. Warners (Discret. Appl. Math., 2000)

Solving satisfiability problems using elliptic approximations - effective branching rules. - Joost P. Warners; Hans van Maaren (Discret. Appl. Math., 2000)

Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations. - Joost P. Warners; Hans van Maaren (Discret. Appl. Math., 2000)

A Short Note on Some Tractable Cases of the Satisfiability Problem. - Hans van Maaren (Inf. Comput., 2000)

Relaxations of the Satisfiability Problem Using Semidefinite Programming. - Etienne de Klerk; Hans van Maaren; Joost P. Warners (J. Autom. Reason., 2000)

A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design. - Linda van Norden; Hans van Maaren (CP, 2002)

Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs. - Hans van Maaren; Chuangyin Dang (J. Comb. Optim., 2002)

Hidden Threshold Phenomena for Fixed-Density SAT-formulae. - Hans van Maaren; Linda van Norden (SAT, 2003)

On Semidefinite Programming Relaxations of (2+p)-SAT. - Etienne de Klerk; Hans van Maaren (Ann. Math. Artif. Intell., 2003)

Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights. - Hans van Maaren; Joost P. Warners (Ann. Math. Artif. Intell., 2003)

Preface. - Hans van Maaren (Discret. Appl. Math., 2003)

March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver. - Marijn Heule; Mark Dufour; Joris E. van Zwieten; Hans van Maaren (SAT (Selected Papers, 2004)

Aligning CNF- and Equivalence-reasoning. - Marijn Heule; Hans van Maaren (SAT, 2004)

Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. - Marijn Heule; Hans van Maaren (SAT, 2005)

Sums of Squares, Satisfiability and Maximum Satisfiability. - Hans van Maaren; Linda van Norden (SAT, 2005)

Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances. - Hans van Maaren; Linda van Norden (Ann. Math. Artif. Intell., 2005)

Generation of classes of robust periodic railway timetables. - Michiel A. Odijk; H. Edwin Romeijn; Hans van Maaren (Comput. Oper. Res., 2006)

March_dl: Adding Adaptive Heuristics and a New Branching Strategy. - Marijn Heule; Hans van Maaren (J. Satisf. Boolean Model. Comput., 2006)

From Idempotent Generalized Boolean Assignments to Multi-bit Search. - Marijn Heule; Hans van Maaren (SAT, 2007)

Effective Incorporation of Double Look-Ahead Procedures. - Marijn Heule; Hans van Maaren (SAT, 2007)

Prototypes for Automated Architectural 3D-Layout. - Henriette Bier; Adriaan de Jong; Gijs van der Hoorn; Niels Brouwers; Marijn Heule; Hans van Maaren (VSMM, 2007)

A New Method to Construct Lower Bounds for Van der Waerden Numbers. - P. R. Herwig; M. J. H. Heule; P. M. van Lambalgen; Hans van Maaren (Electron. J. Comb., 2007)

Finding Guaranteed MUSes Fast. - Hans van Maaren; Siert Wieringa (SAT, 2008)

Sums of squares based approximation algorithms for MAX-SAT. - Hans van Maaren; Linda van Norden; M. J. H. Heule (Discret. Appl. Math., 2008)

Parallel SAT Solving using Bit-level Operations. - Marijn Heule; Hans van Maaren (J. Satisf. Boolean Model. Comput., 2008)

Whose side are you on? Finding solutions in a biased search-tree. - Marijn Heule; Hans van Maaren (J. Satisf. Boolean Model. Comput., 2008)

Dynamic Symmetry Breaking by Simulating Zykov Contraction. - Bas Schaafsma; Marijn Heule; Hans van Maaren (SAT, 2009)

Simplicial Pivoting Algorithms for Integer Programming. - Hans van Maaren (Encyclopedia of Optimization, 2009)

Look-Ahead Based SAT Solvers. - Marijn Heule; Hans van Maaren (Handbook of Satisfiability, 2009)

Look-Ahead Based SAT Solvers. - Marijn J. H. Heule; Hans van Maaren (Handbook of Satisfiability, 2021)