36 citations · 100 across the 27 of their papers we have counts for
5 papers · 1 filter
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy
Janosch Döcker, Britta Dorn, Simone Linz +1
The complexity of variants of 3-SAT and Not-All-Equal 3-SAT is well studied. However, in contrast, very little is known about the complexity of the problems' quantified counterpart…
Orienting undirected phylogenetic networks
Katharina T. Huber, Leo van Iersel, Remie Janssen +4
This paper studies the relationship between undirected (unrooted) and directed (rooted) phylogenetic networks. We describe a polynomial-time algorithm for deciding whether an undir…
Display sets of normal and tree-child networks
Janosch Doecker, Simone Linz, Charles Semple
Phylogenetic trees canonically arise as embeddings of phylogenetic networks. We recently showed that the problem of deciding if two phylogenetic networks embed the same sets of phy…
Displaying trees across two phylogenetic networks
Janosch Döcker, Simone Linz, Charles Semple
Phylogenetic networks are a generalization of phylogenetic trees to leaf-labeled directed acyclic graphs that represent ancestral relationships between species whose past includes…
A class of phylogenetic networks reconstructable from ancestral profiles
Peter L. Erdos, Charles Semple, Mike Steel
Rooted phylogenetic networks provide an explicit representation of the evolutionary history of a set of sampled species. In contrast to phylogenetic trees which show only speci…