On the Complexity of Computing Evolutionary Trees. - Leszek Gasieniec; Jesper Jansson 001; Andrzej Lingas; Anna Östlin (COCOON, 1997)

Inferring Ordered Trees from Local Constraints. - Leszek Gasieniec; Jesper Jansson 001; Andrzej Lingas; Anna Östlin (CATS, 1998)

Efficient Approximation Algorithms for the Hamming Center Problem. - Leszek Gasieniec; Jesper Jansson 001; Andrzej Lingas (SODA, 1999)

On the Complexity of Constructing Evolutionary Trees. - Leszek Gasieniec; Jesper Jansson 001; Andrzej Lingas; Anna Östlin (J. Comb. Optim., 1999)

On the Complexity of Inferring Rooted Evolutionary Trees. - Jesper Jansson 001 (Electron. Notes Discret. Math., 2001)

A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. - Jesper Jansson 001; Andrzej Lingas (Fundam. Informaticae, 2003)

Consensus Algorithms for Trees and Strings. - Jesper Jansson 001 (2003)

The Maximum Agreement of Two Nested Phylogenetic Networks. - Jesper Jansson 001; Wing-Kin Sung (ISAAC, 2004)

Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition. - Jesper Jansson 001; Takeshi Tokuyama (Graphs Comb., 2004)

Approximation algorithms for Hamming clustering problems. - Leszek Gasieniec; Jesper Jansson 001; Andrzej Lingas (J. Discrete Algorithms, 2004)

Constructing a Smallest Refining Galled Phylogenetic Network. - Trinh N. D. Huynh; Jesper Jansson 001; Nguyen Bao Nguyen; Wing-Kin Sung (RECOMB, 2005)

Finding Short Right-Hand-on-the-Wall Walks in Graphs. - Stefan Dobrev; Jesper Jansson 001; Kunihiko Sadakane; Wing-Kin Sung (SIROCCO, 2005)

Rooted Maximum Agreement Supertrees. - Jesper Jansson 001; Joseph H.-K. Ng; Kunihiko Sadakane; Wing-Kin Sung (Algorithmica, 2005)

Computing the maximum agreement of phylogenetic networks. - Charles Choy; Jesper Jansson 001; Kunihiko Sadakane; Wing-Kin Sung (Theor. Comput. Sci., 2005)

A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment. - Jesper Jansson 001; See-Kiong Ng; Wing-Kin Sung; Hugo Willy (Algorithmica, 2006)

Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. - Ho-Leung Chan; Jesper Jansson 001; Tak Wah Lam; Siu-Ming Yiu (J. Bioinform. Comput. Biol., 2006)

Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets. - Ying-Jun He; Trinh N. D. Huynh; Jesper Jansson 001; Wing-Kin Sung (J. Bioinform. Comput. Biol., 2006)

Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. - Jesper Jansson 001; Ngo Trung Hieu; Wing-Kin Sung (J. Comput. Biol., 2006)

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. - Jesper Jansson 001; Nguyen Bao Nguyen; Wing-Kin Sung (SIAM J. Comput., 2006)

Inferring a level-1 phylogenetic network from a dense set of rooted triplets. - Jesper Jansson 001; Wing-Kin Sung (Theor. Comput. Sci., 2006)

Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. - Jesper Jansson 001; Kunihiko Sadakane; Wing-Kin Sung (FSTTCS, 2007)

Ultra-succinct representation of ordered trees. - Jesper Jansson 001; Kunihiko Sadakane; Wing-Kin Sung (SODA, 2007)

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. - Anders Dessmark; Jesper Jansson 001; Andrzej Lingas; Eva-Marta Lundell (Algorithmica, 2007)

On the Approximability of Maximum and Minimum Edge Clique Partition Problems. - Anders Dessmark; Jesper Jansson 001; Andrzej Lingas; Eva-Marta Lundell; Mia Persson (Int. J. Found. Comput. Sci., 2007)

Online and Dynamic Recognition of Squarefree Strings. - Jesper Jansson 001; Zeshan Peng (Int. J. Found. Comput. Sci., 2007)

Directed Perfect Phylogeny (Binary Characters). - Jesper Jansson 001 (Encyclopedia of Algorithms, 2008)

