Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Jansson, Jesper
191  Ergebnisse:
Personensuche X
?
1

Polynomial-time equivalences and refined algorithms for lon..:

Asahiro, Yuichi ; Jansson, Jesper ; Lin, Guohui...
Discrete Applied Mathematics.  353 (2024)  - p. 44-64 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Normalized L3-based link prediction in protein–protein inte..:

Yuen, Ho Yin ; Jansson, Jesper
BMC Bioinformatics.  24 (2023)  1 - p. , 2023
Link: https://doi.org/10.1186/..
 
?
3

Finding the Cyclic Covers of a String:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Grossi, Roberto ; Iliopoulos, Costas S. ; Jansson, Jesper... - p. 139-150 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Building a small and informative phylogenetic supertree:

Jansson, Jesper ; Mampentzidis, Konstantinos ; Sandhya, T.P.
Information and Computation.  294 (2023)  - p. 105082 , 2023
Link: https://doi.org/10.1016/..
 
?
5

Editorial: Surveys in Algorithm Analysis and Complexity The..:

Jansson, Jesper
Algorithms.  16 (2023)  4 - p. 188 , 2023
Link: https://doi.org/10.3390/..
 
?
6

Shortest Longest-Path Graph Orientations:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Asahiro, Yuichi ; Jansson, Jesper ; Melkman, Avraham A.... - p. 141-154 , 2023
Link: https://doi.org/10.1007/..
 
?
7

Upper and lower degree-constrained graph orientation with m..:

Asahiro, Yuichi ; Jansson, Jesper ; Miyano, Eiji.
Theoretical Computer Science.  900 (2022)  - p. 53-78 , 2022
Link: https://doi.org/10.1016/..
 
?
8

New and improved algorithms for unordered tree inclusion:

Akutsu, Tatsuya ; Jansson, Jesper ; Li, Ruiming..
Theoretical Computer Science.  883 (2021)  - p. 83-98 , 2021
Link: https://doi.org/10.1016/..
 
?
9

Pushing the Online Boolean Matrix-vector Multiplication con..:

Gąsieniec, Leszek ; Jansson, Jesper ; Levcopoulos, Christos..
Journal of Computer and System Sciences.  118 (2021)  - p. 108-118 , 2021
Link: https://doi.org/10.1016/..
 
?
10

Online and Approximate Network Construction from Bounded Co..:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,
Jansson, Jesper ; Levcopoulos, Christos ; Lingas, Andrzej - p. 314-325 , 2021
Link: https://doi.org/10.1007/..
 
?
11

Fast Algorithms for the Rooted Triplet Distance Between Cat..:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,
Jansson, Jesper ; Lee, Wing Lik - p. 327-340 , 2021
Link: https://doi.org/10.1007/..
 
?
12

Computing the Rooted Triplet Distance Between Phylogenetic ..:

Jansson, Jesper ; Mampentzidis, Konstantinos ; Rajaby, Ramesh.
Algorithmica.  83 (2021)  6 - p. 1786-1828 , 2021
Link: https://doi.org/10.1007/..
 
?
13

Foreword: Selected papers from the 22nd International Sympo..:

Gąsieniec, Leszek ; Jansson, Jesper ; Levcopoulos, Christos
Journal of Computer and System Sciences.  120 (2021)  - p. 177-178 , 2021
Link: https://doi.org/10.1016/..
 
?
14

Better Link Prediction for Protein-Protein Interaction Netw..:

, In: 2020 IEEE 20th International Conference on Bioinformatics and Bioengineering (BIBE),
Yuen, Ho Yin ; Jansson, Jesper - p. 53-60 , 2020
Link: https://doi.org/10.1109/..
 
?
15

Graph orientation with splits:

Asahiro, Yuichi ; Jansson, Jesper ; Miyano, Eiji..
Theoretical Computer Science.  844 (2020)  - p. 16-25 , 2020
Link: https://doi.org/10.1016/..
 
1-15