You are not logged in |
Back to the list of the institutes
Publications
Conference: Symposium on Simplicity in Algorithms
Number of publications: 52024
- C. S. Karthik, Dániel Marx, Marcin Pilipczuk , Uéverton Souza, Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof, 7th Symposium on Simplicity in Algorithms, Alexandria, the United States of America, 8 January 2024 - 10 January 2024. See in PBN
- Łukasz Kowalik , Alexandra Lassota, Konrad Majewski , Michał Pilipczuk , Marek Sokołowski , Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard, 7th Symposium on Simplicity in Algorithms, Alexandria, the United States of America, 8 January 2024 - 10 January 2024. See in PBN
- Antonio Casares, Marcin Pilipczuk , Michał Pilipczuk , Uéverton S. Souza, K. S. Thejaswini, Simple and tight complexity lower bounds for solving Rabin games, 7th Symposium on Simplicity in Algorithms, Alexandria, the United States of America, 8 January 2024 - 10 January 2024. See in PBN
2023
- Meike Hatzel, Konrad Majewski , Michał Pilipczuk , Marek Sokołowski , Simpler and faster algorithms for detours in planar digraphs, 2023 Symposium on Simplicity in Algorithms, Florencja, Italy, 23 January 2023 - 25 January 2023. See in PBN
2021
- Marcin Pilipczuk , Michał Pilipczuk , Paweł Rzążewski , Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths, 4th Symposium on Simplicity in Algorithms, Alexandria, VA, the United States of America, 11 January 2021 - 12 January 2021. See in PBN
