The following pages link to Jesper Jansson (Q260257):
Displaying 50 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)
- A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment (Q850800) (← links)
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets (Q860812) (← links)
- Approximation algorithms for Hamming clustering problems (Q876719) (← links)
- On the complexity of constructing evolutionary trees (Q1306398) (← links)
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
- Determining the consistency of resolved triplets and fan triplets (Q1706504) (← links)
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition (Q1889829) (← links)
- Constructing the R* consensus tree of two trees in subcubic time (Q1950390) (← links)
- New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Fast algorithms for the rooted triplet distance between caterpillars (Q2140512) (← links)
- Exact algorithms for the bounded repetition longest common subsequence problem (Q2180128) (← links)
- Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← links)
- Graph orientation with edge modifications (Q2327085) (← links)
- Pushing the online matrix-vector conjecture off-line and identifying its easy cases (Q2327098) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- An efficient algorithm for the rooted triplet distance between galled trees (Q2364900) (← links)
- On finding the Adams consensus tree (Q2407110) (← links)
- Computing the rooted triplet distance between galled trees by counting triangles (Q2442817) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- Polynomial-time algorithms for the ordered maximum agreement subtree problem (Q2642315) (← links)
- Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173) (← links)
- Online and approximate network construction from bounded connectivity constraints (Q2692731) (← links)
- (Q2723944) (← links)
- On the complexity of inferring rooted evolutinary trees (Q2741464) (← links)
- CRAM: Compressed Random Access Memory (Q2843276) (← links)
- Computing the maximum agreement of phylogenetic networks (Q2845521) (← links)
- The complexity of inferring a minimally resolved phylogenetic supertree (Q2884583) (← links)
- Fast Relative Lempel-Ziv Self-index for Similar Sequences (Q2898004) (← links)
- Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics (Q2898029) (← links)
- Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles (Q2904512) (← links)
- Algorithms for combining rooted triplets into a galled phylogenetic network (Q2921689) (← links)
- (Q2934640) (← links)
- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets (Q2942263) (← links)
- 3D Rectangulations and Geometric Matrix Multiplication (Q2942614) (← links)
- Faster Algorithms for Computing the R* Consensus Tree (Q2942648) (← links)
- On the Parameterized Complexity of Associative and Commutative Unification (Q2946004) (← links)
