| 2009 |
|---|
| 31 | EE | Hans van Maaren:
Simplicial Pivoting Algorithms for Integer Programming.
Encyclopedia of Optimization 2009: 3585-3591 |
| 2008 |
|---|
| 30 | EE | Hans van Maaren,
Siert Wieringa:
Finding Guaranteed MUSes Fast.
SAT 2008: 291-304 |
| 29 | EE | Hans van Maaren,
Linda van Norden,
M. J. H. Heule:
Sums of squares based approximation algorithms for MAX-SAT.
Discrete Applied Mathematics 156(10): 1754-1779 (2008) |
| 28 | EE | Marijn Heule,
Hans van Maaren:
Whose side are you on? Finding solutions in a biased search-tree.
JSAT 4(2-4): 117-148 (2008) |
| 27 | EE | Marijn Heule,
Hans van Maaren:
Parallel SAT Solving using Bit-level Operations.
JSAT 4(2-4): 99-116 (2008) |
| 2007 |
|---|
| 26 | EE | Marijn Heule,
Hans van Maaren:
From Idempotent Generalized Boolean Assignments to Multi-bit Search.
SAT 2007: 134-147 |
| 25 | EE | Marijn Heule,
Hans van Maaren:
Effective Incorporation of Double Look-Ahead Procedures.
SAT 2007: 258-271 |
| 24 | EE | Henriette Bier,
Adriaan de Jong,
Gijs van der Hoorn,
Niels Brouwers,
Marijn Heule,
Hans van Maaren:
Prototypes for Automated Architectural 3D-Layout.
VSMM 2007: 203-214 |
| 23 | EE | 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.
Electr. J. Comb. 14(1): (2007) |
| 2006 |
|---|
| 22 | EE | Michiel A. Odijk,
H. Edwin Romeijn,
Hans van Maaren:
Generation of classes of robust periodic railway timetables.
Computers & OR 33: 2283-2299 (2006) |
| 21 | EE | Marijn Heule,
Hans van Maaren:
March_dl: Adding Adaptive Heuristics and a New Branching Strategy.
JSAT 2(1-4): 47-59 (2006) |
| 2005 |
|---|
| 20 | EE | Marijn Heule,
Hans van Maaren:
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming.
SAT 2005: 122-134 |
| 19 | EE | Hans van Maaren,
Linda van Norden:
Sums of Squares, Satisfiability and Maximum Satisfiability.
SAT 2005: 294-308 |
| 18 | EE | 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): 157-177 (2005) |
| 2004 |
|---|
| 17 | EE | Marijn Heule,
Hans van Maaren:
Aligning CNF- and Equivalence-reasoning.
SAT 2004 |
| 16 | EE | Marijn Heule,
Hans van Maaren:
Aligning CNF- and Equivalence-Reasoning.
SAT (Selected Papers 2004: 145-156 |
| 15 | EE | Marijn Heule,
Mark Dufour,
Joris van Zwieten,
Hans van Maaren:
March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver.
SAT (Selected Papers 2004: 345-359 |
| 2003 |
|---|
| 14 | EE | Hans van Maaren,
Linda van Norden:
Hidden Threshold Phenomena for Fixed-Density SAT-formulae.
SAT 2003: 135-149 |
| 13 | | Hans van Maaren,
Joost P. Warners:
Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights.
Ann. Math. Artif. Intell. 37(3): 273-283 (2003) |
| 12 | | Etienne de Klerk,
Hans van Maaren:
On Semidefinite Programming Relaxations of (2+p)-SAT.
Ann. Math. Artif. Intell. 37(3): 285-305 (2003) |
| 11 | EE | Hans van Maaren:
Preface.
Discrete Applied Mathematics 130(2): 83-84 (2003) |
| 2002 |
|---|
| 10 | EE | Linda van Norden,
Hans van Maaren:
A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design.
CP 2002: 775-776 |
| 9 | | Hans van Maaren,
C. Dang:
Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs.
J. Comb. Optim. 6(2): 133-142 (2002) |
| 2000 |
|---|
| 8 | | Hans van Maaren,
Joost P. Warners:
Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT.
Discrete Applied Mathematics 107(1-3): 225-239 (2000) |
| 7 | | Joost P. Warners,
Hans van Maaren:
Solving satisfiability problems using elliptic approximations - effective branching rules.
Discrete Applied Mathematics 107(1-3): 241-259 (2000) |
| 6 | EE | Joost P. Warners,
Hans van Maaren:
Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations.
Discrete Applied Mathematics 99(1-3): 229-244 (2000) |
| 5 | | Hans van Maaren:
A Short Note on Some Tractable Cases of the Satisfiability Problem.
Inf. Comput. 158(2): 125-130 (2000) |
| 4 | | Etienne de Klerk,
Hans van Maaren,
Joost P. Warners:
Relaxations of the Satisfiability Problem Using Semidefinite Programming.
J. Autom. Reasoning 24(1/2): 37-65 (2000) |
| 1999 |
|---|
| 3 | EE | Hans van Maaren:
Elliptic Approximations of Propositional Formulae.
Discrete Applied Mathematics 96-97: 223-244 (1999) |
| 1998 |
|---|
| 2 | EE | Michiel A. Odijk,
Hans van Maaren:
Improved Solutions to the Steiner Triple Covering Problem.
Inf. Process. Lett. 65(2): 67-69 (1998) |
| 1 | EE | Joost P. Warners,
Hans van Maaren:
A two-phase algorithm for solving a class of hard satisfiability problems.
Oper. Res. Lett. 23(3-5): 81-88 (1998) |
