Mia Persson

ORCID

Publication Activity (10 Years)

Years Active: 2003-2023
Publications (10 Years): 14

Top Venues

CoRR

J. Comput. Syst. Sci.

Algorithmica

Int. J. Metaheuristics

Lund University, Sweden (PHD)

Education History

Lund University, Sweden

PHD

Publications

Andrzej Lingas, Mia Persson
Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits. CoRR (2023)
Andrzej Lingas, Mia Persson
(min, +) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. CoRR (2023)
Andrzej Lingas, Mia Persson
$(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. COCOON (2) (2023)
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs. CALDAM (2022)
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs. CoRR (2021)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. J. Comput. Syst. Sci. 118 (2021)
Andrzej Lingas, Mia Persson
) Mechanical Operations. Int. J. Unconv. Comput. 15 (3) (2020)
Andrzej Lingas, Mia Persson
Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation. CoRR (2020)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. FAW (2019)
Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski
Clearing directed subgraphs by mobile agents: Variations on covering with paths. J. Comput. Syst. Sci. 102 (2019)
Andrzej Lingas, Mia Persson
Extreme Witnesses and Their Applications. Algorithmica 80 (12) (2018)
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. TAMC (2017)
Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). FCT (2017)
Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents). CoRR (2017)
Andrzej Lingas, Mia Persson
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Algorithmica 72 (2) (2015)
Andrzej Lingas, Mia Persson
Extreme Witnesses and Their Applications. COCOA (2015)
Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu
Detecting monomials with k distinct variables. Inf. Process. Lett. 115 (2) (2015)
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
Iterative merging heuristics for correlation clustering. Int. J. Metaheuristics 3 (2) (2014)
Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu
Detecting Monomials with k Distinct Variables. Electron. Colloquium Comput. Complex. 20 (2013)
Peter Floderus, Andrzej Lingas, Mia Persson
Towards More Efficient Infection and Fire Fighting. Int. J. Found. Comput. Sci. 24 (1) (2013)
Aleksander Fabijan, Bengt J. Nilsson, Mia Persson
Competitive Online Clique Clustering. CIAC (2013)
Andrzej Lingas, Mia Persson
Simple Iterative Heuristics for Correlation Clustering. LSSC (2013)
Andrzej Lingas, Mia Persson
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Euro-Par (2012)
Andrzej Lingas, Mia Persson
A fast parallel algorithm for minimum-cost small integral flows CoRR (2012)
Peter Floderus, Andrzej Lingas, Mia Persson
Towards More Efficient Infection and Fire Fighting. CATS (2011)
Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson
Approximate clustering of incomplete fingerprints. J. Discrete Algorithms 6 (1) (2008)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. 18 (2) (2007)
Mikael Hammar, Bengt J. Nilsson, Mia Persson
Competitive exploration of rectilinear polygons. Theor. Comput. Sci. 354 (3) (2006)
Andrzej Lingas, Mia Persson, Martin Wahlen
Case). CAAN (2006)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS (2006)
Mikael Hammar, Bengt J. Nilsson, Mia Persson
The Online Freeze-Tag Problem. LATIN (2006)
Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson
Approximate Clustering of Fingerprint Vectors with Missing Values. CATS (2005)
Mikael Hammar, Bengt J. Nilsson, Mia Persson
Competitive Exploration of Rectilinear Polygons. FCT (2003)

Mia Persson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mia Persson