Explanipedia

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

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

We study the problems of computing the Voronoi diagram and a triangulation of a set of n2 points with O(log⁡n)-bit coordinates in the Euclidean plane in a substantially sublinear in n number of rounds in the congested clique model with n n…

Finding the cyclic covers of a string Open

Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing‐Kin Sung , et al. · 2025

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

Jesper Jansson · 2025

This is the second Special Issue of surveys published by the MDPI journal Algorithms [...]

Efficient assignment of identities in anonymous populations Open

Leszek Gąsieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas · 2025

We consider the fundamental problem of assigning distinct labels to agents in theprobabilistic model of population protocols. Our protocols operate under the assumptionthat the size n of the population is embedded in the transition functio…

Graph-based method for constructing consensus trees Open

Elio Torquet, Jesper Jansson, Nadia Tahiri · 2025

A consensus tree is a phylogenetic tree that synthesizes a given collection of phylogenetic trees, all of which share the same leaf labels but may have different topologies, typically obtained through bootstrapping. Our research focuses on…

Resolving Unresolved Resolved and Unresolved Triplets Consistencyproblems Open

Mikołaj Marciniak, Daniel J. Harvey, Jesper Jansson, Yukihiro Murakami · 2025

Polynomial-time equivalences and refined algorithms for longest common subsequence variants Open

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono , et al. · 2024

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

Jesper Jansson, Christos Levcopoulos, Andrzej Lingas · 2024

We study the problem of computing the Voronoi diagram of a set of $n^2$ points with $O(\log n)$-bit coordinates in the Euclidean plane in a substantially sublinear in $n$ number of rounds in the congested clique model with $n$ nodes. Recen…

Efficient Assignment of Identities in Anonymous Populations Open

Leszek Gąsieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas · 2024

Building a small and informative phylogenetic supertree Open

Jesper Jansson, Konstantinos Mampentzidis, T. P. Sandhya · 2023

Convex Hulls, Triangulations, and Voronoi Diagrams of Planar Point Sets on the Congested Clique Open

Jesper Jansson, Christos Levcopoulos, Andrzej Lingas · 2023

We consider geometric problems on planar $n^2$-point sets in the congested clique model. Initially, each node in the $n$-clique network holds a batch of $n$ distinct points in the Euclidean plane given by $O(\log n)$-bit coordinates. In ea…

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

Jesper Jansson · 2023

This is a Special Issue of the open-access journal Algorithms consisting of surveys in theoretical computer science [...]

Normalized L3-based link prediction in protein–protein interaction networks Open

Ho Yin Yuen, Jesper Jansson · 2023

Convex Hulls, Triangulations, and Voronoi Diagrams of Planar Point Sets on the Congested Clique Open

Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Valentin Polishchuk · 2023

Initiating a Smart Tourism Ecosystem: A Public Actor Perspective Open

Jesper Jansson, Oscar Johansson, Maryam Roshan · 2022

Smart tourism ecosystems are an emerging phenomenon; however, how these ecosystems are initiated by city actors is under-explored in the existing literature. In this paper, we conduct a qualitative case study to investigate the initiation …

Efficient Assignment of Identities in Anonymous Populations Open

Leszek Gąsieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas · 2022

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

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono · 2021

Better Network Modeling For Link Prediction In Protein-Protein Interaction Networks Open

Ho Yin Yuen, Jesper Jansson · 2021

Background: Protein-protein interaction (PPI) data is an important type of data used in functional genomics. However, inaccuracies in high-throughput experiments often result in incomplete PPI data. Computational techniques are thus used t…

Efficient Assignment of Identities in Anonymous Populations Open

Leszek Gąsieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas · 2021

We consider the fundamental problem of assigning distinct labels to agents in the probabilistic model of population protocols. Our protocols operate under the assumption that the size $n$ of the population is embedded in the transition fun…

Computing the Rooted Triplet Distance Between Phylogenetic Networks Open

Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing‐Kin Sung · 2021

Author Index Open

Abdali Mohammadi, Abe Hiroki, Abe Kuniya, Abeyrathna Dilanga, Oscar Acosta , et al. · 2020

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

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono , et al. · 2020

Graph orientation with splits Open

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

Editorial: Special Issue on Efficient Data Structures Open

Jesper Jansson · 2019

This Special Issue of Algorithms is focused on the design, formal analysis, implementation, and experimental evaluation of efficient data structures for various computational problems.

Building a Small and Informative Phylogenetic Supertree Open

Jesper Jansson, Konstantinos Mampentzidis, T. P. Sandhya · 2019

We combine two fundamental, previously studied optimization problems related to the construction of phylogenetic trees called maximum rooted triplets consistency (MAXRTC) and minimally resolved supertree (MINRS) into a new problem, which w…

Determining the minimum number of protein-protein interactions required to support known protein complexes Open

Natsu Nakajima, Morihiro Hayashida, Jesper Jansson, Osamu Maruyama, Tatsuya Akutsu · 2018

The prediction of protein complexes from protein-protein interactions (PPIs) is a well-studied problem in bioinformatics. However, the currently available PPI data is not enough to describe all known protein complexes. In this paper, we ex…

New and Improved Algorithms for Unordered Tree Inclusion Open

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

The tree inclusion problem is, given two node-labeled trees P and T (the "pattern tree" and the "text tree"), to locate every minimal subtree in T (if any) that can be obtained by applying a sequence of node insertion operations to P. Alth…

Rotationssystem till väggfixtur Open

Anton Gille, Jesper Jansson · 2018

This bachelor thesis deals with the development process for a design proposal on a rotation system. The work was performed on behalf of Husmuttern AB, whom needs a rotation system to rotate wall fixtures in the company´s future modular hou…

Minimal Phylogenetic Supertrees and Local Consensus Trees Open

Jesper Jansson, Ramesh Rajaby, Wing‐Kin Sung · 2018

The problem of constructing a minimally resolved phylogenetic supertree (i.e., a rootedtree having the smallest possible number of internal nodes) that contains all of the rooted triplets froma consistent set R is known t…

New Algorithms for Unordered Tree Inclusion. Open

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

The inclusion problem is, given two node-labeled trees $P$ and $T$ (the tree and the tree), to locate every minimal subtree in $T$ (if any) that can be obtained by applying a sequence of node insertion operations to $P$. The ordered in…

Jesper Jansson YOU? Author Swipe