Miroslaw Kowaluk

发表

New sequential and parallel algorithms for computing the β-spectrum

Miroslaw Kowaluk, Gabriela Majewska, 2015, Theor. Comput. Sci..

Faster algorithms for finding lowest common ancestors in directed acyclic graphs

Andrzej Lingas, Artur Czumaj, Miroslaw Kowaluk, 2007, Theor. Comput. Sci..

Towards minimal algorithms for big data analytics with spreadsheets

Jacek Sroka, Jerzy Tyszkiewicz, Miroslaw Kowaluk, 2017, BeyondMR@SIGMOD.

Induced subgraph isomorphism: Are some patterns substantially easier than others?

Andrzej Lingas, Miroslaw Kowaluk, Peter Floderus, 2012, Theor. Comput. Sci..

Unique Small Subgraphs Are Not Easier to Find

Andrzej Lingas, Miroslaw Kowaluk, Eva-Marta Lundell, 2011, LATA.

Planar $β$-skeletons via point location in monotone subdivisions of subset of lunes pdf

Miroslaw Kowaluk, 2014, ArXiv.

Are unique subgraphs not easier to find?

Andrzej Lingas, Miroslaw Kowaluk, A. Lingas, 2018, Inf. Process. Lett..

A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques

Andrzej Lingas, Miroslaw Kowaluk, A. Lingas, 2017, WALCOM.

Parallel Alternating-Direction Access Machine

Wojciech Plandowski, Artur Czumaj, Bogdan S. Chlebus, 1996, MFCS.

Sets of lines and cutting out polyhedral objects

Jerzy W. Jaromczyk, Miroslaw Kowaluk, J. Jaromczyk, 2003, Comput. Geom..

Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs

Andrzej Lingas, Miroslaw Kowaluk, A. Lingas, 2019, Algorithmica.

Multidimensional β-skeletons in L1 and L∞ metric pdf

Miroslaw Kowaluk, Gabriela Majewska, 2014, ArXiv.

Counting and detecting small subgraphs via equations and matrix multiplication

Andrzej Lingas, Miroslaw Kowaluk, Eva-Marta Lundell, 2011, SODA '11.

β-skeletons for a Set of Line Segments in R2

Miroslaw Kowaluk, Gabriela Majewska, 2015, FCT.

Faster multi-witnesses for Boolean matrix multiplication

Andrzej Lingas, Miroslaw Kowaluk, Leszek Gasieniec, 2009, Inf. Process. Lett..

A Path Cover Technique for LCAs in Dags

Andrzej Lingas, Miroslaw Kowaluk, Johannes Nowak, 2008, SWAT.

Constructing the relative neighborhood graph in 3-dimensional Euclidean space

Jerzy W. Jaromczyk, Miroslaw Kowaluk, J. Jaromczyk, 1991, Discret. Appl. Math..

Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs

Marek Karpinski, Andrzej Lingas, Miroslaw Kowaluk, 2004, Fundam. Informaticae.

Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs

Marek Karpinski, Andrzej Lingas, Miroslaw Kowaluk, 2000, Electron. Colloquium Comput. Complex..

Skewed projections with an application to line stabbing in R3

Jerzy W. Jaromczyk, Miroslaw Kowaluk, 1988, SCG '88.

A geometric proof of the combinatorial bounds the number of optimal solutions for the 2-center euclidean problem

Jerzy W. Jaromczyk, Miroslaw Kowaluk, 1995, CCCG.

Retrieval of scattered information by EREW, CREW, and CRCW PRAMs

Faith Ellen, Prabhakar Ragde, Miroslaw Kutylowski, 2005, computational complexity.

Multidimensional $\beta$-skeletons in $L_1$ and $L_{\infty}$ metric

Miroslaw Kowaluk, Gabriela Majewska, 2014 .

Detecting and Counting Small Pattern Graphs

Andrzej Lingas, Miroslaw Kowaluk, Peter Floderus, 2013, SIAM J. Discret. Math..

Retrieval of scattered information by EREW, CREW and CRCW PRAMs

Faith Ellen, Prabhakar Ragde, Miroslaw Kutylowski, 1992, SWAT.

A web interface to image-based concurrent markup using image maps

Jerzy W. Jaromczyk, Neil Moore, Miroslaw Kowaluk, 2004, WIDM '04.

Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?

Andrzej Lingas, Miroslaw Kowaluk, Peter Floderus, 2012, COCOON.

The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets

Jerzy W. Jaromczyk, Miroslaw Kowaluk, 2000, EuroCG.

The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure

Jerzy W. Jaromczyk, Miroslaw Kowaluk, 1995, WADS.

Algorithms for the parallel alternating direction access machine

Wojciech Plandowski, Artur Czumaj, Bogdan S. Chlebus, 2000, Theor. Comput. Sci..

A note on relative neighborhood graphs

Jerzy W. Jaromczyk, Miroslaw Kowaluk, J. Jaromczyk, 1987, SCG '87.

On Visualization of Complex Image-Basedmarkup

Jerzy W. Jaromczyk, Neil Moore, Miroslaw Kowaluk, 2004, ICCVG.

O(log logn)-time integer geometry on the CRCW PRAM

Krzysztof Diks, Bogdan S. Chlebus, Miroslaw Kowaluk, 1995, Algorithmica.

A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem

Jerzy W. Jaromczyk, Miroslaw Kowaluk, 1999, Comput. Geom..

Detecting and Counting Small Pattern Graphs

Andrzej Lingas, Miroslaw Kowaluk, Peter Floderus, 2013, ISAAC.

An efficient algorithm for the Euclidean two-center problem

Jerzy W. Jaromczyk, Miroslaw Kowaluk, 1994, SCG '94.

Unique subgraphs are not easier to find

Andrzej Lingas, Miroslaw Kowaluk, Eva-Marta Lundell, 2013, Int. J. Comput. Math..

Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication

Andrzej Lingas, Miroslaw Kowaluk, A. Lingas, 2007, ESA.

LCA Queries in Directed Acyclic Graphs

Andrzej Lingas, Miroslaw Kowaluk, A. Lingas, 2005, ICALP.

A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques

Andrzej Lingas, Miroslaw Kowaluk, 2017, WALCOM.

New Sequential and Parallel Algorithms for Computing the β-Spectrum

Miroslaw Kowaluk, Gabriela Majewska, 2013, FCT.

Generalized $β$-skeletons pdf

Miroslaw Kowaluk, Gabriela Majewska, 2014, ArXiv.

Vector Language: Simple Description of Hard Instances (Extended Abstract)

Miroslaw Kowaluk, Klaus W. Wagner, 1990, MFCS.

Breaking the hegemony of the triangle method in clique detection pdf

Andrzej Lingas, Miroslaw Kowaluk, A. Lingas, 2021, SSRN Electronic Journal.