default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMia Persson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c15]Andrzej Lingas, Mia Persson:
$(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. COCOON (2) 2023: 55-68- [i7]Andrzej Lingas, Mia Persson:
Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits. CoRR abs/2305.07364 (2023) - [i6]Andrzej Lingas, Mia Persson:
(min, +) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. CoRR abs/2309.01136 (2023) - 2022
- [c14]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs. CALDAM 2022: 140-151 - 2021
- [j11]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: 108-118 (2021) - [i5]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs. CoRR abs/2108.03455 (2021) - 2020
- [j10]Andrzej Lingas, Mia Persson:
Computing the Boolean Product of Two n × n Boolean Matrices Using O(n2) Mechanical Operations. Int. J. Unconv. Comput. 15(3): 225-236 (2020) - [i4]Andrzej Lingas, Mia Persson:
Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation. CoRR abs/2004.13086 (2020)
2010 – 2019
- 2019
- [j9]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: 57-68 (2019) - [c13]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: 156-169 - 2018
- [j8]Andrzej Lingas, Mia Persson:
Extreme Witnesses and Their Applications. Algorithmica 80(12): 3943-3957 (2018) - 2017
- [c12]Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski:
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). FCT 2017: 190-203 - [c11]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. TAMC 2017: 412-424 - [i3]Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski:
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents). CoRR abs/1712.00316 (2017) - 2015
- [j7]Andrzej Lingas, Mia Persson:
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Algorithmica 72(2): 607-619 (2015) - [j6]Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Detecting monomials with k distinct variables. Inf. Process. Lett. 115(2): 82-86 (2015) - [c10]Andrzej Lingas, Mia Persson:
Extreme Witnesses and Their Applications. COCOA 2015: 452-466 - 2014
- [j5]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Iterative merging heuristics for correlation clustering. Int. J. Metaheuristics 3(2): 105-117 (2014) - 2013
- [j4]Peter Floderus, Andrzej Lingas, Mia Persson:
Towards More Efficient Infection and Fire Fighting. Int. J. Found. Comput. Sci. 24(1): 3-14 (2013) - [c9]Aleksander Fabijan, Bengt J. Nilsson, Mia Persson:
Competitive Online Clique Clustering. CIAC 2013: 221-233 - [c8]Andrzej Lingas, Mia Persson:
Simple Iterative Heuristics for Correlation Clustering. LSSC 2013: 264-271 - [i2]Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Detecting Monomials with k Distinct Variables. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c7]Andrzej Lingas, Mia Persson:
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Euro-Par 2012: 688-699 - [i1]Andrzej Lingas, Mia Persson:
A fast parallel algorithm for minimum-cost small integral flows. CoRR abs/1210.0340 (2012) - 2011
- [c6]Peter Floderus, Andrzej Lingas, Mia Persson:
Towards More Efficient Infection and Fire Fighting. CATS 2011: 69-74
2000 – 2009
- 2008
- [j3]Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson:
Approximate clustering of incomplete fingerprints. J. Discrete Algorithms 6(1): 103-108 (2008) - 2007
- [j2]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): 217-226 (2007) - 2006
- [b1]Mia Persson:
Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry. Lund University, Sweden, 2006 - [j1]Mikael Hammar, Bengt J. Nilsson, Mia Persson:
Competitive exploration of rectilinear polygons. Theor. Comput. Sci. 354(3): 367-378 (2006) - [c5]Andrzej Lingas, Mia Persson, Martin Wahlen:
Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The alpha<=d Case). CAAN 2006: 112-124 - [c4]Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS 2006: 101-105 - [c3]Mikael Hammar, Bengt J. Nilsson, Mia Persson:
The Online Freeze-Tag Problem. LATIN 2006: 569-579 - 2005
- [c2]Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson:
Approximate Clustering of Fingerprint Vectors with Missing Values. CATS 2005: 57-60 - 2003
- [c1]Mikael Hammar, Bengt J. Nilsson, Mia Persson:
Competitive Exploration of Rectilinear Polygons. FCT 2003: 234-245
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
