• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 40 matches

• 2021
• 
  Marijn J. H. Heule, Hans van Maaren:
  Look-Ahead Based SAT Solvers. Handbook of Satisfiability 2021: 183-212
• 
  Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh:
  Handbook of Satisfiability - Second Edition. Frontiers in Artificial Intelligence and Applications 336, IOS Press 2021, ISBN 978-1-64368-160-3 [contents]
• 2009
• 
  Bas Schaafsma, Marijn Heule, Hans van Maaren:
  Dynamic Symmetry Breaking by Simulating Zykov Contraction. SAT 2009: 223-236
• 
  Marijn Heule, Hans van Maaren:
  Look-Ahead Based SAT Solvers. Handbook of Satisfiability 2009: 155-184
• 
  Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh:
  Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications 185, IOS Press 2009, ISBN 978-1-58603-929-5 [contents]
• 
  Hans van Maaren:
  Simplicial Pivoting Algorithms for Integer Programming. Encyclopedia of Optimization 2009: 3585-3591
• 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): 1754-1779 (2008)
• 
  Marijn Heule, Hans van Maaren:
  Parallel SAT Solving using Bit-level Operations. J. Satisf. Boolean Model. Comput. 4(2-4): 99-116 (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): 117-148 (2008)
• 
  Hans van Maaren, Siert Wieringa:
  Finding Guaranteed MUSes Fast. SAT 2008: 291-304
• 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:
  From Idempotent Generalized Boolean Assignments to Multi-bit Search. SAT 2007: 134-147
• 
  Marijn Heule, Hans van Maaren:
  Effective Incorporation of Double Look-Ahead Procedures. SAT 2007: 258-271
• 
  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
• 2006
• 
  Michiel A. Odijk, H. Edwin Romeijn, Hans van Maaren:
  Generation of classes of robust periodic railway timetables. Comput. Oper. Res. 33: 2283-2299 (2006)
• 
  Marijn Heule, Hans van Maaren:
  March_dl: Adding Adaptive Heuristics and a New Branching Strategy. J. Satisf. Boolean Model. Comput. 2(1-4): 47-59 (2006)
• 2005
• 
  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)
• 
  Marijn Heule, Hans van Maaren:
  Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. SAT 2005: 122-134
• 
  Hans van Maaren, Linda van Norden:
  Sums of Squares, Satisfiability and Maximum Satisfiability. SAT 2005: 294-308
• 2004
• 
  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: 345-359
• 
  Marijn Heule, Hans van Maaren:
  Aligning CNF- and Equivalence-reasoning. SAT 2004
• 
  Marijn Heule, Hans van Maaren:
  Aligning CNF- and Equivalence-Reasoning. SAT (Selected Papers 2004: 145-156
• 2003
• 
  Etienne de Klerk, Hans van Maaren:
  On Semidefinite Programming Relaxations of (2+p)-SAT. Ann. Math. Artif. Intell. 37(3): 285-305 (2003)
• 
  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)
• 
  Hans van Maaren:
  Preface. Discret. Appl. Math. 130(2): 83-84 (2003)
• 
  Hans van Maaren, Linda van Norden:
  Hidden Threshold Phenomena for Fixed-Density SAT-formulae. SAT 2003: 135-149
• 2002
• 
  Hans van Maaren, Chuangyin Dang:
  Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs. J. Comb. Optim. 6(2): 133-142 (2002)
• 
  Linda van Norden, Hans van Maaren:
  A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design. CP 2002: 775-776
• 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): 225-239 (2000)
• 
  Joost P. Warners, Hans van Maaren:
  Solving satisfiability problems using elliptic approximations - effective branching rules. Discret. Appl. Math. 107(1-3): 241-259 (2000)

skipping 10 more matches