Publikacje

Mirosław Kowaluk

Liczba publikacji: 38

2025

• Jesper Jansson, Mirosław Kowaluk , Andrzej Lingas, Mia Persson, Multiplication of 0-1 Matrices via Clustering, International Workshop on Frontiers in Algorithmics 2025, Paris, France, 30 czerwca 2025 - 2 lipca 2025, 15828 2025, s. 92-102. Zobacz w PBN

2024

• Mirosław Kowaluk , Andrzej Lingas, Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products, International Journal of Foundations of Computer Science, 35 (7) 2024, s. 871-886. Zobacz w PBN
• Wojciech Oronowicz-Jaśkowiak, Tomasz Kozłowski, Marta Polańska, Jerzy Wojciechowski, Piotr Wasilewski, Dominik Ślęzak , Mirosław Kowaluk , Using expert-reviewed CSAM to train CNNs and its anthropological analysis, Journal of Forensic and Legal Medicine, 101 2024, s. 1-9. Zobacz w PBN

2023

• Mirosław Kowaluk , Andrzej Lingas, Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs, Algorithmica, 85 (4) 2023, s. 976-991. Zobacz w PBN

2022

• Mirosław Kowaluk , Andrzej Lingas, A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms, Algorithms, 15 (12) 2022, s. 448. Zobacz w PBN
• Wojciech Oronowicz-Jaśkowiak, Piotr Wasilewski, Mirosław Kowaluk , Empirical verification of the suggested hyperparameters for data augmentation using the fast.ai library, Computer Science Research Notes, International Conferences in Central Europe on Computer Graphics, Visualization and Computer Vision, Pilzno, Czechia, 17 maja 2022 - 20 maja 2022. Zobacz w PBN

2021

• Mirosław Kowaluk , Andrzej Lingas, Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products, 7th Annual International Conference on Algorithms and Discrete Applied Mathematics, Rupnagar, India, 11 lutego 2021 - 13 lutego 2021, LNCS 12601 2021, s. 440-451. Zobacz w PBN

2020

• Andrzej Lingas, Mirosław Kowaluk , A simple approach to nondecreasing paths, INFORMATION PROCESSING LETTERS, 162 2020, s. 105992. Zobacz w PBN

2019

• Andrzej Lingas, Mirosław Kowaluk , A fast deterministic detection of small pattern graphs in graphs without large cliques, Theoretical Computer Science, 770 2019, s. 79-87. Zobacz w PBN
• Mirosław Kowaluk , Andrzej Lingas, Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs, 22st International Symposium on Fundamentals of Computation Theory, Copenhagen, Denmark, 11 sierpnia 2019 - 14 sierpnia 2019, LNCS 11651 2019, s. 322-334. Zobacz w PBN

2018

• Mirosław Kowaluk , Andrzej Lingas, Are unique subgraphs not easier to find?, INFORMATION PROCESSING LETTERS, 134 2018, s. 57-61. Zobacz w PBN

2017

• Mirosław Kowaluk , Andrzej Lingas, A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques, 11th International Conference and Workshops on Algorithms & Computation, Hsinchu, Taiwan (Province of China), 29 maja 2017 - 31 maja 2017, 10167 2017, s. 217-227. Zobacz w PBN
• Mirosław Kowaluk , Artur Leśniewski, Jacek Sroka , Krzysztof Stencel , Jerzy Tyszkiewicz , Towards minimal algorithms for big data analytics with spreadsheets, 4th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, Chicago, the United States of America, 19 maja 2017 - 19 maja 2017, (1) 2017, s. 1-4. Zobacz w PBN

2015

• Mirosław Kowaluk , Peter Floderus, Andrzej Lingas, Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, SIAM JOURNAL ON DISCRETE MATHEMATICS, 29 (3) 2015, s. 1322-1339. Zobacz w PBN
• Mirosław Kowaluk , Peter Floderus, Andrzej Lingas, Eva-Marta Lundell, Induced subgraph isomorphism: Are some patterns substantially easier than others?, Theoretical Computer Science, 605 2015, s. 119-128. Zobacz w PBN
• Mirosław Kowaluk , Gabriela Majewska, New sequential and parallel algorithms for computing the β-spectrum, Theoretical Computer Science, 590 2015, s. 73-85. Zobacz w PBN
• Mirosław Kowaluk , Gabriela Majewska, β-skeletons for a Set of Line Segments in R2, Lecture Notes in Computer Science, 20th International Symposium on Fundamentals of Computation Theory, Gdańsk, Poland, 17 sierpnia 2015 - 19 sierpnia 2015, 9210 2015, s. 65-78. Zobacz w PBN

