default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesper Jansson 0001
Person information
- affiliation: Kyoto University, Japan
- affiliation (former): The Hong Kong Polytechnic University, China
- affiliation (PhD 2003): Lund University, Sweden
Other persons with the same name
- Jesper Jansson 0002 — University of Gothenburg, Sweden
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j62]Yuichi Asahiro, Jesper Jansson
, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discret. Appl. Math. 353: 44-64 (2024)- [c73]Daniel J. Harvey, Jesper Jansson, Mikolaj Marciniak, Yukihiro Murakami:
Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems. IWOCA 2024: 193-205 - [c72]Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee, Yutong Yang:
A Faster Algorithm for Constructing the Frequency Difference Consensus Tree. STACS 2024: 43:1-43:17 - [i7]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. CoRR abs/2404.06068 (2024) - 2023
- [j61]Jesper Jansson:
Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue). Algorithms 16(4): 188 (2023) - [j60]Ho Yin Yuen, Jesper Jansson:
Normalized L3-based link prediction in protein-protein interaction networks. BMC Bioinform. 24(1): 59 (2023) - [j59]Jesper Jansson, Konstantinos Mampentzidis, T. P. Sandhya:
Building a small and informative phylogenetic supertree. Inf. Comput. 294: 105082 (2023) - [j58]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Online and Approximate Network Construction from Bounded Connectivity Constraints. Int. J. Found. Comput. Sci. 34(5): 453-468 (2023) - [c71]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CCCG 2023: 183-189 - [c70]Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov:
Shortest Longest-Path Graph Orientations. COCOON (1) 2023: 141-154 - [c69]Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka:
Approximation Algorithms for the Longest Run Subsequence Problem. CPM 2023: 2:1-2:12 - [c68]Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung:
MUL-Tree Pruning for Consistency and Compatibility. CPM 2023: 14:1-14:18 - [c67]Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba:
Finding the Cyclic Covers of a String. WALCOM 2023: 139-150 - [i6]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CoRR abs/2305.09987 (2023) - 2022
- [j57]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. 900: 53-78 (2022) - [c66]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM 2022: 15:1-15:17 - 2021
- [j56]Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung:
Computing the Rooted Triplet Distance Between Phylogenetic Networks. Algorithmica 83(6): 1786-1828 (2021) - [j55]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32(2): 209-233 (2021) - [j54]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: 108-118 (2021) - [j53]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: 177-178 (2021) - [j52]Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura:
New and improved algorithms for unordered tree inclusion. Theor. Comput. Sci. 883: 83-98 (2021) - [c65]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Online and Approximate Network Construction from Bounded Connectivity Constraints. CIAC 2021: 314-325 - [c64]Jesper Jansson, Wing Lik Lee:
Fast Algorithms for the Rooted Triplet Distance Between Caterpillars. FCT 2021: 327-340 - [c63]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Efficient Assignment of Identities in Anonymous Populations. OPODIS 2021: 12:1-12:21 - [i5]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Efficient Assignment of Identities in Anonymous Populations. CoRR abs/2105.12083 (2021) - 2020
- [j51]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: 238-249 (2020) - [j50]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph orientation with splits. Theor. Comput. Sci. 844: 16-25 (2020) - [c62]Ho Yin Yuen, Jesper Jansson:
Better Link Prediction for Protein-Protein Interaction Networks. BIBE 2020: 53-60
2010 – 2019
- 2019
- [j49]Jesper Jansson:
Editorial: Special Issue on Efficient Data Structures. Algorithms 12(7): 136 (2019) - [j48]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: 101-114 (2019) - [j47]Jesper Jansson, Ramesh Rajaby, Wing-Kin Sung:
An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees. J. Comput. Biol. 26(9): 893-907 (2019) - [c61]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA 2019: 1-12 - [c60]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.:
Graph Orientation with Edge Modifications. FAW 2019: 38-50 - [c59]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: 156-169 - [c58]Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung:
Computing the Rooted Triplet Distance Between Phylogenetic Networks. IWOCA 2019: 290-303 - [c57]Jesper Jansson, Konstantinos Mampentzidis, Sandhya T. P.:
Building a Small and Informative Phylogenetic Supertree. WABI 2019: 1:1-1:14 - [e2]Leszek Antoni Gasieniec, Jesper Jansson, Christos Levcopoulos:
Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings. Lecture Notes in Computer Science 11651, Springer 2019, ISBN 978-3-030-25026-3 [contents] - 2018
- [j46]Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu:
3D Rectangulations and Geometric Matrix Multiplication. Algorithmica 80(1): 136-154 (2018) - [j45]Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung:
Determining the Consistency of Resolved Triplets and Fan Triplets. J. Comput. Biol. 25(7): 740-754 (2018) - [j44]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): 15-26 (2018) - [c56]Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura:
New and Improved Algorithms for Unordered Tree Inclusion. ISAAC 2018: 27:1-27:12 - [c55]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph Orientation with Splits. ISCO 2018: 52-63 - [e1]Jesper Jansson, Carlos Martín-Vide, Miguel A. Vega-Rodríguez:
Algorithms for Computational Biology - 5th International Conference, AlCoB 2018, Hong Kong, China, June 25-26, 2018, Proceedings. Lecture Notes in Computer Science 10849, Springer 2018, ISBN 978-3-319-91937-9 [contents] - 2017
- [j43]Jesper Jansson, Zhaoxian Li, Wing-Kin Sung:
On finding the Adams consensus tree. Inf. Comput. 256: 334-347 (2017) - [j42]Jesper Jansson, Ramesh Rajaby:
A More Practical Algorithm for the Rooted Triplet Distance. J. Comput. Biol. 24(2): 106-126 (2017) - [j41]Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura:
On the parameterized complexity of associative and commutative unification. Theor. Comput. Sci. 660: 57-74 (2017) - [c54]Jesper Jansson, Ramesh Rajaby, Wing-Kin Sung:
An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees. AlCoB 2017: 115-126 - [c53]Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung:
Determining the Consistency of Resolved Triplets and Fan Triplets. RECOMB 2017: 82-98 - [i4]Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura:
New Algorithms for Unordered Tree Inclusion. CoRR abs/1712.05517 (2017) - 2016
- [j40]Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu:
Faster Algorithms for Computing the R* Consensus Tree. Algorithmica 76(4): 1224-1244 (2016) - [j39]Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
Improved Algorithms for Constructing Consensus Trees. J. ACM 63(3): 28:1-28:24 (2016) - [j38]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. 58(1): 60-93 (2016) - [c52]Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu:
Similar subtree search using extended tree inclusion. ICDE 2016: 1558-1559 - [c51]Jesper Jansson, Wing-Kin Sung:
Minimal Phylogenetic Supertrees and Local Consensus Trees. MFCS 2016: 53:1-53:14 - [r8]Jesper Jansson, Wing-Kin Sung:
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. Encyclopedia of Algorithms 2016: 48-52 - [r7]Jesper Jansson:
Directed Perfect Phylogeny (Binary Characters). Encyclopedia of Algorithms 2016: 553-556 - [r6]Jesper Jansson, Wing-Kin Sung:
Maximum Agreement Supertree. Encyclopedia of Algorithms 2016: 1224-1227 - [r5]Jesper Jansson:
Perfect Phylogeny (Bounded Number of States). Encyclopedia of Algorithms 2016: 1550-1553 - [r4]Jesper Jansson:
Phylogenetic Tree Construction from a Distance Matrix. Encyclopedia of Algorithms 2016: 1564-1567 - 2015
- [j37]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Algorithmica 71(4): 969-988 (2015) - [j36]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19(1): 441-465 (2015) - [j35]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): 3360-3373 (2015) - [c50]Jesper Jansson, Ramesh Rajaby:
A More Practical Algorithm for the Rooted Triplet Distance. AlCoB 2015: 109-125 - [c49]Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. CPM 2015: 272-283 - [c48]Jesper Jansson, Zhaoxian Li, Wing-Kin Sung:
On Finding the Adams Consensus Tree. STACS 2015: 487-499 - 2014
- [j34]Jesper Jansson, Andrzej Lingas:
Computing the rooted triplet distance between galled trees by counting triangles. J. Discrete Algorithms 25: 66-78 (2014) - [j33]Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Fast relative Lempel-Ziv self-index for similar sequences. Theor. Comput. Sci. 532: 14-30 (2014) - [c47]Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu:
3D Rectangulations and Geometric Matrix Multiplication. ISAAC 2014: 65-78 - [c46]Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu:
Faster Algorithms for Computing the R* Consensus Tree. ISAAC 2014: 414-425 - [c45]Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura:
On the Parameterized Complexity of Associative and Commutative Unification. IPEC 2014: 15-27 - 2013
- [j32]Jesper Jansson, Wing-Kin Sung:
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. Algorithmica 66(2): 329-345 (2013) - [j31]Jesper Jansson:
Editorial: Special Issue on Graph Algorithms. Algorithms 6(3): 457-458 (2013) - [c44]Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
An Optimal Algorithm for Building the Majority Rule Consensus Tree. RECOMB 2013: 88-99 - [c43]Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
Improved Algorithms for Constructing Consensus Trees. SODA 2013: 1800-1813 - [c42]Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. WABI 2013: 141-155 - [c41]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA 2013: 24-36 - [i3]Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. CoRR abs/1307.7821 (2013) - 2012
- [j30]Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane:
Inferring a graph from path frequency. Discret. Appl. Math. 160(10-11): 1416-1428 (2012) - [j29]Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente:
Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197: 77-90 (2012) - [j28]Yun Cui, Jesper Jansson, Wing-Kin Sung:
Polynomial-Time Algorithms for Building a Consensus MUL-Tree. J. Comput. Biol. 19(9): 1073-1088 (2012) - [j27]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. 78(2): 619-631 (2012) - [j26]Jesper Jansson, Richard S. Lemence, Andrzej Lingas:
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. SIAM J. Comput. 41(1): 272-291 (2012) - [j25]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: 60-76 (2012) - [c40]Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Fast Relative Lempel-Ziv Self-index for Similar Sequences. FAW-AAIM 2012: 291-302 - [c39]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS 2012: 139-146 - [c38]Jesper Jansson, Andrzej Lingas:
Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. CPM 2012: 385-398 - [c37]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
CRAM: Compressed Random Access Memory. ICALP (1) 2012: 510-521 - [c36]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO 2012: 332-343 - [c35]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: 177-188 - 2011
- [j24]José Carlos Clemente, Jesper Jansson, Gabriel Valiente:
Flexible taxonomic assignment of ambiguous sequencing reads. BMC Bioinform. 12: 8 (2011) - [j23]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. 22(3): 583-601 (2011) - [j22]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): 1949-1969 (2011) - [j21]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): 78-96 (2011) - [j20]Jesper Jansson, Zeshan Peng:
Algorithms for Finding a Most Similar Subforest. Theory Comput. Syst. 48(4): 865-887 (2011) - [j19]Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung:
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets. IEEE ACM Trans. Comput. Biol. Bioinform. 8(4): 1141-1147 (2011) - [c34]Yun Cui, Jesper Jansson, Wing-Kin Sung:
Algorithms for Building Consensus MUL-trees. ISAAC 2011: 744-753 - 2010
- [j18]Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane:
Linear-time protein 3-D structure searching with insertions and deletions. Algorithms Mol. Biol. 5: 7 (2010) - [j17]Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson:
New results on optimizing rooted triplets consistency. Discret. Appl. Math. 158(11): 1136-1147 (2010) - [c33]Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente:
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM 2010: 190-201 - [c32]Jesper Jansson, Wing-Kin Sung:
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. ESA (1) 2010: 573-584 - [c31]José Carlos Clemente, Jesper Jansson, Gabriel Valiente:
Accurate Taxonomic Assignment of Short Pyrosequencing Reads. Pacific Symposium on Biocomputing 2010: 3-9 - [c30]Jesper Jansson, Richard S. Lemence, Andrzej Lingas:
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. WABI 2010: 262-273 - [i2]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Compressed random access memory. CoRR abs/1011.1708 (2010)
2000 – 2009
- 2009
- [c29]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph orientation to maximize the minimum weighted outdegree. IPDPS 2009: 1-8 - [c28]Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung:
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. ISAAC 2009: 1205-1214 - [c27]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: 167-181 - [c26]Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane:
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. WABI 2009: 310-320 - [c25]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski:
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS 2009: 168-180 - [i1]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 abs/0905.1737 (2009) - 2008
- [c24]Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson:
New Results on Optimizing Rooted Triplets Consistency. ISAAC 2008: 484-495 - [r3]Jesper Jansson:
Directed Perfect Phylogeny (Binary Characters). Encyclopedia of Algorithms 2008 - [r2]Jesper Jansson:
Perfect Phylogeny (Bounded Number of States). Encyclopedia of Algorithms 2008 - [r1]Jesper Jansson:
Phylogenetic Tree Construction from a Distance Matrix. Encyclopedia of Algorithms 2008 - 2007
- [j16]Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica 48(3): 233-248 (2007) - [j15]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): 217-226 (2007) - [j14]Jesper Jansson, Zeshan Peng:
Online and Dynamic Recognition of Squarefree Strings. Int. J. Found. Comput. Sci. 18(2): 401-414 (2007) - [c23]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM 2007: 167-177 - [c22]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. FSTTCS 2007: 424-435 - [c21]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Ultra-succinct representation of ordered trees. SODA 2007: 575-584 - 2006
- [j13]Jesper Jansson, See-Kiong Ng, Wing-Kin Sung, Hugo Willy:
A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment. Algorithmica 46(2): 223-245 (2006) - [j12]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): 59-74 (2006) - [j11]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): 807-832 (2006) - [j10]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): 702-718 (2006) - [j9]Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung:
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. SIAM J. Comput. 35(5): 1098-1121 (2006) - [j8]Jesper Jansson, Wing-Kin Sung:
Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theor. Comput. Sci. 363(1): 60-68 (2006) - [c20]Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS 2006: 101-105 - [c19]Jesper Jansson, Zeshan Peng:
Algorithms for Finding a Most Similar Subforest. CPM 2006: 377-388 - 2005
- [j7]Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung:
Rooted Maximum Agreement Supertrees. Algorithmica 43(4): 293-307 (2005) - [j6]Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. 335(1): 93-107 (2005) - [c18]Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung:
Inferring phylogenetic relationships avoiding forbidden rooted triplets. APBC 2005: 339-348 - [c17]Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu:
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. MFCS 2005: 224-235 - [c16]Jesper Jansson, Zeshan Peng:
Online and Dynamic Recognition of Squarefree Strings. MFCS 2005: 520-531 - [c15]Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung:
Constructing a Smallest Refining Galled Phylogenetic Network. RECOMB 2005: 265-280 - [c14]Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO 2005: 127-139 - [c13]Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung:
Algorithms for combining rooted triplets into a galled phylogenetic network. SODA 2005: 349-358 - 2004
- [j5]Jesper Jansson, Takeshi Tokuyama:
Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition. Graphs Comb. 20(2): 205-222 (2004) - [j4]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Approximation algorithms for Hamming clustering problems. J. Discrete Algorithms 2(2): 289-301 (2004) - [c12]Jesper Jansson, Wing-Kin Sung:
Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. COCOON 2004: 462-472 - [c11]Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM 2004: 220-229 - [c10]Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung:
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. ISAAC 2004: 569-580 - [c9]Jesper Jansson, Wing-Kin Sung:
The Maximum Agreement of Two Nested Phylogenetic Networks. ISAAC 2004: 581-593 - [c8]Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung:
Rooted Maximum Agreement Supertrees. LATIN 2004: 499-508 - [c7]Jesper Jansson, See-Kiong Ng, Wing-Kin Sung, Hugo Willy:
A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences Through Alignment. WABI 2004: 302-313 - [c6]Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Computing the Maximum Agreement of Phylogenetic Networks. CATS 2004: 134-147 - 2003
- [b1]Jesper Jansson:
Consensus Algorithms for Trees and Strings. Lund University, Sweden, 2003 - [j3]Jesper Jansson, Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. Fundam. Informaticae 56(1-2): 105-120 (2003) - 2001
- [j2]Jesper Jansson:
On the Complexity of Inferring Rooted Evolutionary Trees. Electron. Notes Discret. Math. 7: 50-53 (2001) - [c5]Jesper Jansson, Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. CPM 2001: 232-240 - 2000
- [c4]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Approximation Algorithms for Hamming Clustering Problems. CPM 2000: 108-118
1990 – 1999
- 1999
- [j1]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
On the Complexity of Constructing Evolutionary Trees. J. Comb. Optim. 3(2-3): 183-197 (1999) - [c3]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Efficient Approximation Algorithms for the Hamming Center Problem. SODA 1999: 905-906 - 1998
- [c2]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
Inferring Ordered Trees from Local Constraints. CATS 1998: 67-76 - 1997
- [c1]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
On the Complexity of Computing Evolutionary Trees. COCOON 1997: 134-145
Coauthor Index
Leszek Gasieniec
aka: Leszek Antoni Gasieniec
aka: Leszek Antoni Gasieniec
[c72] [c68] [c67] [j56] [j47] [c58] [j45] [j44] [j43] [c54] [c53] [j40] [j39] [c51] [r8] [r6] [j37] [c48] [j33] [c46] [j32] [c44] [c43] [c42] [i3] [j28] [j27] [j25] [c40] [c37] [j19] [c34] [c32] [i2] [c28] [c27] [i1] [c22] [c21] [j13] [j12] [j10] [j9] [j8] [j7] [j6] [c18] [c15] [c14] [c13] [c12] [c10] [c9] [c8] [c7] [c6]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
