Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Marijn Heule
M. J. H. Heule
2010 – today
- 2013
[c20]- [i3]
- 2012
- [j9]Matti Järvisalo, Armin Biere, Marijn Heule: Simulating Circuit-Level Simplifications on CNF. J. Autom. Reasoning 49(4): 583-619 (2012)
- [c19]
- [c18]Peter van der Tak, Marijn Heule, Armin Biere: Concurrent Cube-and-Conquer - (Poster Presentation). SAT 2012: 475-476
- [c17]Magdalena Widl, Armin Biere, Petra Brosch, Uwe Egly, Marijn Heule, Gerti Kappel, Martina Seidl, Hans Tompits: Guided Merging of Sequence Diagrams. SLE 2012: 164-183
- 2011
- [j8]Peter van der Tak, Antonio Ramos, Marijn Heule: Reusing the Assignment Trail in CDCL Solvers. JSAT 7(4): 133-138 (2011)
- [j7]Marijn Heule: Introduction to Mathematics of Satisfiability, Victor W. Marek, Chapman & Hall/CRC, 2009. Hardback, ISBN-13: 978-143980167-3, $89.95. TPLP 11(1): 126-130 (2011)
- [c16]Marijn Heule, Oliver Kullmann, Siert Wieringa, Armin Biere: Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads. Haifa Verification Conference 2011: 50-65
- [c15]Marijn Heule, Matti Järvisalo, Armin Biere: Efficient CNF Simplification Based on Binary Implication Graphs. SAT 2011: 201-215
- [c14]
- [c13]Oliver Gableske, Marijn Heule: EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation. SAT 2011: 367-368
- 2010
- [c12]
- [c11]
- [c10]Marijn Heule, Matti Järvisalo, Armin Biere: Clause Elimination Procedures for CNF Formulas. LPAR (Yogyakarta) 2010: 357-371
- [c9]
- [i2]
- [i1]
2000 – 2009
- 2009
- [c8]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 (Eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications 185, IOS Press 2009, ISBN 978-1-58603-929-5
- 2008
- [j6]Hans van Maaren, Linda van Norden, M. J. H. Heule: Sums of squares based approximation algorithms for MAX-SAT. Discrete Applied Mathematics 156(10): 1754-1779 (2008)
- [j5]Marijn Heule, Hans van Maaren: Parallel SAT Solving using Bit-level Operations. JSAT 4(2-4): 99-116 (2008)
- [j4]Marijn Heule, Hans van Maaren: Whose side are you on? Finding solutions in a biased search-tree. JSAT 4(2-4): 117-148 (2008)
- 2007
- [j3]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. Electr. J. Comb. 14(1) (2007)
- [j2]M. J. H. Heule, Léon J. M. Rothkrantz: Solving games: Dependence of applicable solving procedures. Sci. Comput. Program. 67(1): 105-124 (2007)
- [c7]Marijn Heule, Hans van Maaren: From Idempotent Generalized Boolean Assignments to Multi-bit Search. SAT 2007: 134-147
- [c6]Marijn Heule, Hans van Maaren: Effective Incorporation of Double Look-Ahead Procedures. SAT 2007: 258-271
- [c5]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
- [j1]Marijn Heule, Hans van Maaren: March_dl: Adding Adaptive Heuristics and a New Branching Strategy. JSAT 2(1-4): 47-59 (2006)
- 2005
- [c4]Marijn Heule, Hans van Maaren: Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. SAT 2005: 122-134
- 2004
- [c3]Marijn Heule, Mark Dufour, Joris van Zwieten, Hans van Maaren: March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver. SAT (Selected Papers 2004: 345-359
- [c2]
- [c1]Marijn Heule, Hans van Maaren: Aligning CNF- and Equivalence-Reasoning. SAT (Selected Papers 2004: 145-156
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-05 20:50 CEST by the dblp team