Jesper Jansson

163 papers A* 5A 3B 35C 15Misc 5Journal 75Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Finding the cyclic covers of a string. Inf. Process. Lett. Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba
2025	C	`conf`	Approximability of Longest Run Subsequence and Complementary Minimization Problems. WABI Yuichi Asahiro, Mingyang Gong, Jesper Jansson, Guohui Lin, Sichen Lu, Eiji Miyano, Hirotaka Ono, Toshiki Saitoh, Shunichi Tanaka
2025	J	`jnl`	Deterministic protocols for Voronoi diagrams and triangulations of planar point sets on the congested clique. Theor. Comput. Sci. Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Valentin Polishchuk, Quan Xue
2025	J	`jnl`	Editorial: Surveys in Algorithm Analysis and Complexity Theory, Part II (Special Issue). Algorithms Jesper Jansson
2025	J	`jnl`	Efficient assignment of identities in anonymous populations. Inf. Comput. Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2025	J	`jnl`	Graph-based method for constructing consensus trees. CoRR Elio Torquet, Jesper Jansson, Nadia Tahiri
2025	—	`conf`	Multiplication of 0-1 Matrices via Clustering. IJTCS-FAW Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2025	J	`jnl`	Multiplication of 0-1 matrices via clustering. CoRR Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2025	—	`conf`	Shortest Longest-Path Graph Orientations for Trees. SOFSEM (1) Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov
2024	A	`conf`	A Faster Algorithm for Constructing the Frequency Difference Consensus Tree. STACS Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee, Yutong Yang
2024	J	`jnl`	Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discret. Appl. Math. Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2024	C	`conf`	Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems. IWOCA Daniel J. Harvey, Jesper Jansson, Mikolaj Marciniak, Yukihiro Murakami
2024	—	`conf`	The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. COCOON (2) Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Quan Xue
2024	J	`jnl`	The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. CoRR Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023	B	`conf`	Approximation Algorithms for the Longest Run Subsequence Problem. CPM Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
2023	J	`jnl`	Building a small and informative phylogenetic supertree. Inf. Comput. Jesper Jansson, Konstantinos Mampentzidis, T. P. Sandhya
2023	—	`conf`	Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CCCG Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023	J	`jnl`	Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CoRR Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023	J	`jnl`	Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue). Algorithms Jesper Jansson
2023	B	`conf`	Finding the Cyclic Covers of a String. WALCOM Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba
2023	B	`conf`	MUL-Tree Pruning for Consistency and Compatibility. CPM Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung
2023	J	`jnl`	Normalized L3-based link prediction in protein-protein interaction networks. BMC Bioinform. Ho Yin Yuen, Jesper Jansson
2023	J	`jnl`	Online and Approximate Network Construction from Bounded Connectivity Constraints. Int. J. Found. Comput. Sci. Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023	—	`conf`	Shortest Longest-Path Graph Orientations. COCOON (1) Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov
2022	B	`conf`	Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2022	J	`jnl`	Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2021	J	`jnl`	Computing the Rooted Triplet Distance Between Phylogenetic Networks. Algorithmica Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung
2021	B	`conf`	Efficient Assignment of Identities in Anonymous Populations. OPODIS Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2021	J	`jnl`	Efficient Assignment of Identities in Anonymous Populations. CoRR Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2021	B	`conf`	Fast Algorithms for the Rooted Triplet Distance Between Caterpillars. FCT Jesper Jansson, Wing Lik Lee
2021	J	`jnl`	Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019). J. Comput. Syst. Sci. Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos
2021	J	`jnl`	Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2021	J	`jnl`	New and improved algorithms for unordered tree inclusion. Theor. Comput. Sci. Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura
2021	C	`conf`	Online and Approximate Network Construction from Bounded Connectivity Constraints. CIAC Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2021	J	`jnl`	Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. J. Comput. Syst. Sci. Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
2020	C	`conf`	Better Link Prediction for Protein-Protein Interaction Networks. BIBE Ho Yin Yuen, Jesper Jansson
2020	J	`jnl`	Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2020	J	`jnl`	Graph orientation with splits. Theor. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
2019	J	`jnl`	An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees. J. Comput. Biol. Jesper Jansson, Ramesh Rajaby, Wing-Kin Sung
2019	C	`conf`	Building a Small and Informative Phylogenetic Supertree. WABI Jesper Jansson, Konstantinos Mampentzidis, Sandhya T. P.
2019	C	`conf`	Computing the Rooted Triplet Distance Between Phylogenetic Networks. IWOCA Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung
2019	J	`jnl`	Editorial: Special Issue on Efficient Data Structures. Algorithms Jesper Jansson
2019	C	`conf`	Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2019	B	`ed.`	Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings FCT Leszek Antoni Gasieniec, Jesper Jansson, Christos Levcopoulos
2019	Misc	`conf`	Graph Orientation with Edge Modifications. FAW Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.
2019	Misc	`conf`	Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. FAW Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
2019	J	`jnl`	The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. Discret. Appl. Math. Katharina Dannenberg, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
2018	J	`jnl`	3D Rectangulations and Geometric Matrix Multiplication. Algorithmica Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
2018	—	`ed.`	Algorithms for Computational Biology - 5th International Conference, AlCoB 2018, Hong Kong, China, June 25-26, 2018, Proceedings AlCoB Jesper Jansson, Carlos Martín-Vide, Miguel A. Vega-Rodríguez
2018	J	`jnl`	Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. IEEE ACM Trans. Comput. Biol. Bioinform. Jesper Jansson, Ramesh Rajaby, Chuanqi Shen, Wing-Kin Sung
2018	J	`jnl`	Determining the Consistency of Resolved Triplets and Fan Triplets. J. Comput. Biol. Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung
2018	C	`conf`	Graph Orientation with Splits. ISCO Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
2018	B	`conf`	New and Improved Algorithms for Unordered Tree Inclusion. ISAAC Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura
2017	J	`jnl`	A More Practical Algorithm for the Rooted Triplet Distance. J. Comput. Biol. Jesper Jansson, Ramesh Rajaby
2017	—	`conf`	An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees. AlCoB Jesper Jansson, Ramesh Rajaby, Wing-Kin Sung
2017	B	`conf`	Determining the Consistency of Resolved Triplets and Fan Triplets. RECOMB Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung
2017	J	`jnl`	New Algorithms for Unordered Tree Inclusion. CoRR Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura
2017	J	`jnl`	On finding the Adams consensus tree. Inf. Comput. Jesper Jansson, Zhaoxian Li, Wing-Kin Sung
2017	J	`jnl`	On the parameterized complexity of associative and commutative unification. Theor. Comput. Sci. Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura
2016	—	`ch.`	Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. Encyclopedia of Algorithms Jesper Jansson, Wing-Kin Sung
2016	J	`jnl`	Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2016	—	`ch.`	Directed Perfect Phylogeny (Binary Characters). Encyclopedia of Algorithms Jesper Jansson
2016	J	`jnl`	Faster Algorithms for Computing the R* Consensus Tree. Algorithmica Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu
2016	J	`jnl`	Improved Algorithms for Constructing Consensus Trees. J. ACM Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
2016	—	`ch.`	Maximum Agreement Supertree. Encyclopedia of Algorithms Jesper Jansson, Wing-Kin Sung
2016	B	`conf`	Minimal Phylogenetic Supertrees and Local Consensus Trees. MFCS Jesper Jansson, Wing-Kin Sung
2016	—	`ch.`	Perfect Phylogeny (Bounded Number of States). Encyclopedia of Algorithms Jesper Jansson
2016	—	`ch.`	Phylogenetic Tree Construction from a Distance Matrix. Encyclopedia of Algorithms Jesper Jansson
2016	A*	`conf`	Similar subtree search using extended tree inclusion. ICDE Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu
2015	—	`conf`	A More Practical Algorithm for the Rooted Triplet Distance. AlCoB Jesper Jansson, Ramesh Rajaby
2015	J	`jnl`	Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2015	J	`jnl`	Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Algorithmica Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2015	A	`conf`	On Finding the Adams Consensus Tree. STACS Jesper Jansson, Zhaoxian Li, Wing-Kin Sung
2015	J	`jnl`	Similar Subtree Search Using Extended Tree Inclusion. IEEE Trans. Knowl. Data Eng. Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu
2015	B	`conf`	The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. CPM Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
2014	B	`conf`	3D Rectangulations and Geometric Matrix Multiplication. ISAAC Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
2014	J	`jnl`	Computing the rooted triplet distance between galled trees by counting triangles. J. Discrete Algorithms Jesper Jansson, Andrzej Lingas
2014	J	`jnl`	Fast relative Lempel-Ziv self-index for similar sequences. Theor. Comput. Sci. Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2014	B	`conf`	Faster Algorithms for Computing the R* Consensus Tree. ISAAC Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu
2014	B	`conf`	On the Parameterized Complexity of Associative and Commutative Unification. IPEC Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura
2013	C	`conf`	Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. WABI Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
2013	J	`jnl`	Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. CoRR Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
2013	B	`conf`	An Optimal Algorithm for Building the Majority Rule Consensus Tree. RECOMB Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
2013	J	`jnl`	Constructing the R* Consensus Tree of Two Trees in Subcubic Time. Algorithmica Jesper Jansson, Wing-Kin Sung
2013	B	`conf`	Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2013	J	`jnl`	Editorial: Special Issue on Graph Algorithms. Algorithms Jesper Jansson
2013	A*	`conf`	Improved Algorithms for Constructing Consensus Trees. SODA Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
2012	C	`conf`	Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics. TAMC Kun-Mao Chao, An-Chiang Chu, Jesper Jansson, Richard S. Lemence, Alban Mancheron
2012	—	`conf`	CRAM: Compressed Random Access Memory. ICALP (1) Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2012	B	`conf`	Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. CPM Jesper Jansson, Andrzej Lingas
2012	—	`conf`	Fast Relative Lempel-Ziv Self-index for Similar Sequences. FAW-AAIM Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2012	J	`jnl`	Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
2012	C	`conf`	Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2012	J	`jnl`	Inferring a graph from path frequency. Discret. Appl. Math. Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane
2012	J	`jnl`	More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung
2012	J	`jnl`	Polynomial-Time Algorithms for Building a Consensus MUL-Tree. J. Comput. Biol. Yun Cui, Jesper Jansson, Wing-Kin Sung
2012	J	`jnl`	The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. SIAM J. Comput. Jesper Jansson, Richard S. Lemence, Andrzej Lingas
2012	J	`jnl`	Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2012	—	`conf`	Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2011	B	`conf`	Algorithms for Building Consensus MUL-trees. ISAAC Yun Cui, Jesper Jansson, Wing-Kin Sung
2011	J	`jnl`	Algorithms for Finding a Most Similar Subforest. Theory Comput. Syst. Jesper Jansson, Zeshan Peng
2011	J	`jnl`	Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
2011	J	`jnl`	Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
2011	J	`jnl`	Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets. IEEE ACM Trans. Comput. Biol. Bioinform. Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
2011	J	`jnl`	Flexible taxonomic assignment of ambiguous sequencing reads. BMC Bioinform. José Carlos Clemente, Jesper Jansson, Gabriel Valiente
2011	J	`jnl`	Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2010	Misc	`conf`	Accurate Taxonomic Assignment of Short Pyrosequencing Reads. Pacific Symposium on Biocomputing José Carlos Clemente, Jesper Jansson, Gabriel Valiente
2010	J	`jnl`	Compressed random access memory CoRR Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2010	—	`conf`	Constructing the R* Consensus Tree of Two Trees in Subcubic Time. ESA (1) Jesper Jansson, Wing-Kin Sung
2010	B	`conf`	Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
2010	J	`jnl`	Linear-time protein 3-D structure searching with insertions and deletions. Algorithms Mol. Biol. Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
2010	J	`jnl`	New results on optimizing rooted triplets consistency. Discret. Appl. Math. Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
2010	C	`conf`	The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. WABI Jesper Jansson, Richard S. Lemence, Andrzej Lingas
2009	B	`conf`	Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
2009	B	`conf`	Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. ISAAC Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
2009	A	`conf`	Graph orientation to maximize the minimum weighted outdegree. IPDPS Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2009	C	`conf`	Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. WABI Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
2009	B	`conf`	More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
2009	J	`jnl`	More efficient periodic traversal in anonymous undirected graphs CoRR Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
2008	—	`ch.`	Directed Perfect Phylogeny (Binary Characters). Encyclopedia of Algorithms Jesper Jansson
2008	B	`conf`	New Results on Optimizing Rooted Triplets Consistency. ISAAC Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
2008	—	`ch.`	Perfect Phylogeny (Bounded Number of States). Encyclopedia of Algorithms Jesper Jansson
2008	—	`ch.`	Phylogenetic Tree Construction from a Distance Matrix. Encyclopedia of Algorithms Jesper Jansson
2007	C	`conf`	Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
2007	—	`conf`	Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. FSTTCS Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2007	J	`jnl`	On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
2007	J	`jnl`	Online and Dynamic Recognition of Squarefree Strings. Int. J. Found. Comput. Sci. Jesper Jansson, Zeshan Peng
2007	J	`jnl`	Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
2007	A*	`conf`	Ultra-succinct representation of ordered trees. SODA Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2006	J	`jnl`	A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment. Algorithmica Jesper Jansson, See-Kiong Ng, Wing-Kin Sung, Hugo Willy
2006	J	`jnl`	Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. SIAM J. Comput. Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung
2006	B	`conf`	Algorithms for Finding a Most Similar Subforest. CPM Jesper Jansson, Zeshan Peng
2006	J	`jnl`	Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets. J. Bioinform. Comput. Biol. Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung
2006	J	`jnl`	Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theor. Comput. Sci. Jesper Jansson, Wing-Kin Sung
2006	J	`jnl`	Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. J. Comput. Biol. Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
2006	—	`conf`	On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
2006	J	`jnl`	Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. J. Bioinform. Comput. Biol. Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu
2005	A*	`conf`	Algorithms for combining rooted triplets into a galled phylogenetic network. SODA Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung
2005	J	`jnl`	Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2005	B	`conf`	Constructing a Smallest Refining Galled Phylogenetic Network. RECOMB Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung
2005	B	`conf`	Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2005	B	`conf`	Inferring phylogenetic relationships avoiding forbidden rooted triplets. APBC Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung
2005	B	`conf`	Online and Dynamic Recognition of Squarefree Strings. MFCS Jesper Jansson, Zeshan Peng
2005	B	`conf`	Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. MFCS Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu
2005	J	`jnl`	Rooted Maximum Agreement Supertrees. Algorithmica Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung
2004	C	`conf`	A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences Through Alignment. WABI Jesper Jansson, See-Kiong Ng, Wing-Kin Sung, Hugo Willy
2004	J	`jnl`	Approximation algorithms for Hamming clustering problems. J. Discrete Algorithms Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
2004	—	`conf`	Computing the Maximum Agreement of Phylogenetic Networks. CATS Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2004	Misc	`conf`	Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. COCOON Jesper Jansson, Wing-Kin Sung
2004	B	`conf`	Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. ISAAC Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
2004	B	`conf`	Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
2004	B	`conf`	Rooted Maximum Agreement Supertrees. LATIN Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung
2004	J	`jnl`	Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition. Graphs Comb. Jesper Jansson, Takeshi Tokuyama
2004	B	`conf`	The Maximum Agreement of Two Nested Phylogenetic Networks. ISAAC Jesper Jansson, Wing-Kin Sung
2003	J	`jnl`	A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. Fundam. Informaticae Jesper Jansson, Andrzej Lingas
2003	—	`—`	Consensus Algorithms for Trees and Strings. Jesper Jansson
2001	B	`conf`	A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. CPM Jesper Jansson, Andrzej Lingas
2001	J	`jnl`	On the Complexity of Inferring Rooted Evolutionary Trees. Electron. Notes Discret. Math. Jesper Jansson
2000	B	`conf`	Approximation Algorithms for Hamming Clustering Problems. CPM Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
1999	A*	`conf`	Efficient Approximation Algorithms for the Hamming Center Problem. SODA Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
1999	J	`jnl`	On the Complexity of Constructing Evolutionary Trees. J. Comb. Optim. Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
1998	—	`conf`	Inferring Ordered Trees from Local Constraints. CATS Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
1997	Misc	`conf`	On the Complexity of Computing Evolutionary Trees. COCOON Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin