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
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
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
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; 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
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
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