Publications

Conference: International Symposium on Algorithms and Computation

Number of publications: 11

2025

• Paweł Rzążewski , Maria Chudnovsky, Jadwiga Czyżewska, Kacper Kluk , Marcin Pilipczuk , Sparse Induced Subgraphs in P7-Free Graphs of Bounded Clique Number, 36th International Symposium on Algorithms and Computation, Tainan, Taiwan (Province of China), 6 December 2025 - 9 December 2025. See in PBN

2024

• Michał Włodarczyk , Constant Approximating Disjoint Paths on Acyclic Digraphs Is W[1]-Hard, 35th International Symposium on Algorithms and Computation, Sydney, Australia, 8 December 2024 - 11 December 2024. See in PBN
• Michał Włodarczyk , Does Subset Sum Admit Short Proofs?, 35th International Symposium on Algorithms and Computation, Sydney, Australia, 8 December 2024 - 11 December 2024. See in PBN
• Sankardeep Chakraborty, Kunihiko Sadakane, Wiktor Zuba , Enhancing Generalized Compressed Suffix Trees, with Applications, 35th International Symposium on Algorithms and Computation, Sydney, Australia, 8 December 2024 - 11 December 2024. See in PBN

2023

• Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk , 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

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

• 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