Publications

Konrad Majewski

2024

• Ł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
• Konrad Majewski , Tomáš Masařík , Jana Masaříková , Karolina Okrasa, Marcin Pilipczuk , Paweł Rzążewski , Marek Sokołowski , Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument, ACM Transactions on Computation Theory, 16 (2) 2024, p. 1-18. See in PBN
• Konrad Majewski , Michał Pilipczuk , Anna Zych-Pawlewicz , Parameterized Dynamic Data Structure for Split Completion, 32nd Annual European Symposium on Algorithms, London, the United Kingdom of Great Britain and Northern Ireland, 2 September 2024 - 4 September 2024. See in PBN

2023

• 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
• Marek Sokołowski , Michał Pilipczuk , Konrad Majewski , Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number, 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 7 March 2023 - 9 March 2023. See in PBN
• 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
• Gwenaël Joret, Konrad Majewski , Michał T. Seweryn, Roohani Sharma, Michał Seweryn, Piotr Micek, Marcin Briański, Treedepth vs circumference, Combinatorica, 43 2023, p. 659-664. See in PBN

2022

• Konrad Majewski , Tomáš Masařík , Jana Masaříková , Karolina Okrasa, Marcin Pilipczuk , Paweł Rzążewski , Marek Sokołowski , Max weight independent set in graphs with no long claws: An analog of the Gyárfás' path argument, Leibniz International Proceedings in Informatics, LIPIcs, 49th International Colloquium on Automata, Languages and Programming, Paris, France, 4 July 2022 - 8 July 2022. See in PBN

2020

• Łukasz Kowalik , Konrad Majewski , The Asymmetric Travelling Salesman Problem In Sparse Digraphs, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 December 2020 - 18 December 2020. See in PBN