Publications

Mirosław Kowaluk

Mirosław Kowaluk and Andrzej Lingas, Are unique subgraphs not easier to find?, Information Processing Letters 134 2018, p. 57–61.see in PBN

Jacek Sroka, Artur Leśniewski, Mirosław Kowaluk, Krzysztof Stencel and Jerzy Paweł Tyszkiewicz, Towards minimal algorithms for big data analytics with spreadsheets, in: Proceedings of the 4th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2017, Chicago, IL, USA, May 19, 2017, ACM, 2017, p. 1:1–1:4.see in PBN
Mirosław Kowaluk and Andrzej Lingas, A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques, Lecture Notes In Computer Science 10167 2017, p. 217–227.see in PBN

Mirosław Kowaluk and Gabriela Majewska, β-skeletons for a Set of Line Segments in R2, Lecture Notes In Computer Science 9210 2015, p. 65–78.see in PBN
Mirosław Kowaluk and Gabriela Majewska, New sequential and parallel algorithms for computing the β-spectrum, Theoretical Computer Science 590 2015, p. 73–85.see in PBN
Peter Floderus, Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, Siam Journal On Discrete Mathematics 29 (3) 2015, p. 1322–1339.see in PBN
Peter Floderus, Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell, Induced subgraph isomorphism: Are some patterns substantially easier than others?, Theoretical Computer Science 605 2015, p. 119–128.see in PBN

Gabriela Majewska and Mirosław Kowaluk, New Sequential and Parallel Algorithms for Computing the β-Spectrum, Lecture Notes In Computer Science 2013, p. 210–224.see in PBN
Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell, Counting and Detecting Small Subgraphs via Equations, Siam Journal On Discrete Mathematics 27 (2) 2013, p. 892–909.see in PBN
Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell, Unique Small Subgraphs Are Not Easier to Find, International Journal Of Computer Mathematics 90 (6) 2013, p. 1247–1253.see in PBN
Peter Floderus, Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, Lecture Notes In Computer Science 8283 2013, p. 547–557.see in PBN

Peter Floderus, Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell, Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?, in: COCOON, 2012.see in PBN

Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell, Unique Small Subgraphs Are Not Easier to Find, Lecture Notes In Computer Science 6638 2011, p. 336–341.see in PBN
Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell, Counting and detecting small subgraphs via equations and matrix multiplication, in: SODA, SIAM, San Francisco 2011.see in PBN

Leszek Gasieniec, Mirosław Kowaluk and Andrzej Lingas, Faster multi-witnesses for Boolean matrix multiplication, Information Processing Letters 109 (4) 2009, p. 242–247.see in PBN

Mirosław Kowaluk, Andrzej Lingas and Johannes Nowak, A Path Cover Technique for LCAs in Dags, Lecture Notes In Computer Science 5124 2008, p. 222–233.see in PBN

Artur Czumaj, Mirosław Kowaluk and Andrzej Lingas, Faster algorithms for finding lowest common ancestors in directed acyclic graphs, Theoretical Computer Science 380 (1) 2007, p. 37–46.see in PBN
Mirosław Kowaluk and Andrzej Lingas, Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication, Lecture Notes In Computer Science 4698 2007, p. 265–274.see in PBN

Mirosław Kowaluk and Andrzej Lingas, LCA Queries in Directed Acyclic Graphs, Lecture Notes In Computer Science 3580 2005, p. 241–248.see in PBN
Jerzy Jaromczyk, Mirosław Kowaluk and Neil Moore, On visualization of complex image-based markup, in: International Conference on Computer Vision and Graphics, Springer Verlag, Berlin 2005.see in PBN

M. Karpinski, M. Kowaluk and A. Lingas, Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs, Fundamenta Informaticae Vol. 62, nr 3,4 2004, p. 369–375.see in PBN
Marek Karpinski, Mirosław Kowaluk and Andrzej Lingas, Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs, Fundamenta Informaticae 62 (3) 2004, p. 369–375.see in PBN
Jerzy Jaromczyk, Mirosław Kowaluk and Neil Moore, A web interface to image-based concurrent markup using maps, in: Sixth ACM CIKM International Workshop on Web Information and Data Management (WIDM 2004), ACM, USA 2004.see in PBN
Mirosław Kowaluk and Jerzy Jaromczyk (eds.), Proc. 18th Eur. Worksh. Computational Geometry (EWCG 2002), Elsevier, Amsterdam 2004.see in PBN

J. Jaromczyk and Mirosław Kowaluk, Sets of lines and cutting out polyhedral objects, Computational Geometry-theory And Applications 25 2003, p. 67–95.see in PBN

Jerzy Jaromczyk and Mirosław Kowaluk, A kinetic view of the shooter problem, in: Proc. of the 18th European Workshop on Computational Geometry, Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego, Warszawa 2002.see in PBN

Bogdan Chlebus, A. Czumaj, Leszek Gąsieniec, Mirosław Kowaluk and Wojciech Plandowski, Algorithms for the parallel alternating direction access machine, Theoretical Computer Science 245 (2) 2000, p. 151–173.see in PBN
Mirosław Kowaluk and J Jaromczyk, The face-wise continuity in hot wire cutting of polyhedral sets, in: Proceedinngs 16th European Workshop on Computational Geometry, Ben Gurion University, Eilat, Israel, 2000.see in PBN