2 citations · 2 across the 9 of their papers we have counts for
9 papers
Fast approximate -center clustering in high dimensional spaces
Mirosław Kowaluk, Andrzej Lingas, Mia Persson
We study the design of efficient approximation algorithms for the -center clustering and minimum-diameter -clustering problems in high dimensional Euclidean and Hamming…
Approximate all-pairs Hamming distances and 0-1 matrix multiplication
Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
Arslan showed that computing all-pairs Hamming distances is easily reducible to arithmetic 0-1 matrix multiplication (IPL 2018). We provide a reverse, linear-time reduction of arit…
Multiplication of 0-1 matrices via clustering
Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas +1
We study applications of clustering (in particular, the -center clustering problem) in the design of efficient and practical algorithms for computing an approximate and the exac…
Breaking the hegemony of the triangle method in clique detection
Mirosław Kowaluk, Andrzej Lingas
We consider the fundamental problem of detecting/counting copies of a fixed pattern graph in a host graph. The recent progress on this problem has not included complete pattern gra…
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
Mirosław Kowaluk, Andrzej Lingas
The problem of finding maximum (or minimum) witnesses of the Boolean product of two Boolean matrices (MW for short) has a number of important applications, in particular the all-pa…
Multidimensional -skeletons in and metric
Mirosław Kowaluk, Gabriela Majewska
The -skeleton for a point set V is a family of geometric graphs, defined by the notion of neighborhoods parameterized by real number . By using the d…
Planar -skeletons via point location in monotone subdivisions of subset of lunes
Mirosław Kowaluk
We present a new algorithm for lune-based -skeletons for sets of points in the plane, for , the only case when optimal algorithms are not known. The running…
Generalized -skeletons
Mirosław Kowaluk, Gabriela Majewska
-skeletons, a prominent member of the neighborhood graph family, have interesting geometric properties and various applications ranging from geographic networks to archeology. T…
-skeletons for a set of line segments in
Mirosław Kowaluk, Gabriela Majewska
-skeletons are well-known neighborhood graphs for a set of points. We extend this notion to sets of line segments in the Euclidean plane and present algorithms computing such sk…