2013

• Mirosław Kowaluk , Andrzej Lingas, Eva-Marta Lundell, Counting and Detecting Small Subgraphs via Equations, SIAM JOURNAL ON DISCRETE MATHEMATICS, 27 (2) 2013, s. 892-909. Zobacz w PBN
• Peter Floderus, Mirosław Kowaluk , Andrzej Lingas, Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, Lecture Notes in Computer Science, The 24th International Symposium on Algorithms and Computation, Hong Kong, 2013. Zobacz w PBN
• Mirosław Kowaluk , Gabriela Majewska, New Sequential and Parallel Algorithms for Computing the β-Spectrum, Lecture Notes in Computer Science, 19th International Symposium on Fundamentals of Computation Theory, Liverpool, the United Kingdom of Great Britain and Northern Ireland, 19 sierpnia 2013 - 21 sierpnia 2013. Zobacz w PBN
• Mirosław Kowaluk , Andrzej Lingas, Eva-Marta Lundell, Unique Small Subgraphs Are Not Easier to Find, INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 90 (6) 2013, s. 1247-1253. Zobacz w PBN

2012

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

2011

• Mirosław Kowaluk , Andrzej Lingas, Eva-Marta Lundell, Counting and detecting small subgraphs via equations and matrix multiplication, 2011. Zobacz w PBN
• Mirosław Kowaluk , Andrzej Lingas, Eva-Marta Lundell, Unique Small Subgraphs Are Not Easier to Find, Lecture Notes in Computer Science, 2011. Zobacz w PBN

2009

• Leszek Gasieniec, Mirosław Kowaluk , Andrzej Lingas, Faster multi-witnesses for Boolean matrix multiplication, INFORMATION PROCESSING LETTERS, 2009. Zobacz w PBN

2008

• Mirosław Kowaluk , Andrzej Lingas, Johannes Nowak, A Path Cover Technique for LCAs in Dags, Lecture Notes in Computer Science, 2008. Zobacz w PBN

2007

• Artur Czumaj, Mirosław Kowaluk , Andrzej Lingas, Faster algorithms for finding lowest common ancestors in directed acyclic graphs, Theoretical Computer Science, 2007. Zobacz w PBN
• Mirosław Kowaluk , Andrzej Lingas, Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication, Lecture Notes in Computer Science, 2007. Zobacz w PBN

2005

• Mirosław Kowaluk , Andrzej Lingas, LCA Queries in Directed Acyclic Graphs, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Jerzy Jaromczyk, Mirosław Kowaluk , Neil Moore, On visualization of complex image-based markup, 2005. Zobacz w PBN

2004

• Jerzy Jaromczyk, Mirosław Kowaluk , Neil Moore, A web interface to image-based concurrent markup using maps, 2004. Zobacz w PBN
• M. Karpinski, Mirosław Kowaluk , A. Lingas, Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs, FUNDAMENTA INFORMATICAE, 2004. Zobacz w PBN
• Jerzy Jaromczyk, Mirosław Kowaluk , Proc. 18th Eur. Worksh. Computational Geometry (EWCG 2002), 2004. Zobacz w PBN

2003

• J. Jaromczyk, Mirosław Kowaluk , Sets of lines and cutting out polyhedral objects, Computational Geometry: Theory and Applications, 2003. Zobacz w PBN

2002

• Jerzy Jaromczyk, Mirosław Kowaluk , A kinetic view of the shooter problem, 2002. Zobacz w PBN

2000

• Bogdan Chlebus, A. Czumaj, Leszek Gąsieniec, Mirosław Kowaluk , Wojciech Plandowski , Algorithms for the parallel alternating direction access machine, Theoretical Computer Science, 2000. Zobacz w PBN
• J Jaromczyk, Mirosław Kowaluk , The face-wise continuity in hot wire cutting of polyhedral sets, 2000. Zobacz w PBN

Inne

• Mirosław Kowaluk , Andrzej Lingas, Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products, Algorithms and Discrete Applied Mathematics: 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings, , s. 440-451. Zobacz w PBN