Hans van Maaren

According to our database1, Hans van Maaren authored at least 36 papers between 1996 and 2009.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2009
Look-Ahead Based SAT Solvers.
Proceedings of the Handbook of Satisfiability, 2009

Simplicial Pivoting Algorithms for Integer Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Dynamic Symmetry Breaking by Simulating Zykov Contraction.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008
Whose side are you on? Finding solutions in a biased search-tree.
J. Satisf. Boolean Model. Comput., 2008

Parallel SAT Solving using Bit-level Operations.
J. Satisf. Boolean Model. Comput., 2008

Sums of squares based approximation algorithms for MAX-SAT.
Discret. Appl. Math., 2008

Finding Guaranteed MUSes Fast.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

2007
A New Method to Construct Lower Bounds for Van der Waerden Numbers.
Electron. J. Comb., 2007

Prototypes for Automated Architectural 3D-Layout.
Proceedings of the Virtual Systems and Multimedia, 13th International Conference, 2007

Effective Incorporation of Double Look-Ahead Procedures.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

From Idempotent Generalized Boolean Assignments to Multi-bit Search.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006
March_dl: Adding Adaptive Heuristics and a New Branching Strategy.
J. Satisf. Boolean Model. Comput., 2006

Generation of classes of robust periodic railway timetables.
Comput. Oper. Res., 2006

2005
Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances.
Ann. Math. Artif. Intell., 2005

Sums of Squares, Satisfiability and Maximum Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004
Aligning CNF- and Equivalence-reasoning.
Proceedings of the SAT 2004, 2004

March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

2003
Preface.
Discret. Appl. Math., 2003

Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights.
Ann. Math. Artif. Intell., 2003

On Semidefinite Programming Relaxations of (2+p)-SAT.
Ann. Math. Artif. Intell., 2003

Hidden Threshold Phenomena for Fixed-Density SAT-formulae.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002
Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs.
J. Comb. Optim., 2002

A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design.
Proceedings of the Principles and Practice of Constraint Programming, 2002

2000
Relaxations of the Satisfiability Problem Using Semidefinite Programming.
J. Autom. Reason., 2000

A Short Note on Some Tractable Cases of the Satisfiability Problem.
Inf. Comput., 2000

Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations.
Discret. Appl. Math., 2000

Solving satisfiability problems using elliptic approximations - effective branching rules.
Discret. Appl. Math., 2000

Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT.
Discret. Appl. Math., 2000

1999
Elliptic Approximations of Propositional Formulae.
Discret. Appl. Math., 1999

An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex.
Comput. Optim. Appl., 1999

1998
A two-phase algorithm for solving a class of hard satisfiability problems.
Oper. Res. Lett., 1998

A Simplicial Approach to the Determination of an Integer Point of a Simplex.
Math. Oper. Res., 1998

Improved Solutions to the Steiner Triple Covering Problem.
Inf. Process. Lett., 1998

1997
Inverse barriers and CES-functions in linear programming.
Oper. Res. Lett., 1997

1996
On the use of second order derivatives for the satisfiability problem.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996


  Loading...