The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hans van Maaren: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Linda van Norden, Hans van Maaren
    A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:775-776 [Conf]
  2. Marijn Heule, Mark Dufour, Joris van Zwieten, Hans van Maaren
    March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:345-359 [Conf]
  3. Marijn Heule, Hans van Maaren
    Aligning CNF- and Equivalence-reasoning. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  4. Marijn Heule, Hans van Maaren
    Aligning CNF- and Equivalence-Reasoning. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:145-156 [Conf]
  5. Marijn Heule, Hans van Maaren
    Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:122-134 [Conf]
  6. Hans van Maaren, Linda van Norden
    Hidden Threshold Phenomena for Fixed-Density SAT-formulae. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:135-149 [Conf]
  7. Hans van Maaren, Linda van Norden
    Sums of Squares, Satisfiability and Maximum Satisfiability. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:294-308 [Conf]
  8. Etienne de Klerk, Hans van Maaren
    On Semidefinite Programming Relaxations of (2+p)-SAT. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:37, n:3, pp:285-305 [Journal]
  9. Hans van Maaren, Linda van Norden
    Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:44, n:1-2, pp:157-177 [Journal]
  10. Hans van Maaren, Joost P. Warners
    Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:37, n:3, pp:273-283 [Journal]
  11. Michiel A. Odijk, H. Edwin Romeijn, Hans van Maaren
    Generation of classes of robust periodic railway timetables. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:2283-2299 [Journal]
  12. Hans van Maaren
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:83-84 [Journal]
  13. Hans van Maaren
    Elliptic Approximations of Propositional Formulae. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:223-244 [Journal]
  14. Hans van Maaren, Joost P. Warners
    Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:225-239 [Journal]
  15. Joost P. Warners, Hans van Maaren
    Solving satisfiability problems using elliptic approximations - effective branching rules. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:241-259 [Journal]
  16. Joost P. Warners, Hans van Maaren
    Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:229-244 [Journal]
  17. Hans van Maaren
    A Short Note on Some Tractable Cases of the Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:158, n:2, pp:125-130 [Journal]
  18. Michiel A. Odijk, Hans van Maaren
    Improved Solutions to the Steiner Triple Covering Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:2, pp:67-69 [Journal]
  19. Etienne de Klerk, Hans van Maaren, Joost P. Warners
    Relaxations of the Satisfiability Problem Using Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2000, v:24, n:1/2, pp:37-65 [Journal]
  20. Hans van Maaren, C. Dang
    Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2002, v:6, n:2, pp:133-142 [Journal]
  21. Joost P. Warners, Hans van Maaren
    A two-phase algorithm for solving a class of hard satisfiability problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:23, n:3-5, pp:81-88 [Journal]
  22. Marijn Heule, Hans van Maaren
    From Idempotent Generalized Boolean Assignments to Multi-bit Search. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:134-147 [Conf]
  23. Marijn Heule, Hans van Maaren
    Effective Incorporation of Double Look-Ahead Procedures. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:258-271 [Conf]

  24. Finding Guaranteed MUSes Fast. [Citation Graph (, )][DBLP]


  25. Dynamic Symmetry Breaking by Simulating Zykov Contraction. [Citation Graph (, )][DBLP]


  26. Prototypes for Automated Architectural 3D-Layout. [Citation Graph (, )][DBLP]


  27. A New Method to Construct Lower Bounds for Van der Waerden Numbers. [Citation Graph (, )][DBLP]


  28. Sums of squares based approximation algorithms for MAX-SAT. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002