Konrad Majewski

18 papers A* 2A 2B 1Journal 11Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Maintaining CMSO
ACM Trans. Comput. Theory
Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2024 — conf
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard.
SOSA
Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2024 J jnl
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument.
ACM Trans. Comput. Theory
Konrad Majewski, Tomás Masarík, Jana Masaríková, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2024 A conf
Parameterized Dynamic Data Structure for Split Completion.
ESA
Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz
2024 J jnl
Parameterized dynamic data structure for Split Completion.
CoRR
Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz
2023 J jnl
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard.
CoRR
Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023 A* conf
Dynamic treewidth.
FOCS
Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
2023 J jnl
Dynamic treewidth.
CoRR
Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
2023 A conf
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number.
STACS
Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023 — conf
Simpler and faster algorithms for detours in planar digraphs.
SOSA
Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023 J jnl
Simpler and faster algorithms for detours in planar digraphs.
CoRR
Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023 J jnl
Treedepth vs Circumference.
Comb.
Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma
2022 A* conf
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument.
ICALP
Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2022 J jnl
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument.
CoRR
Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2022 J jnl
Treedepth vs circumference.
CoRR
Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma
2021 J jnl
Maintaining CMSO
CoRR
Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2020 B conf
The Asymmetric Travelling Salesman Problem In Sparse Digraphs.
IPEC
Lukasz Kowalik, Konrad Majewski
2020 J jnl
The Asymmetric Travelling Salesman Problem in Sparse Digraphs.
CoRR
Lukasz Kowalik, Konrad Majewski