Publikacje

Konferencja: IEEE Symposium on Foundations of Computer Science

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 listopada 2023 - 9 listopada 2023. Zobacz w 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 listopada 2023 - 9 listopada 2023. Zobacz w 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 listopada 2023 - 9 listopada 2023. Zobacz w 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 listopada 2023 - 9 listopada 2023. Zobacz w 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 listopada 2023 - 9 listopada 2023. Zobacz w 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 listopada 2023 - 9 listopada 2023. Zobacz w 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 lutego 2022 - 10 lutego 2022. Zobacz w 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 listopada 2019 - 12 listopada 2019. Zobacz w 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 listopada 2019 - 12 listopada 2019. Zobacz w 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 października 2018 - 9 października 2018. Zobacz w PBN
• Michał Włodarczyk , Marek Adamczyk, Random Order Contention Resolution Schemes, 59th Annual IEEE Symposium on Foundations of Computer Science, Paris, France, 7 października 2018 - 9 października 2018. Zobacz w 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 października 2017 - 17 października 2017. Zobacz w 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 października 2006 - 24 października 2006. Zobacz w PBN