Mia Persson

42 papers B 3C 3Misc 1Journal 24Unranked 10
YearRankTypeTitle / Venue / Authors
2026 — conf
Approximate All-Pairs Hamming Distances and 0-1 Matrix Multiplication.
ICAA
Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2026 J jnl
Fast Approximate ℓ-Center Clustering in High-Dimensional Spaces.
Algorithms
Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2026 J jnl
Two algorithms for shortest-paths problems in edge-weighted directed graphs.
Theor. Comput. Sci.
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2025 J jnl
(min⁡,+) matrix and vector products for inputs decomposable into few monotone subsequences.
Theor. Comput. Sci.
Andrzej Lingas, Mia Persson
2025 J jnl
Approximate all-pairs Hamming distances and 0-1 matrix multiplication.
CoRR
Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2025 J jnl
Fast approximate ℓ-center clustering in high dimensional spaces.
CoRR
Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
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
2023 — conf
$(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences.
COCOON (2)
Andrzej Lingas, Mia Persson
2023 J jnl
(min, +) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences.
CoRR
Andrzej Lingas, Mia Persson
2023 J jnl
Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits.
CoRR
Andrzej Lingas, Mia Persson
2022 — conf
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs.
CALDAM
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2021 J jnl
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs.
CoRR
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
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 J jnl
Computing the Boolean Product of Two
Int. J. Unconv. Comput.
Andrzej Lingas, Mia Persson
2020 J jnl
Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation.
CoRR
Andrzej Lingas, Mia Persson
2019 J jnl
Clearing directed subgraphs by mobile agents: Variations on covering with paths.
J. Comput. Syst. Sci.
Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski
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
2018 J jnl
Extreme Witnesses and Their Applications.
Algorithmica
Andrzej Lingas, Mia Persson
2017 C conf
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model.
TAMC
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2017 J jnl
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents).
CoRR
Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski
2017 B conf
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents).
FCT
Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski
2015 J jnl
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows.
Algorithmica
Andrzej Lingas, Mia Persson
2015 J jnl
Detecting monomials with k distinct variables.
Inf. Process. Lett.
Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2015 C conf
Extreme Witnesses and Their Applications.
COCOA
Andrzej Lingas, Mia Persson
2014 J jnl
Iterative merging heuristics for correlation clustering.
Int. J. Metaheuristics
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2013 C conf
Competitive Online Clique Clustering.
CIAC
Aleksander Fabijan, Bengt J. Nilsson, Mia Persson
2013 J jnl
Detecting Monomials with k Distinct Variables.
Electron. Colloquium Comput. Complex.
Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2013 — conf
Simple Iterative Heuristics for Correlation Clustering.
LSSC
Andrzej Lingas, Mia Persson
2013 J jnl
Towards More Efficient Infection and Fire Fighting.
Int. J. Found. Comput. Sci.
Peter Floderus, Andrzej Lingas, Mia Persson
2012 — conf
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows.
Euro-Par
Andrzej Lingas, Mia Persson
2012 J jnl
A fast parallel algorithm for minimum-cost small integral flows
CoRR
Andrzej Lingas, Mia Persson
2011 — conf
Towards More Efficient Infection and Fire Fighting.
CATS
Peter Floderus, Andrzej Lingas, Mia Persson
2008 J jnl
Approximate clustering of incomplete fingerprints.
J. Discrete Algorithms
Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson
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
2006 — —
Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry.
Mia Persson
2006 J jnl
Competitive exploration of rectilinear polygons.
Theor. Comput. Sci.
Mikael Hammar, Bengt J. Nilsson, Mia Persson
2006 — conf
Minimum-Energy Broadcasting in Wireless Networks in the
CAAN
Andrzej Lingas, Mia Persson, Martin Wahlen
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 B conf
The Online Freeze-Tag Problem.
LATIN
Mikael Hammar, Bengt J. Nilsson, Mia Persson
2005 — conf
Approximate Clustering of Fingerprint Vectors with Missing Values.
CATS
Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson
2003 B conf
Competitive Exploration of Rectilinear Polygons.
FCT
Mikael Hammar, Bengt J. Nilsson, Mia Persson