Publications

Conference: IEEE Symposium on Foundations of Computer Science

Number of publications: 16

2024

• Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michał Pilipczuk , Szymon Toruńczyk , First-Order Model Checking on Monadically Stable Graph Classes, 65th IEEE Symposium on Foundations of Computer Science, Chicago, the United States of America, 27 October 2024 - 30 October 2024. See in PBN
• Tuukka Korhonen, Michał Pilipczuk , Giannos Stamoulis, Minor Containment and Disjoint Paths in Almost-Linear Time, 65th IEEE Symposium on Foundations of Computer Science, Chicago, the United States of America, 27 October 2024 - 30 October 2024. See in PBN
• Dmitry Chistikov, Wojciech Czerwiński , Filip Mazowiecki, Łukasz Orlikowski, Henry Sinclair-Banks, Karol Węgrzycki, The Tractability Border of Reachability in Simple Vector Addition Systems with States, 65th IEEE Symposium on Foundations of Computer Science, Chicago, the United States of America, 27 October 2024 - 30 October 2024. See in PBN

2023

• Jan van den Brand, Adam Karczmarz , Deterministic Fully Dynamic SSSP and More, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN
• Tuukka Korhonen, Konrad Majewski , Wojciech Nadara , Michał Pilipczuk , Marek Sokołowski , Dynamic treewidth, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN
• Szymon Toruńczyk , Flip-width: Cops and Robber on dense graphs, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN
• Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk , Michał Pilipczuk , Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1*, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN
• Meirav Zehavi, Michał Włodarczyk , Planar Disjoint Paths, Treewidth, and Kernels, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN
• Adam Karczmarz , Piotr Sankowski , Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN

2022

• Wojciech Czerwiński , Łukasz Orlikowski, Reachability in Vector Addition Systems is Ackermann-complete, 62nd IEEE Annual Symposium on Foundations of Computer Science, Denver, the United States of America, 7 February 2022 - 10 February 2022. See in PBN

2019

• Vincent Cohen-Addad, Michał Pilipczuk , Marcin Pilipczuk , A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs, 60th Annual IEEE Symposium on Foundations of Computer Science, Baltimore, Maryland, the United States of America, 9 November 2019 - 12 November 2019. See in PBN
• Nicola Galesi, Leszek Kołodziejczyk , Neil Thapen, Polynomial Calculus Space and Resolution Width, 60th Annual IEEE Symposium on Foundations of Computer Science, Baltimore, Maryland, the United States of America, 9 November 2019 - 12 November 2019. See in PBN

2018

• Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs, 59th Annual IEEE Symposium on Foundations of Computer Science, Paris, France, 7 October 2018 - 9 October 2018. See in PBN
• Michał Włodarczyk , Marek Adamczyk, Random Order Contention Resolution Schemes, 59th Annual IEEE Symposium on Foundations of Computer Science, Paris, France, 7 October 2018 - 9 October 2018. See in PBN

2017

• Parinya Chalermsook, Marek Cygan , Guy Kortsarz, Pasin Manurangsi, Bundit Laekhanukit, Danupon Nanongkai, Luca Trevisan, From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More, 58th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, the United States of America, 15 October 2017 - 17 October 2017. See in PBN

2006

• Krzysztof Onak, Paweł Parys , Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders, 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), Berkeley, the United States of America, 21 October 2006 - 24 October 2006. See in PBN