In the context of reconstructing phylogenetic networks from a collection...
We show that Monotone 3-Sat remains NP-complete if (i) each clause conta...
The complexity of variants of 3-SAT and Not-All-Equal 3-SAT is well stud...
We consider simplified, monotone versions of Not-All-Equal 3-Sat and 3-S...
Recently, the minimum number of reticulation events that is required to
...
Here we show that deciding whether two rooted binary phylogenetic trees ...