Kowaluk, Mirosław; Lingas, Andrzej A simple approach to nondecreasing paths. (English) Zbl 07256098 Inf. Process. Lett. 162, Article ID 105992, 2 p. (2020). MSC: 68Q PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{A. Lingas}, Inf. Process. Lett. 162, Article ID 105992, 2 p. (2020; Zbl 07256098) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej Rare siblings speed-up deterministic detection and counting of small pattern graphs. (English) Zbl 07160844 Gąsieniec, Leszek Antoni (ed.) et al., Fundamentals of computation theory. 22nd international symposium, FCT 2019, Copenhagen, Denmark, August 12–14, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-25026-3/pbk; 978-3-030-25027-0/ebook). Lecture Notes in Computer Science 11651, 322-334 (2019). MSC: 68Qxx PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{A. Lingas}, Lect. Notes Comput. Sci. 11651, 322--334 (2019; Zbl 07160844) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej A fast deterministic detection of small pattern graphs in graphs without large cliques. (English) Zbl 1421.68137 Theor. Comput. Sci. 770, 79-87 (2019). MSC: 68R10 05C50 05C69 05C85 68Q25 PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{A. Lingas}, Theor. Comput. Sci. 770, 79--87 (2019; Zbl 1421.68137) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej Are unique subgraphs not easier to find? (English) Zbl 06855757 Inf. Process. Lett. 134, 57-61 (2018). MSC: 68Q PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{A. Lingas}, Inf. Process. Lett. 134, 57--61 (2018; Zbl 06855757) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej A fast deterministic detection of small pattern graphs in graphs without large cliques. (English) Zbl 06711889 Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-53924-9/pbk; 978-3-319-53925-6/ebook). Lecture Notes in Computer Science 10167, 217-227 (2017). MSC: 68Wxx PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{A. Lingas}, Lect. Notes Comput. Sci. 10167, 217--227 (2017; Zbl 06711889) Full Text: DOI
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta Induced subgraph isomorphism: are some patterns substantially easier than others? (English) Zbl 1331.05154 Theor. Comput. Sci. 605, 119-128 (2015). MSC: 05C60 05C85 05C30 68Q25 PDF BibTeX XML Cite \textit{P. Floderus} et al., Theor. Comput. Sci. 605, 119--128 (2015; Zbl 1331.05154) Full Text: DOI
Kowaluk, Mirosław; Majewska, Gabriela \(\beta\)-skeletons for a set of line segments in \(\mathbb R^2\). (English) Zbl 1434.68610 Kosowski, Adrian (ed.) et al., Fundamentals of computation theory. 20th international symposium, FCT 2015, Gdańsk, Poland, August 17–19, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9210, 65-78 (2015). MSC: 68U05 68Q25 68R10 68W40 PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{G. Majewska}, Lect. Notes Comput. Sci. 9210, 65--78 (2015; Zbl 1434.68610) Full Text: DOI
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta Detecting and counting small pattern graphs. (English) Zbl 1327.68332 SIAM J. Discrete Math. 29, No. 3, 1322-1339 (2015). MSC: 68W20 05C50 05C60 68Q25 PDF BibTeX XML Cite \textit{P. Floderus} et al., SIAM J. Discrete Math. 29, No. 3, 1322--1339 (2015; Zbl 1327.68332) Full Text: DOI
Kowaluk, Mirosław; Majewska, Gabriela New sequential and parallel algorithms for computing the \(\beta\)-spectrum. (English) Zbl 1327.68319 Theor. Comput. Sci. 590, 73-85 (2015). MSC: 68U05 05C10 05C85 68W10 PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{G. Majewska}, Theor. Comput. Sci. 590, 73--85 (2015; Zbl 1327.68319) Full Text: DOI
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta Detecting and counting small pattern graphs. (English) Zbl 1406.68128 Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45029-7/pbk). Lecture Notes in Computer Science 8283, 547-557 (2013). MSC: 68W20 05C50 05C60 68Q25 PDF BibTeX XML Cite \textit{P. Floderus} et al., Lect. Notes Comput. Sci. 8283, 547--557 (2013; Zbl 1406.68128) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta Unique subgraphs are not easier to find. (English) Zbl 1310.68113 Int. J. Comput. Math. 90, No. 6, 1247-1253 (2013). MSC: 68Q25 05C60 05C85 PDF BibTeX XML Cite \textit{M. Kowaluk} et al., Int. J. Comput. Math. 90, No. 6, 1247--1253 (2013; Zbl 1310.68113) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta Counting and detecting small subgraphs via equations. (English) Zbl 1275.68161 SIAM J. Discrete Math. 27, No. 2, 892-909 (2013). MSC: 68W40 68Q25 68R10 05C50 05C85 PDF BibTeX XML Cite \textit{M. Kowaluk} et al., SIAM J. Discrete Math. 27, No. 2, 892--909 (2013; Zbl 1275.68161) Full Text: DOI
Kowaluk, Mirosław; Majewska, Gabriela New sequential and parallel algorithms for computing the \(\beta \)-spectrum. (English) Zbl 1390.68720 Gąsieniec, Leszek (ed.) et al., Fundamentals of computation theory. 19th international symposium, FCT 2013, Liverpool, UK, August 19–21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40163-3/pbk). Lecture Notes in Computer Science 8070, 210-224 (2013). MSC: 68U05 68W05 68W10 PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{G. Majewska}, Lect. Notes Comput. Sci. 8070, 210--224 (2013; Zbl 1390.68720) Full Text: DOI
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta Induced subgraph isomorphism: are some patterns substantially easier than others? (English) Zbl 1364.68228 Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20–22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 37-48 (2012). MSC: 68Q25 05C60 PDF BibTeX XML Cite \textit{P. Floderus} et al., Lect. Notes Comput. Sci. 7434, 37--48 (2012; Zbl 1364.68228) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta Counting and detecting small subgraphs via equations and matrix multiplication. (English) Zbl 1376.05151 Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1468-1476 (2011). MSC: 05C85 05C30 05C50 68Q25 PDF BibTeX XML Cite \textit{M. Kowaluk} et al., in: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23--25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1468--1476 (2011; Zbl 1376.05151) Full Text: Link
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta Unique small subgraphs are not easier to find. (English) Zbl 1330.68224 Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 5th international conference, LATA 2011, Tarragona, Spain, May 26–31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21253-6/pbk). Lecture Notes in Computer Science 6638, 336-341 (2011). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{M. Kowaluk} et al., Lect. Notes Comput. Sci. 6638, 336--341 (2011; Zbl 1330.68224) Full Text: DOI
Gąsieniec, Leszek; Kowaluk, Mirosław; Lingas, Andrzej Faster multi-witnesses for Boolean matrix multiplication. (English) Zbl 1190.65073 Inf. Process. Lett. 109, No. 4, 242-247 (2009). MSC: 65F99 15B34 PDF BibTeX XML Cite \textit{L. Gąsieniec} et al., Inf. Process. Lett. 109, No. 4, 242--247 (2009; Zbl 1190.65073) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej; Nowak, Johannes A path cover technique for LCAs in dags. (English) Zbl 1155.68476 Gudmundsson, Joachim (ed.), Algorithm theory – SWAT 2008. 11th Scandinavian workshop on algorithm theory, Gothenburg, Sweden, July 2–4, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69900-2/pbk). Lecture Notes in Computer Science 5124, 222-233 (2008). MSC: 68R10 05C70 05C85 68Q25 PDF BibTeX XML Cite \textit{M. Kowaluk} et al., Lect. Notes Comput. Sci. 5124, 222--233 (2008; Zbl 1155.68476) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej Unique lowest common ancestors in dags are almost as easy as matrix multiplication. (English) Zbl 1151.68429 Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 265-274 (2007). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{A. Lingas}, Lect. Notes Comput. Sci. 4698, 265--274 (2007; Zbl 1151.68429) Full Text: DOI
Czumaj, Artur; Kowaluk, Mirosław; Lingas, Andrzej Faster algorithms for finding lowest common ancestors in directed acyclic graphs. (English) Zbl 1118.68102 Theor. Comput. Sci. 380, No. 1-2, 37-46 (2007). MSC: 68R10 05C20 05C38 05C85 68W40 PDF BibTeX XML Cite \textit{A. Czumaj} et al., Theor. Comput. Sci. 380, No. 1--2, 37--46 (2007; Zbl 1118.68102) Full Text: DOI
Kowaluk, Miroslaw; Lingas, Andrzej LCA queries in directed acyclic graphs. (English) Zbl 1082.68593 Caires, Luís (ed.) et al., Automata, languages and programming. 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 11–15, 2005. Proceedings. Berlin: Springer (ISBN 3-540-27580-0/pbk). Lecture Notes in Computer Science 3580, 241-248 (2005). MSC: 68R10 05C85 PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{A. Lingas}, Lect. Notes Comput. Sci. 3580, 241--248 (2005; Zbl 1082.68593) Full Text: DOI
Karpinski, Marek; Kowaluk, Miroslaw; Lingas, Andrzej Approximation algorithms for max-bisection on low degree regular graphs. (English) Zbl 1102.68095 Fundam. Inform. 62, No. 3-4, 369-375 (2004). MSC: 68R10 68W25 PDF BibTeX XML Cite \textit{M. Karpinski} et al., Fundam. Inform. 62, No. 3--4, 369--375 (2004; Zbl 1102.68095)
Jaromczyk, Jerzy W.; Kowaluk, Mirosław Sets of lines and cutting out polyhedral objects. (English) Zbl 1022.65022 Comput. Geom. 25, No. 1-2, 67-95 (2003). Reviewer: Francisco Perez Acosta (La Laguna) MSC: 65D18 PDF BibTeX XML Cite \textit{J. W. Jaromczyk} and \textit{M. Kowaluk}, Comput. Geom. 25, No. 1--2, 67--95 (2003; Zbl 1022.65022) Full Text: DOI
Chlebus, B. S.; Czumaj, A.; Gąsieniec, L.; Kowaluk, M.; Plandowski, W. Algorithms for the parallel alternating direction access machine. (English) Zbl 0946.68047 Theor. Comput. Sci. 245, No. 2, 151-173 (2000). MSC: 68Q10 68W05 68U20 PDF BibTeX XML Cite \textit{B. S. Chlebus} et al., Theor. Comput. Sci. 245, No. 2, 151--173 (2000; Zbl 0946.68047) Full Text: DOI
Jaromczyk, Jerzy W.; Kowaluk, Mirosław A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem. (English) Zbl 0939.68149 Comput. Geom. 14, No. 4, 187-196 (1999). MSC: 68U05 PDF BibTeX XML Cite \textit{J. W. Jaromczyk} and \textit{M. Kowaluk}, Comput. Geom. 14, No. 4, 187--196 (1999; Zbl 0939.68149) Full Text: DOI
Fich, Faith; Kowaluk, Mirosław; Kutyłowski, Mirosław; Loryś, Krzysztof; Ragde, Prabhakar Retrieval of scattered information by EREW, CREW, and CRCW PRAMs. (English) Zbl 0838.68052 Comput. Complexity 5, No. 2, 113-131 (1995). MSC: 68W15 68Q25 PDF BibTeX XML Cite \textit{F. Fich} et al., Comput. Complexity 5, No. 2, 113--131 (1995; Zbl 0838.68052) Full Text: DOI
Chlebus, B. S.; Diks, K.; Kowaluk, M. \(O(\log \log n)\)-time integer geometry on the CRCW PRAM. (English) Zbl 0837.68121 Algorithmica 14, No. 1, 52-69 (1995). MSC: 68U05 PDF BibTeX XML Cite \textit{B. S. Chlebus} et al., Algorithmica 14, No. 1, 52--69 (1995; Zbl 0837.68121) Full Text: DOI
Jaromczyk, Jerzy W.; Kowaluk, Mirosław Constructing the relative neighborhood graph in 3-dimensional Euclidean space. (English) Zbl 0757.05062 Discrete Appl. Math. 31, No. 2, 181-191 (1991). MSC: 05C35 PDF BibTeX XML Cite \textit{J. W. Jaromczyk} and \textit{M. Kowaluk}, Discrete Appl. Math. 31, No. 2, 181--191 (1991; Zbl 0757.05062) Full Text: DOI
Kowaluk, Miroslaw; Wagner, Klaus W. Vector language: Simple description of hard instances. (English) Zbl 0733.68051 Mathematical foundations of computer science, Proc. 15th Symp., MFCS ’90, Banská Bystrica/Czech. 1990, Lect. Notes Comput. Sci. 452, 378-384 (1990). MSC: 68Q45 68R05 68Q25 PDF BibTeX XML