Konrad Majewski

According to our database, Konrad Majewski authored at least 9 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Parameterized dynamic data structure for Split Completion.

Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz

CoRR, 2024

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard.

Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023

Treedepth vs Circumference.

Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma

Comb., August, 2023

Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number.

Konrad Majewski, Michal Pilipczuk, Marek Sokolowski

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Simpler and faster algorithms for detours in planar digraphs.

Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Dynamic treewidth.

Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument.

Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Maintaining CMSO₂ properties on dynamic structures with bounded feedback vertex number.

Konrad Majewski, Michal Pilipczuk, Marek Sokolowski

CoRR, 2021

2020

The Asymmetric Travelling Salesman Problem In Sparse Digraphs.

Lukasz Kowalik, Konrad Majewski

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020