Mia Persson

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
\((\min ,+)\) matrix and vector products for inputs decomposable into few monotone subsequences	2024-08-22	Paper
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs Algorithms and Discrete Applied Mathematics	2023-05-08	Paper
Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases Journal of Computer and System Sciences	2021-03-10	Paper
Simple iterative heuristics for correlation clustering Large-Scale Scientific Computing	2020-08-25	Paper
Pushing the online matrix-vector conjecture off-line and identifying its easy cases	2019-10-11	Paper
Clearing directed subgraphs by mobile agents. Variations on covering with paths Journal of Computer and System Sciences	2019-05-03	Paper
Extreme witnesses and their applications Algorithmica	2018-10-18	Paper
The snow team problem (clearing directed subgraphs by mobile agents) (available as arXiv preprint)	2017-11-22	Paper
Bounds for semi-disjoint bilinear forms in a unit-cost computational model Lecture Notes in Computer Science	2017-05-19	Paper
Extreme witnesses and their applications Combinatorial Optimization and Applications	2016-02-05	Paper
A fast parallel algorithm for minimum-cost small integral flows Algorithmica	2015-07-10	Paper
Detecting monomials with \(k\) distinct variables Information Processing Letters	2014-12-09	Paper
Towards more efficient infection and fire fighting International Journal of Foundations of Computer Science	2013-07-30	Paper
Competitive online clique clustering Lecture Notes in Computer Science	2013-06-07	Paper
Competitive exploration of rectilinear polygons. Lecture Notes in Computer Science	2010-04-20	Paper
The Online Freeze-Tag Problem LATIN 2006: Theoretical Informatics	2008-09-18	Paper
Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α≤d Case) Combinatorial and Algorithmic Aspects of Networking	2008-04-17	Paper
ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS International Journal of Foundations of Computer Science	2007-04-25	Paper
Competitive exploration of rectilinear polygons Theoretical Computer Science	2006-04-28	Paper

Research outcomes over time

This page was built for person: Mia Persson