Marijn Heule

M. J. H. Heule

	2011
27		Marijn Heule, Matti Järvisalo, Armin Biere: Efficient CNF Simplification Based on Binary Implication Graphs. SAT 2011: 201-215
26		Antonio Ramos, Peter van der Tak, Marijn Heule: Between Restarts and Backjumps. SAT 2011: 216-229
25		Oliver Gableske, Marijn Heule: EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation. SAT 2011: 367-368
24		Peter van der Tak, Antonio Ramos, Marijn Heule: Reusing the Assignment Trail in CDCL Solvers. JSAT 7(4): 133-138 (2011)
23		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)
	2010
22		Marijn Heule, Toby Walsh: Symmetry in Solutions. AAAI 2010
21		Marijn Heule, Sicco Verwer: Exact DFA Identification Using SAT Solvers. ICGI 2010: 66-79
20		Marijn Heule, Matti Järvisalo, Armin Biere: Clause Elimination Procedures for CNF Formulas. LPAR (Yogyakarta) 2010: 357-371
19		Matti Järvisalo, Armin Biere, Marijn Heule: Blocked Clause Elimination. TACAS 2010: 129-144
18		Marijn Heule, Toby Walsh: Symmetry within Solutions CoRR abs/1004.2624: (2010)
17		Marijn Heule, Matti Järvisalo, Armin Biere: Covered Clause Elimination CoRR abs/1011.5202: (2010)
	2009
16		Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh: Handbook of Satisfiability IOS Press 2009
15		Bas Schaafsma, Marijn Heule, Hans van Maaren: Dynamic Symmetry Breaking by Simulating Zykov Contraction. SAT 2009: 223-236
14		Marijn Heule, Hans van Maaren: Look-Ahead Based SAT Solvers. Handbook of Satisfiability 2009: 155-184
	2008
13		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)
12		Marijn Heule, Hans van Maaren: Whose side are you on? Finding solutions in a biased search-tree. JSAT 4(2-4): 117-148 (2008)
11		Marijn Heule, Hans van Maaren: Parallel SAT Solving using Bit-level Operations. JSAT 4(2-4): 99-116 (2008)
	2007
10		Marijn Heule, Hans van Maaren: From Idempotent Generalized Boolean Assignments to Multi-bit Search. SAT 2007: 134-147
9		Marijn Heule, Hans van Maaren: Effective Incorporation of Double Look-Ahead Procedures. SAT 2007: 258-271
8		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
7		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)
6		M. J. H. Heule, Léon J. M. Rothkrantz: Solving games: Dependence of applicable solving procedures. Sci. Comput. Program. 67(1): 105-124 (2007)
	2006
5		Marijn Heule, Hans van Maaren: March_dl: Adding Adaptive Heuristics and a New Branching Strategy. JSAT 2(1-4): 47-59 (2006)
	2005
4		Marijn Heule, Hans van Maaren: Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. SAT 2005: 122-134
	2004
3		Marijn Heule, Hans van Maaren: Aligning CNF- and Equivalence-reasoning. SAT 2004
2		Marijn Heule, Hans van Maaren: Aligning CNF- and Equivalence-Reasoning. SAT (Selected Papers 2004: 145-156
1		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

Coauthor Index

1	Henriette Bier	[8]
2	Armin Biere	[16] [17] [19] [20] [27]
3	Niels Brouwers	[8]
4	Mark Dufour	[1]
5	Oliver Gableske	[25]
6	P. R. Herwig	[7]
7	Gijs van der Hoorn	[8]
8	Matti Järvisalo	[17] [19] [20] [27]
9	Adriaan de Jong	[8]
10	P. M. van Lambalgen	[7]
11	Hans van Maaren	[1] [2] [3] [4] [5] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16]
12	Linda van Norden	[13]
13	Antonio Ramos	[24] [26]
14	Léon J. M. Rothkrantz	[6]
15	Bas Schaafsma	[15]
16	Peter van der Tak	[24] [26]
17	Sicco Verwer	[21]
18	Toby Walsh	[16] [18] [22]
19	Joris van Zwieten	[1]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page