Jesper Jansson
1 – 10 of 13
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2018
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- Determining the consistency of resolved triplets and fan triplets
- 2017
- Determining the consistency of resolved triplets and fan triplets
- 2011
- Approximation algorithms for buy-at-bulk geometric network design
- 2007
- Polynomial-time algorithms for the ordered maximum agreement subtree problem
- 2006
- On the approximability of maximum and minimum edge clique partition problems
- 2004
- Polynomial-time algorithms for the ordered maximum agreement subtree problem
- Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition
- Approximation algorithms for Hamming clustering problems
- 2003
- Consensus Algorithms for Trees and Strings