default search action
Hans van Maaren
Person information
- affiliation: Delft University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [p2]Marijn J. H. Heule, Hans van Maaren:
Look-Ahead Based SAT Solvers. Handbook of Satisfiability 2021: 183-212 - [e2]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]
2000 – 2009
- 2009
- [c13]Bas Schaafsma, Marijn Heule, Hans van Maaren:
Dynamic Symmetry Breaking by Simulating Zykov Contraction. SAT 2009: 223-236 - [p1]Marijn Heule
, Hans van Maaren:
Look-Ahead Based SAT Solvers. Handbook of Satisfiability 2009: 155-184 - [e1]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] - [r1]Hans van Maaren:
Simplicial Pivoting Algorithms for Integer Programming. Encyclopedia of Optimization 2009: 3585-3591 - 2008
- [j22]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) - [j21]Marijn Heule, Hans van Maaren:
Parallel SAT Solving using Bit-level Operations. J. Satisf. Boolean Model. Comput. 4(2-4): 99-116 (2008) - [j20]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) - [c12]Hans van Maaren, Siert Wieringa:
Finding Guaranteed MUSes Fast. SAT 2008: 291-304 - 2007
- [j19]P. R. Herwig, M. J. H. Heule
A New Method to Construct Lower Bounds for Van der Waerden Numbers. Electron. J. Comb. 14(1) (2007) - [c11]Marijn Heule
From Idempotent Generalized Boolean Assignments to Multi-bit Search. SAT 2007: 134-147 - [c10]Marijn Heule
Effective Incorporation of Double Look-Ahead Procedures. SAT 2007: 258-271 - [c9]Henriette Bier
Prototypes for Automated Architectural 3D-Layout. VSMM 2007: 203-214 - 2006
- [j18]Michiel A. Odijk, H. Edwin Romeijn, Hans van Maaren:
Generation of classes of robust periodic railway timetables. Comput. Oper. Res. 33: 2283-2299 (2006) - [j17]Marijn Heule
March_dl: Adding Adaptive Heuristics and a New Branching Strategy. J. Satisf. Boolean Model. Comput. 2(1-4): 47-59 (2006) - 2005
- [j16]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) - [c8]Marijn Heule, Hans van Maaren:
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. SAT 2005: 122-134 - [c7]Hans van Maaren, Linda van Norden:
Sums of Squares, Satisfiability and Maximum Satisfiability. SAT 2005: 294-308 - 2004
- [c6]Marijn Heule
Aligning CNF- and Equivalence-Reasoning. SAT (Selected Papers 2004: 145-156 - [c5]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 - [c4]Marijn Heule, Hans van Maaren:
Aligning CNF- and Equivalence-reasoning. SAT 2004 - 2003
- [j15]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) - [j14]Etienne de Klerk, Hans van Maaren:
On Semidefinite Programming Relaxations of (2+p)-SAT. Ann. Math. Artif. Intell. 37(3): 285-305 (2003) - [j13]Hans van Maaren:
Preface. Discret. Appl. Math. 130(2): 83-84 (2003) - [c3]Hans van Maaren, Linda van Norden:
Hidden Threshold Phenomena for Fixed-Density SAT-formulae. SAT 2003: 135-149 - 2002
- [j12]Hans van Maaren, Chuangyin Dang
Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs. J. Comb. Optim. 6(2): 133-142 (2002) - [c2]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
- [j11]Joost P. Warners, Hans van Maaren:
Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations. Discret. Appl. Math. 99(1-3): 229-244 (2000) - [j10]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) - [j9]Joost P. Warners, Hans van Maaren:
Solving satisfiability problems using elliptic approximations - effective branching rules. Discret. Appl. Math. 107(1-3): 241-259 (2000) - [j8]Hans van Maaren:
A Short Note on Some Tractable Cases of the Satisfiability Problem. Inf. Comput. 158(2): 125-130 (2000) - [j7]Etienne de Klerk, Hans van Maaren, Joost P. Warners:
Relaxations of the Satisfiability Problem Using Semidefinite Programming. J. Autom. Reason. 24(1/2): 37-65 (2000)
1990 – 1999
- 1999
- [j6]Chuangyin Dang
An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex. Comput. Optim. Appl. 14(1): 133-155 (1999) - [j5]Hans van Maaren:
Elliptic Approximations of Propositional Formulae. Discret. Appl. Math. 96-97: 223-244 (1999) - 1998
- [j4]Michiel A. Odijk, Hans van Maaren:
Improved Solutions to the Steiner Triple Covering Problem. Inf. Process. Lett. 65(2): 67-69 (1998) - [j3]Chuangyin Dang, Hans van Maaren:
A Simplicial Approach to the Determination of an Integer Point of a Simplex. Math. Oper. Res. 23(2): 403-415 (1998) - [j2]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) - 1997
- [j1]Hans van Maaren, Tamás Terlaky:
Inverse barriers and CES-functions in linear programming. Oper. Res. Lett. 20(1): 15-20 (1997) - 1996
- [c1]Hans van Maaren:
On the use of second order derivatives for the satisfiability problem. Satisfiability Problem: Theory and Applications 1996: 677-687
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: