Publications

Conference: ACM Symposium on Theory of Computing

2025

• Jacob Holm, Wojciech Nadara , Eva Rotenberg, Marek Sokołowski, Fully Dynamic Biconnectivity in Õ(log² n) Time, The 57th Annual ACM Symposium on Theory of Computing, Prague, Czechia, 23 June 2025 - 27 June 2025. See in PBN
• Jan Dreier, Szymon Toruńczyk , Merge-Width and First-Order Model Checking, The 57th Annual ACM Symposium on Theory of Computing, Prague, Czechia, 23 June 2025 - 27 June 2025. See in PBN
• Clotilde Bizière, Wojciech Czerwiński , Reachability in One-Dimensional Pushdown Vector Addition Systems Is Decidable, The 57th Annual ACM Symposium on Theory of Computing, Prague, Czechia, 23 June 2025 - 27 June 2025. See in PBN

2024

• Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk , Mikkel Thorup, Shuyi Yan, Hanwen Zhang, Combinatorial Correlation Clustering, 56th Annual ACM Symposium on Theory of Computing, Vancouver, Canada, 24 June 2024 - 28 June 2024, 20 2024, p. 1617-1628. See in PBN
• Jan Dreier, Nikolas Mählmann, Szymon Toruńczyk , Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes, 56th Annual ACM Symposium on Theory of Computing, Vancouver, Canada, 24 June 2024 - 28 June 2024, 69 2024, p. 1550-1560. See in PBN
• Paweł Rzążewski , Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Michał Pilipczuk, Marcin Pilipczuk, Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time, 56th Annual ACM Symposium on Theory of Computing, Vancouver, Canada, 23 June 2024 - 27 June 2024. See in PBN

2022

• Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk , Magnus Wahlström, Directed flow-augmentation, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 June 2022 - 24 June 2022. See in PBN
• Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 June 2022 - 24 June 2022. See in PBN
• Bart M. P. Jansen, Michał Włodarczyk , Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 June 2022 - 24 June 2022. See in PBN
• Adam Karczmarz , Anish Mukherjee, Piotr Sankowski , Subquadratic dynamic path reporting in directed graphs against an adaptive adversary, SYMPOSIUM ON THEORY OF COMPUTING, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 June 2022 - 24 June 2022. See in PBN
• Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Toruńczyk , Twin-width IV: ordered graphs and matrices, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 June 2022 - 24 June 2022. See in PBN

2021

• Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Paweł Rzążewski , Finding large induced sparse subgraphs in C>t -free graphs in quasipolynomial time, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 21 June 2021 - 25 June 2021. See in PBN
• Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk , Vertex deletion parameterized by elimination distance and even less, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 21 June 2021 - 25 June 2021. See in PBN

2020

• Daniel Lokshtanov, Pranabendu Misra, Michał Pilipczuk , Saket Saurabh, Meirav Zehavi, An exponential time parameterized algorithm for planar disjoint paths, 52nd ACM Symposium on Theory of Computing, Chicago, the United States of America, 22 June 2020 - 26 June 2020. See in PBN
• Jakub Łącki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski , Walking randomly, massively, and efficiently, SYMPOSIUM ON THEORY OF COMPUTING, 52nd ACM Symposium on Theory of Computing, Chicago, the United States of America, 22 June 2020 - 26 June 2020. See in PBN

2019

• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazić, Jérôme Leroux, Filip Mazowiecki , The reachability problem for Petri nets is not elementary, 51st ACM Symposium on Theory of Computing, Phoenix, the United States of America, 23 June 2019 - 26 June 2019. See in PBN

2017

• Giuseppe F. Italiano, Adam Karczmarz , Piotr Sankowski , Jakub Łącki, Decremental Single-source Reachability in Planar Digraphs, 49th ACM Symposium on Theory of Computing, Montreal, Canada, 19 June 2017 - 23 June 2017. See in PBN