Jesper Jansson (Former)
1 – 10 of 21
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases
(
- Contribution to journal › Article
- 2019
-
Mark
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
(
- Contribution to journal › Article
-
Mark
Preface
2019) 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11651 LNCS.(
- Chapter in Book/Report/Conference proceeding › Preface to conference proceeding
-
Mark
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
Determining the consistency of resolved triplets and fan triplets
(
- Contribution to journal › Article
- 2017
-
Mark
Determining the consistency of resolved triplets and fan triplets
2017) 21st Annual International Conference on Research in Computational Molecular Biology, RECOMB 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10229 LNCS. p.82-98(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2011
-
Mark
Approximation algorithms for buy-at-bulk geometric network design
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Contribution to journal › Article
- 2006
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2004
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding