Hans van Maaren

40 papers A 9Journal 22Unranked 4

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