Jesper Jansson (Former)

11 – 20 of 21

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/person/cs-jja?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

2017
Mark Determining the consistency of resolved triplets and fan triplets
Jansson, Jesper ^LU ; Lingas, Andrzej ^LU ; Rajaby, Ramesh and Sung, Wing Kin (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
Czumaj, Artur ; Czyzowicz, Jurek ; Gasieniec, Leszek ; Jansson, Jesper ^LU ; Lingas, Andrzej ^LU and Zylinski, Pawel (2011) 11th International Symposium, WADS 2009 5664. p.1949-1969
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2007
Mark Polynomial-time algorithms for the ordered maximum agreement subtree problem
Dessmark, Anders ^LU ; Jansson, Jesper ^LU ; Lingas, Andrzej ^LU and Lundell, Eva-Marta ^LU (2007) In Algorithmica 48(3). p.233-248
- Contribution to journal › Article
2006
Mark On the approximability of maximum and minimum edge clique partition problems
Dessmark, Anders ^LU ; Jansson, Jesper ^LU ; Lingas, Andrzej ^LU ; Lundell, Eva-Marta ^LU and Persson, Mia ^LU (2006) The Australasian Theory Symposium (CATS) 168. p.101-105
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2004
Mark Polynomial-time algorithms for the ordered maximum agreement subtree problem
Dessmark, Anders ^LU ; Jansson, Jesper ^LU ; Lingas, Andrzej ^LU and Lundell, Eva-Marta ^LU (2004) 15th Annual Symposium, CPM 2004 3109. p.220-229
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition
Jansson, Jesper ^LU and Tokuyama, T (2004) In Graphs and Combinatorics 20(2). p.205-222
- Contribution to journal › Article
Mark Approximation algorithms for Hamming clustering problems
Gasieniec, Leszek ; Jansson, Jesper ^LU and Lingas, Andrzej ^LU (2004) In Journal of Discrete Algorithms 2(2 spec. iss.). p.289-301
- Contribution to journal › Article
2003
Mark A fast algorithm for optimal alignment between similar ordered trees
Jansson, Jesper ^LU and Lingas, Andrzej ^LU (2003) In Fundamenta Informaticae 56(1-2). p.105-120
- Contribution to journal › Article
Mark Consensus Algorithms for Trees and Strings
Jansson, Jesper ^LU (2003) In Dissertations 17.
- Thesis › Doctoral thesis (monograph)
2001
Mark A fast algorithm for optimal alignment between similar ordered trees
Jansson, Jesper ^LU and Lingas, Andrzej ^LU (2001) 12th Annual Symposium, CPM 2001 2089. p.232-240
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding