A Note on Relative Neighborhood Graphs. - Jerzy W. Jaromczyk; Miroslaw Kowaluk (SCG, 1987)

Skewed Projections with an Application to Line Stabbing in R3. - Jerzy W. Jaromczyk; Miroslaw Kowaluk (SCG, 1988)

Vector Language: Simple Description of Hard Instances (Extended Abstract). - Miroslaw Kowaluk; Klaus W. Wagner (MFCS, 1990)

Constructing the relative neighborhood graph in 3-dimensional Euclidean space. - Jerzy W. Jaromczyk; Miroslaw Kowaluk (Discret. Appl. Math., 1991)

An Efficient Algorithm for the Euclidean Two-Center Problem. - Jerzy W. Jaromczyk; Miroslaw Kowaluk (SCG, 1994)

A geometric proof of the combinatorial bounds the number of optimal solutions for the 2-center euclidean problem. - Jerzy W. Jaromczyk; Miroslaw Kowaluk (CCCG, 1995)

The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure. - Jerzy W. Jaromczyk; Miroslaw Kowaluk (WADS, 1995)

O(log log n)-Time Integer Geometry on the CRCW PRAM. - Bogdan S. Chlebus; Krzysztof Diks; Miroslaw Kowaluk (Algorithmica, 1995)

Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. - Faith E. Fich; Miroslaw Kowaluk; Miroslaw Kutylowski; Krzysztof Lorys; Prabhakar Ragde (Comput. Complex., 1995)

Parallel Alternating-Direction Access Machine. - Bogdan S. Chlebus; Artur Czumaj; Leszek Gasieniec; Miroslaw Kowaluk; Wojciech Plandowski (MFCS, 1996)

A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem. - Jerzy W. Jaromczyk; Miroslaw Kowaluk (Comput. Geom., 1999)

The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets. - Jerzy W. Jaromczyk; Miroslaw Kowaluk (EuroCG, 2000)

Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs - Marek Karpinski; Miroslaw Kowaluk; Andrzej Lingas (Electron. Colloquium Comput. Complex., 2000)

Algorithms for the parallel alternating direction access machine. - Bogdan S. Chlebus; Artur Czumaj; Leszek Gasieniec; Miroslaw Kowaluk; Wojciech Plandowski (Theor. Comput. Sci., 2000)

Sets of lines and cutting out polyhedral objects. - Jerzy W. Jaromczyk; Miroslaw Kowaluk (Comput. Geom., 2003)

On Visualization of Complex Image-Basedmarkup. - Jerzy W. Jaromczyk; Miroslaw Kowaluk; Neil Moore (ICCVG, 2004)

A web interface to image-based concurrent markup using image maps. - Jerzy W. Jaromczyk; Miroslaw Kowaluk; Neil Moore (WIDM, 2004)

Editorial. - Jerzy W. Jaromczyk; Miroslaw Kowaluk (Comput. Geom., 2004)

Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. - Marek Karpinski; Miroslaw Kowaluk; Andrzej Lingas (Fundam. Informaticae, 2004)

LCA Queries in Directed Acyclic Graphs. - Miroslaw Kowaluk; Andrzej Lingas (ICALP, 2005)

Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication. - Miroslaw Kowaluk; Andrzej Lingas (ESA, 2007)

Faster algorithms for finding lowest common ancestors in directed acyclic graphs. - Artur Czumaj; Miroslaw Kowaluk; Andrzej Lingas (Theor. Comput. Sci., 2007)

A Path Cover Technique for LCAs in Dags. - Miroslaw Kowaluk; Andrzej Lingas; Johannes Nowak (SWAT, 2008)

Faster multi-witnesses for Boolean matrix multiplication. - Leszek Gasieniec; Miroslaw Kowaluk; Andrzej Lingas (Inf. Process. Lett., 2009)

Unique Small Subgraphs Are Not Easier to Find. - Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (LATA, 2011)

Counting and detecting small subgraphs via equations and matrix multiplication. - Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (SODA, 2011)

Unique subgraphs are not easier to find. - Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (Int. J. Comput. Math., 2013)

Counting and Detecting Small Subgraphs via Equations. - Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (SIAM J. Discret. Math., 2013)

Planar $β$-skeletons via point location in monotone subdivisions of subset of lunes. - Miroslaw Kowaluk (CoRR, 2014)

Generalized $β$-skeletons. - Miroslaw Kowaluk; Gabriela Majewska (CoRR, 2014)

$β$-skeletons for a set of line segments in $R^2$. - Miroslaw Kowaluk; Gabriela Majewska (CoRR, 2014)

Multidimensional β-skeletons in L1 and L∞ metric. - Miroslaw Kowaluk; Gabriela Majewska (CoRR, 2014)

β-skeletons for a Set of Line Segments in R2. - Miroslaw Kowaluk; Gabriela Majewska (FCT, 2015)

Detecting and Counting Small Pattern Graphs. - Peter Floderus; Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (SIAM J. Discret. Math., 2015)

Induced subgraph isomorphism: Are some patterns substantially easier than others? - Peter Floderus; Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (Theor. Comput. Sci., 2015)

New sequential and parallel algorithms for computing the β-spectrum. - Miroslaw Kowaluk; Gabriela Majewska (Theor. Comput. Sci., 2015)

Towards minimal algorithms for big data analytics with spreadsheets. - Jacek Sroka; Artur Lesniewski; Miroslaw Kowaluk; Krzysztof Stencel; Jerzy Tyszkiewicz (BeyondMR@SIGMOD, 2017)

Are unique subgraphs not easier to find? - Miroslaw Kowaluk; Andrzej Lingas (Inf. Process. Lett., 2018)

A fast deterministic detection of small pattern graphs in graphs without large cliques. - Miroslaw Kowaluk; Andrzej Lingas (Theor. Comput. Sci., 2019)

A simple approach to nondecreasing paths. - Miroslaw Kowaluk; Andrzej Lingas (Inf. Process. Lett., 2020)

Breaking the hegemony of the triangle method in clique detection. - Miroslaw Kowaluk; Andrzej Lingas (CoRR, 2021)

A Multi-Dimensional Matrix Product - A Natural Tool for Parameterized Graph Algorithms. - Miroslaw Kowaluk; Andrzej Lingas (Algorithms, 2022)

Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. - Miroslaw Kowaluk; Andrzej Lingas (Algorithmica, 2023)

Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products. - Miroslaw Kowaluk; Andrzej Lingas (Int. J. Found. Comput. Sci., 2024)

Multiplication of 0-1 Matrices via Clustering. - Jesper Jansson 001; Miroslaw Kowaluk; Andrzej Lingas; Mia Persson (IJTCS-FAW, 2025)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication. - Miroslaw Kowaluk; Andrzej Lingas; Mia Persson (CoRR, 2025)