Mirosław Kowaluk

Available identifiers

zbMath Open kowaluk.miroslawMaRDI QIDQ831753

List of research outcomes

Publication	Date of Publication	Type
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products	2024-10-30	Paper
Rare siblings speed-up deterministic detection and counting of small pattern graphs	2023-04-11	Paper
The two-line center problem from a polar view: a new algorithm and data structure	2022-12-16	Paper
Retrieval of scattered information by EREW, CREW and CRCW PRAMs	2022-12-09	Paper
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products	2022-03-24	Paper
A simple approach to nondecreasing paths	2020-10-07	Paper
Rare siblings speed-up deterministic detection and counting of small pattern graphs	2020-01-30	Paper
A fast deterministic detection of small pattern graphs in graphs without large cliques	2019-05-02	Paper
Are unique subgraphs not easier to find?	2018-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q5365132	2017-09-29	Paper
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques	2017-05-05	Paper
Induced subgraph isomorphism: are some patterns substantially easier than others?	2015-10-30	Paper
$$\beta $$-skeletons for a Set of Line Segments in $$R^2 $$	2015-09-29	Paper
Detecting and Counting Small Pattern Graphs	2015-08-17	Paper
New sequential and parallel algorithms for computing the \(\beta\)-spectrum	2015-06-10	Paper
Detecting and Counting Small Pattern Graphs	2014-01-14	Paper
Unique subgraphs are not easier to find	2013-10-22	Paper
Counting and detecting small subgraphs via equations	2013-09-26	Paper
New Sequential and Parallel Algorithms for Computing the β-Spectrum	2013-08-16	Paper
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?	2012-09-25	Paper
Unique Small Subgraphs Are Not Easier to Find	2011-06-03	Paper
Faster multi-witnesses for Boolean matrix multiplication	2010-06-16	Paper
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication	2008-09-25	Paper
A Path Cover Technique for LCAs in Dags	2008-07-15	Paper
Faster algorithms for finding lowest common ancestors in directed acyclic graphs	2007-07-16	Paper
Automata, Languages and Programming	2006-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q4654270	2005-03-03	Paper
Sets of lines and cutting out polyhedral objects	2003-05-19	Paper
Algorithms for the parallel alternating direction access machine	2000-08-21	Paper
A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem	2000-04-25	Paper
Retrieval of scattered information by EREW, CREW, and CRCW PRAMs	1996-05-27	Paper
\(O(\log \log n)\)-time integer geometry on the CRCW PRAM	1995-07-24	Paper
Constructing the relative neighborhood graph in 3-dimensional Euclidean space	1992-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q3359769	1990-01-01	Paper

Research outcomes over time

This page was built for person: Mirosław Kowaluk