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