Hans van Maaren

Publication Activity (10 Years)

Years Active: 1996-2009
Publications (10 Years): 0

Publications

Bas Schaafsma, Marijn Heule, Hans van Maaren
Dynamic Symmetry Breaking by Simulating Zykov Contraction. SAT (2009)
Hans van Maaren, Siert Wieringa
Finding Guaranteed MUSes Fast. SAT (2008)
Hans van Maaren, Linda van Norden, M. J. H. Heule
Sums of squares based approximation algorithms for MAX-SAT. Discret. Appl. Math. 156 (10) (2008)
Marijn Heule, Hans van Maaren
Whose side are you on? Finding solutions in a biased search-tree. J. Satisf. Boolean Model. Comput. 4 (2-4) (2008)
Marijn Heule, Hans van Maaren
Parallel SAT Solving using Bit-level Operations. J. Satisf. Boolean Model. Comput. 4 (2-4) (2008)
Henriette Bier, Adriaan de Jong, Gijs van der Hoorn, Niels Brouwers, Marijn Heule, Hans van Maaren
Prototypes for Automated Architectural 3D-Layout. VSMM (2007)
Marijn Heule, Hans van Maaren
From Idempotent Generalized Boolean Assignments to Multi-bit Search. SAT (2007)
P. R. Herwig, M. J. H. Heule, P. M. van Lambalgen, Hans van Maaren
A New Method to Construct Lower Bounds for Van der Waerden Numbers. Electron. J. Comb. 14 (1) (2007)
Marijn Heule, Hans van Maaren
Effective Incorporation of Double Look-Ahead Procedures. SAT (2007)
Marijn Heule, Hans van Maaren
March_dl: Adding Adaptive Heuristics and a New Branching Strategy. J. Satisf. Boolean Model. Comput. 2 (1-4) (2006)
Michiel A. Odijk, H. Edwin Romeijn, Hans van Maaren
Generation of classes of robust periodic railway timetables. Comput. Oper. Res. 33 (2006)
Hans van Maaren, Linda van Norden
Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances. Ann. Math. Artif. Intell. 44 (1-2) (2005)
Marijn Heule, Hans van Maaren
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. SAT (2005)
Hans van Maaren, Linda van Norden
Sums of Squares, Satisfiability and Maximum Satisfiability. SAT (2005)
Marijn Heule, Mark Dufour, Joris E. van Zwieten, Hans van Maaren
March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver. SAT (Selected Papers (2004)
Marijn Heule, Hans van Maaren
Aligning CNF- and Equivalence-Reasoning. SAT (Selected Papers (2004)
Marijn Heule, Hans van Maaren
Aligning CNF- and Equivalence-reasoning. SAT (2004)
Hans van Maaren, Joost P. Warners
Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights. Ann. Math. Artif. Intell. 37 (3) (2003)
Hans van Maaren
Preface. Discret. Appl. Math. 130 (2) (2003)
Hans van Maaren, Linda van Norden
Hidden Threshold Phenomena for Fixed-Density SAT-formulae. SAT (2003)
Etienne de Klerk, Hans van Maaren
On Semidefinite Programming Relaxations of (2+p)-SAT. Ann. Math. Artif. Intell. 37 (3) (2003)
Hans van Maaren, Chuangyin Dang
Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs. J. Comb. Optim. 6 (2) (2002)
Linda van Norden, Hans van Maaren
A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design. CP (2002)
Etienne de Klerk, Hans van Maaren, Joost P. Warners
Relaxations of the Satisfiability Problem Using Semidefinite Programming. J. Autom. Reason. 24 (1/2) (2000)
Joost P. Warners, Hans van Maaren
Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations. Discret. Appl. Math. 99 (1-3) (2000)
Hans van Maaren
A Short Note on Some Tractable Cases of the Satisfiability Problem. Inf. Comput. 158 (2) (2000)
Hans van Maaren, Joost P. Warners
Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. Discret. Appl. Math. 107 (1-3) (2000)
Joost P. Warners, Hans van Maaren
Solving satisfiability problems using elliptic approximations - effective branching rules. Discret. Appl. Math. 107 (1-3) (2000)
Hans van Maaren
Elliptic Approximations of Propositional Formulae. Discret. Appl. Math. (1999)
Chuangyin Dang, Hans van Maaren
An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex. Comput. Optim. Appl. 14 (1) (1999)
Michiel A. Odijk, Hans van Maaren
Improved Solutions to the Steiner Triple Covering Problem. Inf. Process. Lett. 65 (2) (1998)
Chuangyin Dang, Hans van Maaren
A Simplicial Approach to the Determination of an Integer Point of a Simplex. Math. Oper. Res. 23 (2) (1998)
Joost P. Warners, Hans van Maaren
A two-phase algorithm for solving a class of hard satisfiability problems. Oper. Res. Lett. 23 (3-5) (1998)
Hans van Maaren, Tamás Terlaky
Inverse barriers and CES-functions in linear programming. Oper. Res. Lett. 20 (1) (1997)
Hans van Maaren
On the use of second order derivatives for the satisfiability problem. Satisfiability Problem: Theory and Applications (1996)