The Asymmetric Travelling Salesman Problem In Sparse Digraphs. - Lukasz Kowalik; Konrad Majewski (IPEC, 2020)

Dynamic treewidth. - Tuukka Korhonen; Konrad Majewski; Wojciech Nadara; Michal Pilipczuk; Marek Sokolowski 001 (FOCS, 2023)

Simpler and faster algorithms for detours in planar digraphs. - Meike Hatzel; Konrad Majewski; Michal Pilipczuk; Marek Sokolowski 001 (SOSA, 2023)

Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number. - Konrad Majewski; Michal Pilipczuk; Marek Sokolowski 001 (STACS, 2023)

Treedepth vs Circumference. - Marcin Brianski; Gwenaël Joret; Konrad Majewski; Piotr Micek; Michal T. Seweryn; Roohani Sharma (Comb., 2023)

Parameterized Dynamic Data Structure for Split Completion. - Konrad Majewski; Michal Pilipczuk; Anna Zych-Pawlewicz (ESA, 2024)

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. - Lukasz Kowalik; Alexandra Lassota; Konrad Majewski; Michal Pilipczuk; Marek Sokolowski 001 (SOSA, 2024)

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 Masaríková; Karolina Okrasa; Marcin Pilipczuk; Pawel Rzazewski; Marek Sokolowski 001 (ACM Trans. Comput. Theory, 2024)

Maintaining CMSO2 properties on dynamic structures with bounded feedback vertex number. - Konrad Majewski; Michal Pilipczuk; Marek Sokolowski 001 (ACM Trans. Comput. Theory, 2025)