Mirosław Kowaluk

From MaRDI portal
Person:831753

Available identifiers

zbMath Open kowaluk.miroslawMaRDI QIDQ831753

List of research outcomes





PublicationDate of PublicationType
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products2024-10-30Paper
Rare siblings speed-up deterministic detection and counting of small pattern graphs2023-04-11Paper
The two-line center problem from a polar view: a new algorithm and data structure2022-12-16Paper
Retrieval of scattered information by EREW, CREW and CRCW PRAMs2022-12-09Paper
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products2022-03-24Paper
A simple approach to nondecreasing paths2020-10-07Paper
Rare siblings speed-up deterministic detection and counting of small pattern graphs2020-01-30Paper
A fast deterministic detection of small pattern graphs in graphs without large cliques2019-05-02Paper
Are unique subgraphs not easier to find?2018-04-04Paper
https://portal.mardi4nfdi.de/entity/Q53651322017-09-29Paper
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques2017-05-05Paper
Induced subgraph isomorphism: are some patterns substantially easier than others?2015-10-30Paper
$$\beta $$-skeletons for a Set of Line Segments in $$R^2 $$2015-09-29Paper
Detecting and Counting Small Pattern Graphs2015-08-17Paper
New sequential and parallel algorithms for computing the \(\beta\)-spectrum2015-06-10Paper
Detecting and Counting Small Pattern Graphs2014-01-14Paper
Unique subgraphs are not easier to find2013-10-22Paper
Counting and detecting small subgraphs via equations2013-09-26Paper
New Sequential and Parallel Algorithms for Computing the β-Spectrum2013-08-16Paper
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?2012-09-25Paper
Unique Small Subgraphs Are Not Easier to Find2011-06-03Paper
Faster multi-witnesses for Boolean matrix multiplication2010-06-16Paper
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication2008-09-25Paper
A Path Cover Technique for LCAs in Dags2008-07-15Paper
Faster algorithms for finding lowest common ancestors in directed acyclic graphs2007-07-16Paper
Automata, Languages and Programming2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q46542702005-03-03Paper
Sets of lines and cutting out polyhedral objects2003-05-19Paper
Algorithms for the parallel alternating direction access machine2000-08-21Paper
A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem2000-04-25Paper
Retrieval of scattered information by EREW, CREW, and CRCW PRAMs1996-05-27Paper
\(O(\log \log n)\)-time integer geometry on the CRCW PRAM1995-07-24Paper
Constructing the relative neighborhood graph in 3-dimensional Euclidean space1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q33597691990-01-01Paper

Research outcomes over time

This page was built for person: Mirosław Kowaluk