The following pages link to Janosch Döcker (Q1694727):
Displaying 15 items.
- On the existence of a cherry-picking sequence (Q1694728) (← links)
- Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507) (← links)
- On simplified group activity selection (Q1990308) (← links)
- Simplified group activity selection with group size constraints (Q2121462) (← links)
- Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy (Q2182311) (← links)
- Display sets of normal and tree-child networks (Q2223460) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754) (← links)
- Displaying trees across two phylogenetic networks (Q2333792) (← links)
- Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps (Q4576213) (← links)
- The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← links)
- Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks (Q6056548) (← links)
- Bounding the softwired parsimony score of a phylogenetic network (Q6617639) (← links)
- On the existence of funneled orientations for classes of rooted phylogenetic networks (Q6652436) (← links)
- Characterising rooted and unrooted tree-child networks (Q6742371) (← links)
