A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs.
|
SAT |
2011 |
2 |
Complexity Results for Linear XSAT-Problems.
|
SAT |
2010 |
2 |
On Some Aspects of Mixed Horn Formulas.
|
SAT |
2009 |
6 |
A CNF Class Generalizing Exact Linear Formulas.
|
SAT |
2008 |
8 |
Algorithms for Variable-Weighted 2-SAT and Dual Problems.
|
SAT |
2007 |
8 |
On Linear CNF Formulas.
|
SAT |
2006 |
13 |
Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems.
|
SAT |
2004 |
8 |
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems.
|
SAT |
2003 |
15 |