Jesper Jansson
1 – 10 of 15
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2019
-
Preface
Gąsieniec, Leszek Antoni ; Jansson, Jesper LU and Levcopoulos, Christos LU
(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.
Mark
-
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases
Gasieniec, Leszek ; Jansson, Jesper LU ; Levcopoulos, Christos LU
;
Lingas, Andrzej
LU
and
Persson, Mia
LU
(2019)
In Lecture Notes in Computer Science
11458.
p.156-169
Mark
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- 2018
- 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
- Approximation algorithms for Hamming clustering problems