Jesper Jansson

According to our database, Jesper Jansson authored at least 112 papers between 1997 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Graph-based method for constructing consensus trees.

Elio Torquet, Jesper Jansson, Nadia Tahiri

CoRR, August, 2025

Deterministic protocols for Voronoi diagrams and triangulations of planar point sets on the congested clique.

Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Valentin Polishchuk, Quan Xue

Theor. Comput. Sci., 2025

Editorial: Surveys in Algorithm Analysis and Complexity Theory, Part II (Special Issue).

Jesper Jansson

Algorithms, 2025

Approximability of Longest Run Subsequence and Complementary Minimization Problems.

Yuichi Asahiro, Mingyang Gong, Jesper Jansson, Guohui Lin, Sichen Lu, Eiji Miyano, Hirotaka Ono, Toshiki Saitoh, Shunichi Tanaka

Proceedings of the 25th International Conference on Algorithms for Bioinformatics, 2025

Shortest Longest-Path Graph Orientations for Trees.

Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Multiplication of 0-1 Matrices via Clustering.

Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson

Proceedings of the Frontiers of Algorithmics - 19th International Joint Conference, 2025

2024

The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique.

Jesper Jansson, Christos Levcopoulos, Andrzej Lingas

CoRR, 2024

A Faster Algorithm for Constructing the Frequency Difference Consensus Tree.

Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee, Yutong Yang

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems.

Daniel J. Harvey, Jesper Jansson, Mikolaj Marciniak, Yukihiro Murakami

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique.

Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Quan Xue

Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

2023

Normalized L3-based link prediction in protein-protein interaction networks.

Ho Yin Yuen, Jesper Jansson

BMC Bioinform., December, 2023

Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue).

Jesper Jansson

Algorithms, April, 2023

Finding the Cyclic Covers of a String.

Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba

Proceedings of the WALCOM: Algorithms and Computation, 2023

MUL-Tree Pruning for Consistency and Compatibility.

Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Approximation Algorithms for the Longest Run Subsequence Problem.

Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Shortest Longest-Path Graph Orientations.

Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique.

Jesper Jansson, Christos Levcopoulos, Andrzej Lingas

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

Upper and lower degree-constrained graph orientation with minimum penalty.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Theor. Comput. Sci., 2022

Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases.

Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson

J. Comput. Syst. Sci., 2021

Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019).

Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos

J. Comput. Syst. Sci., 2021

Graph Orientation with Edge Modifications.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Int. J. Found. Comput. Sci., 2021

Efficient Assignment of Identities in Anonymous Populations.

Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Fast Algorithms for the Rooted Triplet Distance Between Caterpillars.

Jesper Jansson, Wing Lik Lee

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Online and Approximate Network Construction from Bounded Connectivity Constraints.

Jesper Jansson, Christos Levcopoulos, Andrzej Lingas

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Exact algorithms for the repetition-bounded longest common subsequence problem.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Theor. Comput. Sci., 2020

Better Link Prediction for Protein-Protein Interaction Networks.

Ho Yin Yuen, Jesper Jansson

Proceedings of the 20th IEEE International Conference on Bioinformatics and Bioengineering, 2020

2019

The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets.

Katharina Dannenberg, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell

Discret. Appl. Math., 2019

Editorial: Special Issue on Efficient Data Structures.

Jesper Jansson

Algorithms, 2019

Building a Small and Informative Phylogenetic Supertree.

Jesper Jansson, Konstantinos Mampentzidis, Sandhya T. P.

Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

Computing the Rooted Triplet Distance Between Phylogenetic Networks.

Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases.

Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Graph Orientation with Edge Modifications.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree.

Jesper Jansson, Ramesh Rajaby, Chuanqi Shen, Wing-Kin Sung

IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Graph Orientation with Splits.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

New and Improved Algorithms for Unordered Tree Inclusion.

Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

New Algorithms for Unordered Tree Inclusion.

Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura

CoRR, 2017

Determining the Consistency of Resolved Triplets and Fan Triplets.

Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung

Proceedings of the Research in Computational Molecular Biology, 2017

An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees.

Jesper Jansson, Ramesh Rajaby, Wing-Kin Sung

Proceedings of the Algorithms for Computational Biology, 2017

2016

Maximum Agreement Supertree.

Jesper Jansson, Wing-Kin Sung

Encyclopedia of Algorithms, 2016

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network.

Jesper Jansson, Wing-Kin Sung

Encyclopedia of Algorithms, 2016

Phylogenetic Tree Construction from a Distance Matrix.

Jesper Jansson

Encyclopedia of Algorithms, 2016

Perfect Phylogeny (Bounded Number of States).

Jesper Jansson

Encyclopedia of Algorithms, 2016

Directed Perfect Phylogeny (Binary Characters).

Jesper Jansson

Encyclopedia of Algorithms, 2016

Minimal Phylogenetic Supertrees and Local Consensus Trees.

Jesper Jansson, Wing-Kin Sung

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Similar subtree search using extended tree inclusion.

Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2015

Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.

Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung

Algorithmica, 2015

On Finding the Adams Consensus Tree.

Jesper Jansson, Zhaoxian Li, Wing-Kin Sung

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets.

Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

A More Practical Algorithm for the Rooted Triplet Distance.

