| 2026 | MFCS | Burning Graph Powers and Branching Trees. | Jesper Jansson, Shashanka Kulamarva, Yukihiro Murakami, Nikolaas Verhulst |
| 2025 | FAW | Multiplication of 0-1 Matrices via Clustering. | Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson |
| 2025 | SOFSEM | Shortest Longest-Path Graph Orientations for Trees. | Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov |
| 2025 | WABI | 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 |
| 2024 | COCOON | 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 |
| 2024 | IWOCA | Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems. | Daniel J. Harvey, Jesper Jansson, Mikolaj Marciniak, Yukihiro Murakami |
| 2024 | STACS | A Faster Algorithm for Constructing the Frequency Difference Consensus Tree. | Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee, Yutong Yang |
| 2023 | COCOON | Shortest Longest-Path Graph Orientations. | Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov |
| 2023 | CPM | Approximation Algorithms for the Longest Run Subsequence Problem. | Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka |
| 2023 | CPM | MUL-Tree Pruning for Consistency and Compatibility. | Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung |
| 2023 | WALCOM | Finding the Cyclic Covers of a String. | Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba |
| 2022 | CPM | Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. | Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima |
| 2021 | CIAC | Online and Approximate Network Construction from Bounded Connectivity Constraints. | Jesper Jansson, Christos Levcopoulos, Andrzej Lingas |
| 2021 | FCT | Fast Algorithms for the Rooted Triplet Distance Between Caterpillars. | Jesper Jansson, Wing Lik Lee |
| 2021 | OPODIS | Efficient Assignment of Identities in Anonymous Populations. | Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas |
| 2020 | BIBE | Better Link Prediction for Protein-Protein Interaction Networks. | Ho Yin Yuen, Jesper Jansson |
| 2019 | COCOA | Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. | Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima |
| 2019 | FAW | Graph Orientation with Edge Modifications. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P. |
| 2019 | FAW | Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. | Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson |
| 2019 | IWOCA | Computing the Rooted Triplet Distance Between Phylogenetic Networks. | Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung |
| 2019 | WABI | Building a Small and Informative Phylogenetic Supertree. | Jesper Jansson, Konstantinos Mampentzidis, Sandhya T. P. |
| 2018 | ISAAC | New and Improved Algorithms for Unordered Tree Inclusion. | Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura |
| 2017 | RECOMB | Determining the Consistency of Resolved Triplets and Fan Triplets. | Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung |
| 2016 | ICDE | Similar subtree search using extended tree inclusion. | Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu |
| 2016 | MFCS | Minimal Phylogenetic Supertrees and Local Consensus Trees. | Jesper Jansson, Wing-Kin Sung |
| 2015 | CPM | The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. | Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell |
| 2015 | STACS | On Finding the Adams Consensus Tree. | Jesper Jansson, Zhaoxian Li, Wing-Kin Sung |
| 2014 | ISAAC | 3D Rectangulations and Geometric Matrix Multiplication. | Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu |
| 2014 | ISAAC | Faster Algorithms for Computing the R* Consensus Tree. | Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu |
| 2013 | RECOMB | An Optimal Algorithm for Building the Majority Rule Consensus Tree. | Jesper Jansson, Chuanqi Shen, Wing-Kin Sung |
| 2013 | SODA | Improved Algorithms for Constructing Consensus Trees. | Jesper Jansson, Chuanqi Shen, Wing-Kin Sung |
| 2013 | WABI | Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. | Jesper Jansson, Chuanqi Shen, Wing-Kin Sung |
| 2013 | WAOA | Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
| 2012 | AAIM | Fast Relative Lempel-Ziv Self-index for Similar Sequences. | Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
| 2012 | CPM | Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. | Jesper Jansson, Andrzej Lingas |
| 2012 | ICALP | CRAM: Compressed Random Access Memory. | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
| 2012 | TAMC | 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 |
| 2011 | ISAAC | Algorithms for Building Consensus MUL-trees. | Yun Cui, Jesper Jansson, Wing-Kin Sung |
| 2010 | CPM | Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. | Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente |
| 2010 | ESA | Constructing the R* Consensus Tree of Two Trees in Subcubic Time. | Jesper Jansson, Wing-Kin Sung |
| 2010 | PSB | Accurate Taxonomic Assignment of Short Pyrosequencing Reads. | Jos Carlos Clemente, Jesper Jansson, Gabriel Valiente |
| 2010 | WABI | The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. | Jesper Jansson, Richard S. Lemence, Andrzej Lingas |
| 2009 | ISAAC | Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. | Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung |
| 2009 | SIROCCO | 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 |
| 2009 | WABI | Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. | Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane |
| 2009 | WADS | Approximation Algorithms for Buy-at-Bulk Geometric Network Design. | Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski |
| 2008 | ISAAC | New Results on Optimizing Rooted Triplets Consistency. | Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson |
| 2007 | AAIM | Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
| 2007 | SODA | Ultra-succinct representation of ordered trees. | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
| 2006 | CPM | Algorithms for Finding a Most Similar Subforest. | Jesper Jansson, Zeshan Peng |
| 2005 | APBC | Inferring phylogenetic relationships avoiding forbidden rooted triplets. | Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung |
| 2005 | MFCS | Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. | Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu |
| 2005 | MFCS | Online and Dynamic Recognition of Squarefree Strings. | Jesper Jansson, Zeshan Peng |
| 2005 | RECOMB | Constructing a Smallest Refining Galled Phylogenetic Network. | Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung |
| 2005 | SODA | Algorithms for combining rooted triplets into a galled phylogenetic network. | Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung |
| 2005 | SIROCCO | Finding Short Right-Hand-on-the-Wall Walks in Graphs. | Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
| 2004 | COCOON | Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. | Jesper Jansson, Wing-Kin Sung |
| 2004 | CPM | Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. | Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell |
| 2004 | ISAAC | Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. | Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung |
| 2004 | ISAAC | The Maximum Agreement of Two Nested Phylogenetic Networks. | Jesper Jansson, Wing-Kin Sung |
| 2004 | LATIN | Rooted Maximum Agreement Supertrees. | Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung |
| 2004 | WABI | 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 |
| 2001 | CPM | A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. | Jesper Jansson, Andrzej Lingas |
| 2000 | CPM | Approximation Algorithms for Hamming Clustering Problems. | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas |
| 1999 | SODA | Efficient Approximation Algorithms for the Hamming Center Problem. | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas |
| 1997 | COCOON | On the Complexity of Computing Evolutionary Trees. | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna stlin |