Hans van Maaren - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2021

Look-Ahead Based SAT SolversMarijn J. H. Heule, Hans van Maaren. In Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, editors, Handbook of Satisfiability - Second Edition. Volume 336 of Frontiers in Artificial Intelligence and Applications, pages 183-212, IOS Press, 2021. [doi]

2009

Look-Ahead Based SAT SolversMarijn Heule, Hans van Maaren. In Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, editors, Handbook of Satisfiability. Volume 185 of Frontiers in Artificial Intelligence and Applications, pages 155-184, IOS Press, 2009. [doi]

Dynamic Symmetry Breaking by Simulating Zykov ContractionBas Schaafsma, Marijn Heule, Hans van Maaren. sat 2009: 223-236 [doi]

2008

Parallel SAT Solving using Bit-level OperationsMarijn Heule, Hans van Maaren. jsat, 4(2-4):99-116, 2008. [doi]

Whose side are you on? Finding solutions in a biased search-treeMarijn Heule, Hans van Maaren. jsat, 4(2-4):117-148, 2008. [doi]

Sums of squares based approximation algorithms for MAX-SATHans van Maaren, Linda van Norden, M. J. H. Heule. DAM, 156(10):1754-1779, 2008. [doi]

Finding Guaranteed MUSes FastHans van Maaren, Siert Wieringa. sat 2008: 291-304 [doi]

2007

2006

March_dl: Adding Adaptive Heuristics and a New Branching StrategyMarijn Heule, Hans van Maaren. jsat, 2(1-4):47-59, 2006. [doi]

Generation of classes of robust periodic railway timetablesMichiel A. Odijk, H. Edwin Romeijn, Hans van Maaren. cor, 33:2283-2299, 2006. [doi]

2005

Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear ProgrammingMarijn Heule, Hans van Maaren. sat 2005: 122-134 [doi]

Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instancesHans van Maaren, Linda van Norden. AMAI, 44(1-2):157-177, 2005. [doi]

Sums of Squares, Satisfiability and Maximum SatisfiabilityHans van Maaren, Linda van Norden. sat 2005: 294-308 [doi]

2004

Aligning CNF- and Equivalence-ReasoningMarijn Heule, Hans van Maaren. sat 2005: 145-156 [doi]

Aligning CNF- and Equivalence-reasoningMarijn Heule, Hans van Maaren. sat 2004: [doi]

March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT SolverMarijn Heule, Mark Dufour, Joris van Zwieten, Hans van Maaren. sat 2005: 345-359 [doi]

2003

On Semidefinite Programming Relaxations of (2+p)-SATEtienne de Klerk, Hans van Maaren. AMAI, 37(3):285-305, 2003.

Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and WeightsHans van Maaren, Joost P. Warners. AMAI, 37(3):273-283, 2003.

Hidden Threshold Phenomena for Fixed-Density SAT-formulaeHans van Maaren, Linda van Norden. sat 2004: 135-149 [doi]

2002

Simplicial Pivoting Algorithms for a Tractable Class of Integer ProgramsHans van Maaren, C. Dang. jco, 6(2):133-142, 2002.

A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree DesignLinda van Norden, Hans van Maaren. cp 2002: 775-776 [doi]

2000

1999

An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a SimplexChuangyin Dang, Hans van Maaren. coap, 14(1):133-155, 1999. [doi]

Elliptic Approximations of Propositional FormulaeHans van Maaren. DAM, 96-97:223-244, 1999. [doi]

1998

A Simplicial Approach to the Determination of an Integer Point of a SimplexChuangyin Dang, Hans van Maaren. mor, 23(2):403-415, 1998. [doi]

Improved Solutions to the Steiner Triple Covering ProblemMichiel A. Odijk, Hans van Maaren. ipl, 65(2):67-69, 1998. [doi]

A two-phase algorithm for solving a class of hard satisfiability problemsJoost P. Warners, Hans van Maaren. orl, 23(3-5):81-88, 1998. [doi]

1997

Inverse barriers and CES-functions in linear programmingHans van Maaren, Tamás Terlaky. orl, 20(1):15-20, 1997. [doi]

1996

On the use of second order derivatives for the satisfiability problemHans van Maaren. dimacs 1997: 677-688

Sign in or sign up to see more results.

runs on WebDSL