Perfect Phylogeny (Bounded Number of States). - Jesper Jansson 001 (Encyclopedia of Algorithms, 2008)

Phylogenetic Tree Construction from a Distance Matrix. - Jesper Jansson 001 (Encyclopedia of Algorithms, 2008)

Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. - Sylvain Guillemot; Jesper Jansson 001; Wing-Kin Sung (ISAAC, 2009)

Accurate Taxonomic Assignment of Short Pyrosequencing Reads. - José Carlos Clemente; Jesper Jansson 001; Gabriel Valiente (Pacific Symposium on Biocomputing, 2010)

Linear-time protein 3-D structure searching with insertions and deletions. - Tetsuo Shibuya; Jesper Jansson 001; Kunihiko Sadakane (Algorithms Mol. Biol., 2010)

Compressed random access memory - Jesper Jansson 001; Kunihiko Sadakane; Wing-Kin Sung (CoRR, 2010)

New results on optimizing rooted triplets consistency. - Jaroslaw Byrka; Sylvain Guillemot; Jesper Jansson 001 (Discret. Appl. Math., 2010)

Algorithms for Building Consensus MUL-trees. - Yun Cui; Jesper Jansson 001; Wing-Kin Sung (ISAAC, 2011)

Flexible taxonomic assignment of ambiguous sequencing reads. - José Carlos Clemente; Jesper Jansson 001; Gabriel Valiente (BMC Bioinform., 2011)

Graph Orientation to Maximize the Minimum Weighted Outdegree. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Int. J. Found. Comput. Sci., 2011)

Approximation Algorithms for Buy-at-Bulk Geometric Network Design. - Artur Czumaj; Jurek Czyzowicz; Leszek Gasieniec; Jesper Jansson 001; Andrzej Lingas; Pawel Zylinski (Int. J. Found. Comput. Sci., 2011)

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001; Kouhei Zenmyo (J. Comb. Optim., 2011)

Algorithms for Finding a Most Similar Subforest. - Jesper Jansson 001; Zeshan Peng (Theory Comput. Syst., 2011)

Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets. - Sylvain Guillemot; Jesper Jansson 001; Wing-Kin Sung (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (CATS, 2012)

CRAM: Compressed Random Access Memory. - Jesper Jansson 001; Kunihiko Sadakane; Wing-Kin Sung (ICALP (1), 2012)

Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics. - Kun-Mao Chao; An-Chiang Chu; Jesper Jansson 001; Richard S. Lemence; Alban Mancheron (TAMC, 2012)

Inferring a graph from path frequency. - Tatsuya Akutsu; Daiji Fukagawa; Jesper Jansson 001; Kunihiko Sadakane (Discret. Appl. Math., 2012)

Faster computation of the Robinson-Foulds distance between phylogenetic networks. - Tetsuo Asano; Jesper Jansson 001; Kunihiko Sadakane; Ryuhei Uehara; Gabriel Valiente (Inf. Sci., 2012)

Polynomial-Time Algorithms for Building a Consensus MUL-Tree. - Yun Cui; Jesper Jansson 001; Wing-Kin Sung (J. Comput. Biol., 2012)

Ultra-succinct representation of ordered trees with applications. - Jesper Jansson 001; Kunihiko Sadakane; Wing-Kin Sung (J. Comput. Syst. Sci., 2012)

The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. - Jesper Jansson 001; Richard S. Lemence; Andrzej Lingas (SIAM J. Comput., 2012)

More efficient periodic traversal in anonymous undirected graphs. - Jurek Czyzowicz; Stefan Dobrev; Leszek Gasieniec; David Ilcinkas; Jesper Jansson 001; Ralf Klasing; Ioannis Lignos; Russell Martin; Kunihiko Sadakane; Wing-Kin Sung (Theor. Comput. Sci., 2012)

An Optimal Algorithm for Building the Majority Rule Consensus Tree. - Jesper Jansson 001; Chuanqi Shen; Wing-Kin Sung (RECOMB, 2013)

Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. - Jesper Jansson 001; Chuanqi Shen; Wing-Kin Sung (WABI, 2013)

Constructing the R* Consensus Tree of Two Trees in Subcubic Time. - Jesper Jansson 001; Wing-Kin Sung (Algorithmica, 2013)

Editorial: Special Issue on Graph Algorithms. - Jesper Jansson 001 (Algorithms, 2013)

Computing the rooted triplet distance between galled trees by counting triangles. - Jesper Jansson 001; Andrzej Lingas (J. Discrete Algorithms, 2014)

Fast relative Lempel-Ziv self-index for similar sequences. - Huy Hoang Do; Jesper Jansson 001; Kunihiko Sadakane; Wing-Kin Sung (Theor. Comput. Sci., 2014)

The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. - Jesper Jansson 001; Andrzej Lingas; Eva-Marta Lundell (CPM, 2015)

Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. - Jesper Jansson 001; Kunihiko Sadakane; Wing-Kin Sung (Algorithmica, 2015)

Graph Orientations Optimizing the Number of Light or Heavy Vertices. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (J. Graph Algorithms Appl., 2015)

Similar Subtree Search Using Extended Tree Inclusion. - Tomoya Mori; Atsuhiro Takasu; Jesper Jansson 001; Jaewook Hwang; Takeyuki Tamura; Tatsuya Akutsu (IEEE Trans. Knowl. Data Eng., 2015)

Minimal Phylogenetic Supertrees and Local Consensus Trees. - Jesper Jansson 001; Wing-Kin Sung (MFCS, 2016)

Faster Algorithms for Computing the R* Consensus Tree. - Jesper Jansson 001; Wing-Kin Sung; Hoa Vu; Siu-Ming Yiu (Algorithmica, 2016)

Improved Algorithms for Constructing Consensus Trees. - Jesper Jansson 001; Chuanqi Shen; Wing-Kin Sung (J. ACM, 2016)

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Theory Comput. Syst., 2016)

