The following pages link to Jesper Jansson (Q260257):
Displaying 50 items.
- On finding the Adams consensus tree (Q2955018) (← links)
- GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE (Q2997922) (← links)
- Algorithms for Building Consensus MUL-trees (Q3104676) (← links)
- Improved Algorithms for Constructing Consensus Trees (Q3177802) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation (Q3188863) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS (Q3434272) (← links)
- ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS (Q3434282) (← links)
- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks (Q3575247) (← links)
- Constructing the R* Consensus Tree of Two Trees in Subcubic Time (Q3586493) (← links)
- New Results on Optimizing Rooted Triplets Consistency (Q3596743) (← links)
- Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets (Q3652305) (← links)
- (Q4252402) (← links)
- (Q4364583) (← links)
- (Q4432975) (← links)
- (Q4547753) (← links)
- (Q4608616) (← links)
- Computing and Combinatorics (Q4681208) (← links)
- (Q4953346) (← links)
- (Q5091018) (← links)
- (Q5091725) (← links)
- Algorithms for Finding a Most Similar Subforest (Q5307521) (← links)
- Combinatorial Pattern Matching (Q5315329) (← links)
- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree (Q5434435) (← links)
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space (Q5458854) (← links)
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network (Q5470727) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492860) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492886) (← links)
- Research in Computational Molecular Biology (Q5706869) (← links)
- Structural Information and Communication Complexity (Q5710079) (← links)
- Algorithms and Computation (Q5712147) (← links)
- Algorithms and Computation (Q5712148) (← links)
- Improved Algorithms for Constructing Consensus Trees (Q5741839) (← links)
- Graph Orientation with Edge Modifications (Q5859684) (← links)
- Graph Orientations Optimizing the Number of Light or Heavy Vertices (Q5894978) (← links)
- Graph Orientations Optimizing the Number of Light or Heavy Vertices (Q5895225) (← links)
- LATIN 2004: Theoretical Informatics (Q5901669) (← links)
- Graph orientation with splits (Q5915703) (← links)
- Computing the rooted triplet distance between phylogenetic networks (Q5918288) (← links)
- Graph orientation with splits (Q5918973) (← links)
- Computing the rooted triplet distance between phylogenetic networks (Q5919475) (← 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)
- Polynomial-time equivalences and refined algorithms for longest common subsequence variants (Q6546417) (← links)
- Shortest longest-path graph orientations (Q6591464) (← links)
- Approximation algorithms for the longest run subsequence problem (Q6622004) (← links)
