The following pages link to Jesper Jansson (Q260257):
Displaying 18 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Inferring a graph from path frequency (Q427879) (← links)
- More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
- Algorithms for finding a most similar subforest (Q538470) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Rooted maximum agreement supertrees (Q818677) (← links)
- (Q4608616) (← links)
- (Q5091018) (← links)
- (Q5091725) (← links)
- Building a small and informative phylogenetic supertree (Q6077843) (← links)
- (Q6128571) (← links)
- Online and Approximate Network Construction from Bounded Connectivity Constraints (Q6175211) (← links)
- Polynomial-time equivalences and refined algorithms for longest common subsequence variants (Q6496843) (← links)
