Miroslaw Kowaluk

59 papers A* 2A 1B 8C 2Misc 2Journal 33Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Approximate All-Pairs Hamming Distances and 0-1 Matrix Multiplication. ICAA Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2026	J	`jnl`	Fast Approximate ℓ-Center Clustering in High-Dimensional Spaces. Algorithms Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2025	J	`jnl`	Approximate all-pairs Hamming distances and 0-1 matrix multiplication. CoRR Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2025	J	`jnl`	Fast approximate ℓ-center clustering in high dimensional spaces. CoRR Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2025	—	`conf`	Multiplication of 0-1 Matrices via Clustering. IJTCS-FAW Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2025	J	`jnl`	Multiplication of 0-1 matrices via clustering. CoRR Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2024	J	`jnl`	Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products. Int. J. Found. Comput. Sci. Miroslaw Kowaluk, Andrzej Lingas
2023	J	`jnl`	Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. Algorithmica Miroslaw Kowaluk, Andrzej Lingas
2022	J	`jnl`	A Multi-Dimensional Matrix Product - A Natural Tool for Parameterized Graph Algorithms. Algorithms Miroslaw Kowaluk, Andrzej Lingas
2021	J	`jnl`	Breaking the hegemony of the triangle method in clique detection. CoRR Miroslaw Kowaluk, Andrzej Lingas
2021	—	`conf`	Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products. CALDAM Miroslaw Kowaluk, Andrzej Lingas
2020	J	`jnl`	A simple approach to nondecreasing paths. Inf. Process. Lett. Miroslaw Kowaluk, Andrzej Lingas
2020	J	`jnl`	Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. CoRR Miroslaw Kowaluk, Andrzej Lingas
2019	J	`jnl`	A fast deterministic detection of small pattern graphs in graphs without large cliques. Theor. Comput. Sci. Miroslaw Kowaluk, Andrzej Lingas
2019	B	`conf`	Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. FCT Miroslaw Kowaluk, Andrzej Lingas
2018	J	`jnl`	Are unique subgraphs not easier to find? Inf. Process. Lett. Miroslaw Kowaluk, Andrzej Lingas
2017	B	`conf`	A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques. WALCOM Miroslaw Kowaluk, Andrzej Lingas
2017	—	`conf`	Towards minimal algorithms for big data analytics with spreadsheets. BeyondMR@SIGMOD Jacek Sroka, Artur Lesniewski, Miroslaw Kowaluk, Krzysztof Stencel, Jerzy Tyszkiewicz
2015	J	`jnl`	Detecting and Counting Small Pattern Graphs. SIAM J. Discret. Math. Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2015	J	`jnl`	Induced subgraph isomorphism: Are some patterns substantially easier than others? Theor. Comput. Sci. Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2015	J	`jnl`	New sequential and parallel algorithms for computing the β-spectrum. Theor. Comput. Sci. Miroslaw Kowaluk, Gabriela Majewska
2015	B	`conf`	β-skeletons for a Set of Line Segments in R FCT Miroslaw Kowaluk, Gabriela Majewska
2014	J	`jnl`	$β$-skeletons for a set of line segments in $R^2$. CoRR Miroslaw Kowaluk, Gabriela Majewska
2014	J	`jnl`	Generalized $β$-skeletons. CoRR Miroslaw Kowaluk, Gabriela Majewska
2014	J	`jnl`	Multidimensional β-skeletons in L CoRR Miroslaw Kowaluk, Gabriela Majewska
2014	J	`jnl`	Planar $β$-skeletons via point location in monotone subdivisions of subset of lunes. CoRR Miroslaw Kowaluk
2013	J	`jnl`	Counting and Detecting Small Subgraphs via Equations. SIAM J. Discret. Math. Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2013	B	`conf`	Detecting and Counting Small Pattern Graphs. ISAAC Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2013	B	`conf`	New Sequential and Parallel Algorithms for Computing the β-Spectrum. FCT Miroslaw Kowaluk, Gabriela Majewska
2013	J	`jnl`	Unique subgraphs are not easier to find. Int. J. Comput. Math. Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2012	Misc	`conf`	Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? COCOON Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2011	A*	`conf`	Counting and detecting small subgraphs via equations and matrix multiplication. SODA Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2011	C	`conf`	Unique Small Subgraphs Are Not Easier to Find. LATA Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2009	J	`jnl`	Faster multi-witnesses for Boolean matrix multiplication. Inf. Process. Lett. Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas
2008	—	`conf`	A Path Cover Technique for LCAs in Dags. SWAT Miroslaw Kowaluk, Andrzej Lingas, Johannes Nowak
2007	J	`jnl`	Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theor. Comput. Sci. Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
2007	A	`conf`	Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication. ESA Miroslaw Kowaluk, Andrzej Lingas
2006	J	`jnl`	Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Electron. Colloquium Comput. Complex. Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
2005	A*	`conf`	LCA Queries in Directed Acyclic Graphs. ICALP Miroslaw Kowaluk, Andrzej Lingas
2004	—	`conf`	A web interface to image-based concurrent markup using image maps. WIDM Jerzy W. Jaromczyk, Miroslaw Kowaluk, Neil Moore
2004	J	`jnl`	Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. Fundam. Informaticae Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas
2004	J	`jnl`	Editorial. Comput. Geom. Jerzy W. Jaromczyk, Miroslaw Kowaluk
2004	Misc	`conf`	On Visualization of Complex Image-Basedmarkup. ICCVG Jerzy W. Jaromczyk, Miroslaw Kowaluk, Neil Moore
2003	J	`jnl`	Sets of lines and cutting out polyhedral objects. Comput. Geom. Jerzy W. Jaromczyk, Miroslaw Kowaluk
2000	J	`jnl`	Algorithms for the parallel alternating direction access machine. Theor. Comput. Sci. Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
2000	J	`jnl`	Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs Electron. Colloquium Comput. Complex. Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas
2000	C	`conf`	The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets. EuroCG Jerzy W. Jaromczyk, Miroslaw Kowaluk
1999	J	`jnl`	A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem. Comput. Geom. Jerzy W. Jaromczyk, Miroslaw Kowaluk
1996	B	`conf`	Parallel Alternating-Direction Access Machine. MFCS Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
1995	—	`conf`	A geometric proof of the combinatorial bounds the number of optimal solutions for the 2-center euclidean problem. CCCG Jerzy W. Jaromczyk, Miroslaw Kowaluk
1995	J	`jnl`	O(log log n)-Time Integer Geometry on the CRCW PRAM. Algorithmica Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk
1995	J	`jnl`	Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. Comput. Complex. Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde
1995	B	`conf`	The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure. WADS Jerzy W. Jaromczyk, Miroslaw Kowaluk
1994	—	`conf`	An Efficient Algorithm for the Euclidean Two-Center Problem. SCG Jerzy W. Jaromczyk, Miroslaw Kowaluk
1992	—	`conf`	Retrieval of scattered information by EREW, CREW and CRCW PRAMs. SWAT Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde
1991	J	`jnl`	Constructing the relative neighborhood graph in 3-dimensional Euclidean space. Discret. Appl. Math. Jerzy W. Jaromczyk, Miroslaw Kowaluk
1990	B	`conf`	Vector Language: Simple Description of Hard Instances (Extended Abstract). MFCS Miroslaw Kowaluk, Klaus W. Wagner
1988	—	`conf`	Skewed Projections with an Application to Line Stabbing in R3. SCG Jerzy W. Jaromczyk, Miroslaw Kowaluk
1987	—	`conf`	A Note on Relative Neighborhood Graphs. SCG Jerzy W. Jaromczyk, Miroslaw Kowaluk