Approximate Clustering of Fingerprint Vectors with Missing Values. - Andres Figueroa; Avraham Goldstein; Tao Jiang 001; Maciej Kurowski; Andrzej Lingas; Mia Persson (CATS, 2005)

Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The alpha<=d Case). - Andrzej Lingas; Mia Persson; Martin Wahlen (CAAN, 2006)

The Online Freeze-Tag Problem. - Mikael Hammar; Bengt J. Nilsson; Mia Persson (LATIN, 2006)

Competitive exploration of rectilinear polygons. - Mikael Hammar; Bengt J. Nilsson; Mia Persson (Theor. Comput. Sci., 2006)

Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry. - Mia Persson (2006)

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)

Approximate clustering of incomplete fingerprints. - Andres Figueroa; Avraham Goldstein; Tao Jiang 001; Maciej Kurowski; Andrzej Lingas; Mia Persson (J. Discrete Algorithms, 2008)

Competitive Online Clique Clustering. - Aleksander Fabijan; Bengt J. Nilsson; Mia Persson (CIAC, 2013)

Simple Iterative Heuristics for Correlation Clustering. - Andrzej Lingas; Mia Persson (LSSC, 2013)

Towards More Efficient Infection and Fire Fighting. - Peter Floderus; Andrzej Lingas; Mia Persson (Int. J. Found. Comput. Sci., 2013)

Iterative merging heuristics for correlation clustering. - Andrzej Lingas; Mia Persson; Dzmitry Sledneu (Int. J. Metaheuristics, 2014)

A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. - Andrzej Lingas; Mia Persson (Algorithmica, 2015)

Detecting monomials with k distinct variables. - Peter Floderus; Andrzej Lingas; Mia Persson; Dzmitry Sledneu (Inf. Process. Lett., 2015)

The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). - Dariusz Dereniowski; Andrzej Lingas; Mia Persson; Dorota Urbanska; Pawel Zylinski (FCT, 2017)

Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. - Andrzej Lingas; Mia Persson; Dzmitry Sledneu (TAMC, 2017)

Extreme Witnesses and Their Applications. - Andrzej Lingas; Mia Persson (Algorithmica, 2018)

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)

Clearing directed subgraphs by mobile agents: Variations on covering with paths. - Dariusz Dereniowski; Andrzej Lingas; Dorota Osula; Mia Persson; Pawel Zylinski (J. Comput. Syst. Sci., 2019)

Computing the Boolean product of two n times n Boolean matrices using O(n^2) mechanical operation. - Andrzej Lingas; Mia Persson (CoRR, 2020)

Computing the Boolean Product of Two n × n Boolean Matrices Using O(n2) Mechanical Operations. - Andrzej Lingas; Mia Persson (Int. J. Unconv. Comput., 2020)

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)

An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs. - Andrzej Lingas; Mia Persson; Dzmitry Sledneu (CALDAM, 2022)

Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits. - Andrzej Lingas; Mia Persson (CoRR, 2023)

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

(min⁡,+) matrix and vector products for inputs decomposable into few monotone subsequences. - Andrzej Lingas; Mia Persson (Theor. Comput. Sci., 2025)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication. - Miroslaw Kowaluk; Andrzej Lingas; Mia Persson (CoRR, 2025)