Miroslaw Kowaluk

Algorithmica, April, 2023

2022

A Multi-Dimensional Matrix Product - A Natural Tool for Parameterized Graph Algorithms.

[BibT_eX]

[DOI]

Algorithms, 2022

2021

Breaking the hegemony of the triangle method in clique detection.

[BibT_eX]

[DOI]

CoRR, 2021

Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

A simple approach to nondecreasing paths.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

2019

A fast deterministic detection of small pattern graphs in graphs without large cliques.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

2018

Are unique subgraphs not easier to find?

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

2017

Towards minimal algorithms for big data analytics with spreadsheets.

[BibT_eX]

[DOI]

Proceedings of the 4th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, 2017

2015

New sequential and parallel algorithms for computing the β-spectrum.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Detecting and Counting Small Pattern Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

β-skeletons for a Set of Line Segments in R2.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014

Multidimensional β-skeletons in L1 and L∞ metric.

[BibT_eX]

[DOI]

CoRR, 2014

$β$-skeletons for a set of line segments in $R^2$.

[BibT_eX]

[DOI]

CoRR, 2014

Generalized $β$-skeletons.

[BibT_eX]

[DOI]

CoRR, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

2013

Counting and Detecting Small Subgraphs via Equations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Unique subgraphs are not easier to find.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

2011

Counting and detecting small subgraphs via equations and matrix multiplication.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Unique Small Subgraphs Are Not Easier to Find.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

2009

Faster multi-witnesses for Boolean matrix multiplication.

[BibT_eX]

[DOI]

Leszek Gasieniec

Inf. Process. Lett., 2009

2008

A Path Cover Technique for LCAs in Dags.

[BibT_eX]

[DOI]

Johannes Nowak

Proceedings of the Algorithm Theory, 2008

2007

Faster algorithms for finding lowest common ancestors in directed acyclic graphs.

[BibT_eX]

[DOI]

Artur Czumaj

Theor. Comput. Sci., 2007

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2005

LCA Queries in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs.

[BibT_eX]

[DOI]

Marek Karpinski

Fundam. Informaticae, 2004

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2004

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

[BibT_eX]

[DOI]

Neil Moore

Proceedings of the Sixth ACM CIKM International Workshop on Web Information and Data Management (WIDM 2004), 2004

On Visualization of Complex Image-Basedmarkup.

[BibT_eX]

[DOI]

Neil Moore

Proceedings of the International Conference on Computer Vision and Graphics, 2004

2003

Sets of lines and cutting out polyhedral objects.

[BibT_eX]

[DOI]

Comput. Geom., 2003

2000

Algorithms for the parallel alternating direction access machine.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

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

[BibT_eX]

[DOI]

Marek Karpinski

Electron. Colloquium Comput. Complex., 2000

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

[BibT_eX]

EuroCG, 2000

1999

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

[BibT_eX]

[DOI]

Comput. Geom., 1999

1996

Parallel Alternating-Direction Access Machine.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs.

[BibT_eX]

[DOI]

Comput. Complex., 1995

O(log log n)-Time Integer Geometry on the CRCW PRAM.

[BibT_eX]

[DOI]

Bogdan S. Chlebus

Krzysztof Diks

Algorithmica, 1995

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

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

[BibT_eX]

[DOI]

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

An Efficient Algorithm for the Euclidean Two-Center Problem.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1991

Constructing the relative neighborhood graph in 3-dimensional Euclidean space.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

1990

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

[BibT_eX]

[DOI]

Klaus W. Wagner

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1988

Skewed Projections with an Application to Line Stabbing in R3.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

A Note on Relative Neighborhood Graphs.

[BibT_eX]

[DOI]