Directed Perfect Phylogeny (Binary Characters). - Jesper Jansson 001 (Encyclopedia of Algorithms, 2016)

Perfect Phylogeny (Bounded Number of States). - Jesper Jansson 001 (Encyclopedia of Algorithms, 2016)

Phylogenetic Tree Construction from a Distance Matrix. - Jesper Jansson 001 (Encyclopedia of Algorithms, 2016)

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. - Jesper Jansson 001; Wing-Kin Sung (Encyclopedia of Algorithms, 2016)

Maximum Agreement Supertree. - Jesper Jansson 001; Wing-Kin Sung (Encyclopedia of Algorithms, 2016)

New Algorithms for Unordered Tree Inclusion. - Tatsuya Akutsu; Jesper Jansson 001; Ruiming Li; Atsuhiro Takasu; Takeyuki Tamura (CoRR, 2017)

On finding the Adams consensus tree. - Jesper Jansson 001; Zhaoxian Li; Wing-Kin Sung (Inf. Comput., 2017)

A More Practical Algorithm for the Rooted Triplet Distance. - Jesper Jansson 001; Ramesh Rajaby (J. Comput. Biol., 2017)

On the parameterized complexity of associative and commutative unification. - Tatsuya Akutsu; Jesper Jansson 001; Atsuhiro Takasu; Takeyuki Tamura (Theor. Comput. Sci., 2017)

3D Rectangulations and Geometric Matrix Multiplication. - Peter Floderus; Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Dzmitry Sledneu (Algorithmica, 2018)

Determining the Consistency of Resolved Triplets and Fan Triplets. - Jesper Jansson 001; Andrzej Lingas; Ramesh Rajaby; Wing-Kin Sung (J. Comput. Biol., 2018)

Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. - Jesper Jansson 001; Ramesh Rajaby; Chuanqi Shen; Wing-Kin Sung (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (COCOA, 2019)

Graph Orientation with Edge Modifications. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001; Sandhya T. P. 001 (FAW, 2019)

Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. - Leszek Gasieniec; Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Mia Persson (FAW, 2019)

Editorial: Special Issue on Efficient Data Structures. - Jesper Jansson 001 (Algorithms, 2019)

The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. - Katharina Dannenberg; Jesper Jansson 001; Andrzej Lingas; Eva-Marta Lundell (Discret. Appl. Math., 2019)

An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees. - Jesper Jansson 001; Ramesh Rajaby; Wing-Kin Sung (J. Comput. Biol., 2019)

Better Link Prediction for Protein-Protein Interaction Networks. - Ho Yin Yuen; Jesper Jansson 001 (BIBE, 2020)

Exact algorithms for the repetition-bounded longest common subsequence problem. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (Theor. Comput. Sci., 2020)

Graph orientation with splits. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hesam Nikpey; Hirotaka Ono 001 (Theor. Comput. Sci., 2020)

Fast Algorithms for the Rooted Triplet Distance Between Caterpillars. - Jesper Jansson 001; Wing Lik Lee (FCT, 2021)

Computing the Rooted Triplet Distance Between Phylogenetic Networks. - Jesper Jansson 001; Konstantinos Mampentzidis; Ramesh Rajaby; Wing-Kin Sung (Algorithmica, 2021)

Graph Orientation with Edge Modifications. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Int. J. Found. Comput. Sci., 2021)

Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019). - Leszek Gasieniec; Jesper Jansson 001; Christos Levcopoulos (J. Comput. Syst. Sci., 2021)

Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. - Leszek Gasieniec; Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Mia Persson (J. Comput. Syst. Sci., 2021)