Jesper Jansson, Ramesh Rajaby

Proceedings of the Algorithms for Computational Biology, 2015

2014

On the Parameterized Complexity of Associative and Commutative Unification.

Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Faster Algorithms for Computing the R* Consensus Tree.

Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

3D Rectangulations and Geometric Matrix Multiplication.

Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

Editorial: Special Issue on Graph Algorithms.

Jesper Jansson

Algorithms, 2013

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree.

Jesper Jansson, Chuanqi Shen, Wing-Kin Sung

Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

Improved Algorithms for Constructing Consensus Trees.

Jesper Jansson, Chuanqi Shen, Wing-Kin Sung

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

An Optimal Algorithm for Building the Majority Rule Consensus Tree.

Jesper Jansson, Chuanqi Shen, Wing-Kin Sung

Proceedings of the Research in Computational Molecular Biology, 2013

2012

Ultra-succinct representation of ordered trees with applications.

Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung

J. Comput. Syst. Sci., 2012

Polynomial-Time Algorithms for Building a Consensus MUL-Tree.

Yun Cui, Jesper Jansson, Wing-Kin Sung

J. Comput. Biol., 2012

Inferring a graph from path frequency.

Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane

Discret. Appl. Math., 2012

Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics.

Kun-Mao Chao, An-Chiang Chu, Jesper Jansson, Richard S. Lemence, Alban Mancheron

Proceedings of the Theory and Applications of Models of Computation, 2012

Graph Orientations Optimizing the Number of Light or Heavy Vertices.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

CRAM: Compressed Random Access Memory.

Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles.

Jesper Jansson, Andrzej Lingas

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

Fast Relative Lempel-Ziv Self-index for Similar Sequences.

Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets.

Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Flexible taxonomic assignment of ambiguous sequencing reads.

José Carlos Clemente, Jesper Jansson, Gabriel Valiente

BMC Bioinform., 2011

Algorithms for Building Consensus MUL-trees.

Yun Cui, Jesper Jansson, Wing-Kin Sung

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Compressed random access memory

Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung

CoRR, 2010

The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree.

Jesper Jansson, Richard S. Lemence, Andrzej Lingas

Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Accurate Taxonomic Assignment of Short Pyrosequencing Reads.

José Carlos Clemente, Jesper Jansson, Gabriel Valiente

Proceedings of the Biocomputing 2010: Proceedings of the Pacific Symposium, 2010

Constructing the R* Consensus Tree of Two Trees in Subcubic Time.

Jesper Jansson, Wing-Kin Sung

Proceedings of the Algorithms, 2010

Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks.

Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.

Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Linear-Time Protein 3-D Structure Searching with Insertions and Deletions.

Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane

Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

More Efficient Periodic Traversal in Anonymous Undirected Graphs.

Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung

Proceedings of the Structural Information and Communication Complexity, 2009

Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets.

Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Graph orientation to maximize the minimum weighted outdegree.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008

Phylogenetic Tree Construction from a Distance Matrix.

Jesper Jansson

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Perfect Phylogeny (Bounded Number of States).

Jesper Jansson

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Directed Perfect Phylogeny (Binary Characters).

Jesper Jansson

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

New Results on Optimizing Rooted Triplets Consistency.

Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Ultra-succinct representation of ordered trees.

Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.

Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Algorithms for Finding a Most Similar Subforest.

Jesper Jansson, Zeshan Peng

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

On the Approximability of Maximum and Minimum Edge Clique Partition Problems.

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson

Proceedings of the Theory of Computing 2006, 2006

2005

Computing the maximum agreement of phylogenetic networks.

Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung

Theor. Comput. Sci., 2005

Algorithms for combining rooted triplets into a galled phylogenetic network.

Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Finding Short Right-Hand-on-the-Wall Walks in Graphs.

Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung

Proceedings of the Structural Information and Communication Complexity, 2005

Constructing a Smallest Refining Galled Phylogenetic Network.

Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung

Proceedings of the Research in Computational Molecular Biology, 2005

Online and Dynamic Recognition of Squarefree Strings.

Jesper Jansson, Zeshan Peng

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.

Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Inferring phylogenetic relationships avoiding forbidden rooted triplets.

Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung

Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004

Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition.

Jesper Jansson, Takeshi Tokuyama

Graphs Comb., 2004

A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences Through Alignment.

Jesper Jansson, See-Kiong Ng, Wing-Kin Sung, Hugo Willy

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Rooted Maximum Agreement Supertrees.

Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

The Maximum Agreement of Two Nested Phylogenetic Networks.

Jesper Jansson, Wing-Kin Sung

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs.

Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets.

Jesper Jansson, Wing-Kin Sung

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Consensus Algorithms for Trees and Strings.

Jesper Jansson

PhD thesis, 2003

2001

On the Complexity of Inferring Rooted Evolutionary Trees.

Jesper Jansson

Electron. Notes Discret. Math., 2001

A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.

Jesper Jansson, Andrzej Lingas

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

Approximation Algorithms for Hamming Clustering Problems.

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999

On the Complexity of Constructing Evolutionary Trees.

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin

J. Comb. Optim., 1999

Efficient Approximation Algorithms for the Hamming Center Problem.

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Inferring Ordered Trees from Local Constraints.

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997

On the Complexity of Computing Evolutionary Trees.

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997