Publications

Conference: International Symposium on Algorithms and Computation

Number of publications: 10

2023

• Michał Włodarczyk , Bart M. P. Jansen, Jari J. H. de Kroon, Single-Exponential FPT Algorithms for Enumerating Secluded F-Free Subgraphs and Deleting to Scattered Graph Classes, The 34th International Symposium on Algorithms and Computation (ISAAC 2023), Kyoto, Japan, 4 December 2023 - 6 December 2023, 283 2023, p. 42:1-42:18. See in PBN
• Benjamin Bergougnoux, Jakub Gajarský , Grzegorz Guśpiel, Petr Hliněný, Filip Pokrývka, Marek Sokołowski , Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width, The 34th International Symposium on Algorithms and Computation (ISAAC 2023), Kyoto, Japan, 4 December 2023 - 6 December 2023. See in PBN

2022

• Michał Dębski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Paweł Rzążewski , Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Seoul, the Republic of Korea, 18 December 2022 - 20 December 2022. See in PBN
• Pavel Dvořák, Tomáš Masařík , Jana Masaříková , Paweł Rzążewski , Aneta Żuk, Monika Krawczyk, List Locally Surjective Homomorphisms in Hereditary Graph Classes, Leibniz International Proceedings in Informatics, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Seoul, the Republic of Korea, 18 December 2022 - 20 December 2022, 248 2022, p. 30:1-30:15. See in PBN

2021

• Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski , Pattern Masking for Dictionary Matching, International Symposium on Algorithms and Computation, Fukuoka, Japan, 6 December 2021 - 8 December 2021. See in PBN

2020

• Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Paweł Rzążewski , Sparsification Lower Bounds for List H-Coloring, 31st International Symposium on Algorithms and Computation (ISAAC), Hong Kong, China, 13 December 2020 - 17 December 2020. See in PBN
• Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk , Manuel Sorge, The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs, 31st International Symposium on Algorithms and Computation, online, Hong Kong, 14 December 2020 - 18 December 2020. See in PBN

2019

• Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Internal Dictionary Matching, 30th International Symposium on Algorithms and Computation, Shanghai, China, 9 December 2019 - 11 December 2019, 149 (22) 2019, p. 1-17. See in PBN

2017

• Piotr Sankowski , Piotr Wygocki , Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrtloglogn, 28th International Symposium on Algorithms and Computation, Phuket, Thailand, 9 December 2017 - 12 December 2017. See in PBN

2016

• Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Pattern Matching and Consensus Problems on Weighted Sequences and Profiles, 27th International Symposium on Algorithms and Computation, Sydney, Australia, 12 December 2016 - 14 December 2016. See in PBN