New and improved algorithms for unordered tree inclusion. - Tatsuya Akutsu; Jesper Jansson 001; Ruiming Li; Atsuhiro Takasu; Takeyuki Tamura (Theor. Comput. Sci., 2021)

Upper and lower degree-constrained graph orientation with minimum penalty. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Theor. Comput. Sci., 2022)

Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. - Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas (CCCG, 2023)

Shortest Longest-Path Graph Orientations. - Yuichi Asahiro; Jesper Jansson 001; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono 001; Quan Xue; Shay Zakov (COCOON (1), 2023)

Approximation Algorithms for the Longest Run Subsequence Problem. - Yuichi Asahiro; Hiroshi Eto; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Shunichi Tanaka (CPM, 2023)

MUL-Tree Pruning for Consistency and Compatibility. - Christopher Hampson; Daniel J. Harvey; Costas S. Iliopoulos; Jesper Jansson 001; Zara Lim; Wing-Kin Sung (CPM, 2023)

Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue). - Jesper Jansson 001 (Algorithms, 2023)

Online and Approximate Network Construction from Bounded Connectivity Constraints. - Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas (Int. J. Found. Comput. Sci., 2023)

Building a small and informative phylogenetic supertree. - Jesper Jansson 001; Konstantinos Mampentzidis; T. P. Sandhya 001 (Inf. Comput., 2023)

Normalized L3-based link prediction in protein-protein interaction networks. - Ho Yin Yuen; Jesper Jansson 001 (BMC Bioinform., 2023)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. - Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Quan Xue (COCOON (2), 2024)

Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems. - Daniel J. Harvey; Jesper Jansson 001; Mikolaj Marciniak; Yukihiro Murakami (IWOCA, 2024)

A Faster Algorithm for Constructing the Frequency Difference Consensus Tree. - Jesper Jansson 001; Wing-Kin Sung; Seyed Ali Tabatabaee; Yutong Yang (STACS, 2024)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. - Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas (CoRR, 2024)

Polynomial-time equivalences and refined algorithms for longest common subsequence variants. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (Discret. Appl. Math., 2024)

Multiplication of 0-1 Matrices via Clustering. - Jesper Jansson 001; Miroslaw Kowaluk; Andrzej Lingas; Mia Persson (IJTCS-FAW, 2025)

Shortest Longest-Path Graph Orientations for Trees. - Yuichi Asahiro; Jesper Jansson 001; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono 001; Quan Xue; Yoshichika Yano; Shay Zakov (SOFSEM (1), 2025)

Approximability of Longest Run Subsequence and Complementary Minimization Problems. - Yuichi Asahiro; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Sichen Lu; Eiji Miyano; Hirotaka Ono 001; Toshiki Saitoh; Shunichi Tanaka (WABI, 2025)

Efficient assignment of identities in anonymous populations. - Leszek Gasieniec; Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas (Inf. Comput., 2025)

Deterministic protocols for Voronoi diagrams and triangulations of planar point sets on the congested clique. - Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Valentin Polishchuk; Quan Xue (Theor. Comput. Sci., 2025)

Finding the cyclic covers of a string. - Roberto Grossi; Costas S. Iliopoulos; Jesper Jansson 001; Zara Lim; Wing-Kin Sung; Wiktor Zuba (Inf. Process. Lett., 2026)