Jesper Jansson

ORCID

Publication Activity (10 Years)

Years Active: 1997-2022
Publications (10 Years): 43

Top Venues

Theor. Comput. Sci.

Algorithmica

J. Comput. Biol.

J. Comput. Syst. Sci.

Lund University, Sweden (PHD)

Education History

Lund University, Sweden

PHD

Publications

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. 900 (2022)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
Efficient Assignment of Identities in Anonymous Populations. OPODIS (2021)
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
Online and Approximate Network Construction from Bounded Connectivity Constraints. CIAC (2021)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos
Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019). J. Comput. Syst. Sci. 120 (2021)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
Efficient Assignment of Identities in Anonymous Populations. CoRR (2021)
Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura
New and improved algorithms for unordered tree inclusion. Theor. Comput. Sci. 883 (2021)
Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung
Computing the Rooted Triplet Distance Between Phylogenetic Networks. Algorithmica 83 (6) (2021)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32 (2) (2021)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. J. Comput. Syst. Sci. 118 (2021)
Jesper Jansson, Wing Lik Lee
Fast Algorithms for the Rooted Triplet Distance Between Caterpillars. FCT (2021)
Ho Yin Yuen, Jesper Jansson
Better Link Prediction for Protein-Protein Interaction Networks. BIBE (2020)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
Graph orientation with splits. Theor. Comput. Sci. 844 (2020)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. 838 (2020)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. FAW (2019)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA (2019)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.
Graph Orientation with Edge Modifications. FAW (2019)
Jesper Jansson
Editorial: Special Issue on Efficient Data Structures. Algorithms 12 (7) (2019)
Jesper Jansson, Konstantinos Mampentzidis, Sandhya T. P.
Building a Small and Informative Phylogenetic Supertree. WABI (2019)
Jesper Jansson, Ramesh Rajaby, Wing-Kin Sung
An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees. J. Comput. Biol. 26 (9) (2019)
Katharina Dannenberg, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. Discret. Appl. Math. 257 (2019)
Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung
Computing the Rooted Triplet Distance Between Phylogenetic Networks. IWOCA (2019)
Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura
New and Improved Algorithms for Unordered Tree Inclusion. ISAAC (2018)
Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
3D Rectangulations and Geometric Matrix Multiplication. Algorithmica 80 (1) (2018)
Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung
Determining the Consistency of Resolved Triplets and Fan Triplets. J. Comput. Biol. 25 (7) (2018)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
Graph Orientation with Splits. ISCO (2018)
Jesper Jansson, Ramesh Rajaby, Chuanqi Shen, Wing-Kin Sung
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. IEEE ACM Trans. Comput. Biol. Bioinform. 15 (1) (2018)
Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung
Determining the Consistency of Resolved Triplets and Fan Triplets. RECOMB (2017)
Jesper Jansson, Ramesh Rajaby, Wing-Kin Sung
An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees. AlCoB (2017)
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura
On the parameterized complexity of associative and commutative unification. Theor. Comput. Sci. 660 (2017)
Jesper Jansson, Ramesh Rajaby
A More Practical Algorithm for the Rooted Triplet Distance. J. Comput. Biol. 24 (2) (2017)
Jesper Jansson, Zhaoxian Li, Wing-Kin Sung
On finding the Adams consensus tree. Inf. Comput. 256 (2017)
Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura
New Algorithms for Unordered Tree Inclusion. CoRR (2017)
Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu
Faster Algorithms for Computing the R* Consensus Tree. Algorithmica 76 (4) (2016)
Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
Improved Algorithms for Constructing Consensus Trees. J. ACM 63 (3) (2016)
Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu
Similar subtree search using extended tree inclusion. ICDE (2016)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. 58 (1) (2016)
Jesper Jansson, Wing-Kin Sung
Minimal Phylogenetic Supertrees and Local Consensus Trees. MFCS (2016)
Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Algorithmica 71 (4) (2015)
Jesper Jansson, Ramesh Rajaby
A More Practical Algorithm for the Rooted Triplet Distance. AlCoB (2015)
Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. CPM (2015)
Jesper Jansson, Zhaoxian Li, Wing-Kin Sung
On Finding the Adams Consensus Tree. STACS (2015)
Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu
Similar Subtree Search Using Extended Tree Inclusion. IEEE Trans. Knowl. Data Eng. 27 (12) (2015)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19 (1) (2015)
Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
3D Rectangulations and Geometric Matrix Multiplication. ISAAC (2014)
Jesper Jansson, Andrzej Lingas
Computing the rooted triplet distance between galled trees by counting triangles. J. Discrete Algorithms 25 (2014)
Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Fast relative Lempel-Ziv self-index for similar sequences. Theor. Comput. Sci. 532 (2014)
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura
On the Parameterized Complexity of Associative and Commutative Unification. IPEC (2014)
Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu
Faster Algorithms for Computing the R* Consensus Tree. ISAAC (2014)
Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
An Optimal Algorithm for Building the Majority Rule Consensus Tree. RECOMB (2013)
Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. WABI (2013)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA (2013)
Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
Improved Algorithms for Constructing Consensus Trees. SODA (2013)
Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. CoRR (2013)
Jesper Jansson, Wing-Kin Sung
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. Algorithmica 66 (2) (2013)
Jesper Jansson
Editorial: Special Issue on Graph Algorithms. Algorithms 6 (3) (2013)
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197 (2012)
Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. 78 (2) (2012)
Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Fast Relative Lempel-Ziv Self-index for Similar Sequences. FAW-AAIM (2012)
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung
More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444 (2012)
Jesper Jansson, Richard S. Lemence, Andrzej Lingas
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. SIAM J. Comput. 41 (1) (2012)
Yun Cui, Jesper Jansson, Wing-Kin Sung
Polynomial-Time Algorithms for Building a Consensus MUL-Tree. J. Comput. Biol. 19 (9) (2012)
Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane
Inferring a graph from path frequency. Discret. Appl. Math. 160 (10-11) (2012)
Kun-Mao Chao, An-Chiang Chu, Jesper Jansson, Richard S. Lemence, Alban Mancheron
Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics. TAMC (2012)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO (2012)
Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
CRAM: Compressed Random Access Memory. ICALP (1) (2012)
Jesper Jansson, Andrzej Lingas
Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. CPM (2012)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS (2012)
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (4) (2011)
José Carlos Clemente, Jesper Jansson, Gabriel Valiente
Flexible taxonomic assignment of ambiguous sequencing reads. BMC Bioinform. 12 (2011)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22 (1) (2011)
Yun Cui, Jesper Jansson, Wing-Kin Sung
Algorithms for Building Consensus MUL-trees. ISAAC (2011)
Jesper Jansson, Zeshan Peng
Algorithms for Finding a Most Similar Subforest. Theory Comput. Syst. 48 (4) (2011)
Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. 22 (8) (2011)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. 22 (3) (2011)
Jesper Jansson, Richard S. Lemence, Andrzej Lingas
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. WABI (2010)
José Carlos Clemente, Jesper Jansson, Gabriel Valiente
Accurate Taxonomic Assignment of Short Pyrosequencing Reads. Pacific Symposium on Biocomputing (2010)
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
New results on optimizing rooted triplets consistency. Discret. Appl. Math. 158 (11) (2010)
Jesper Jansson, Wing-Kin Sung
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. ESA (1) (2010)
Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
Linear-time protein 3-D structure searching with insertions and deletions. Algorithms Mol. Biol. 5 (2010)
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM (2010)
Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Compressed random access memory CoRR (2010)
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO (2009)
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. ISAAC (2009)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph orientation to maximize the minimum weighted outdegree. IPDPS (2009)
Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. WABI (2009)
Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS (2009)
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
More efficient periodic traversal in anonymous undirected graphs CoRR (2009)
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
New Results on Optimizing Rooted Triplets Consistency. ISAAC (2008)
Jesper Jansson, Zeshan Peng
Online and Dynamic Recognition of Squarefree Strings. Int. J. Found. Comput. Sci. 18 (2) (2007)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica 48 (3) (2007)
Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. FSTTCS (2007)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM (2007)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. 18 (2) (2007)
Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Ultra-succinct representation of ordered trees. SODA (2007)
Jesper Jansson, Wing-Kin Sung
Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theor. Comput. Sci. 363 (1) (2006)
Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung
Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets. J. Bioinform. Comput. Biol. 4 (1) (2006)
Jesper Jansson, Zeshan Peng
Algorithms for Finding a Most Similar Subforest. CPM (2006)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS (2006)
Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. J. Bioinform. Comput. Biol. 4 (4) (2006)
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. J. Comput. Biol. 13 (3) (2006)

Jesper Jansson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jesper Jansson