Determining 4-Edge-Connected Components in Linear Time. - Wojciech Nadara; Mateusz Radecki; Marcin Smulewicz; Marek Sokolowski 001 (ESA, 2021)

Compact Representation for Matrices of Bounded Twin-Width. - Michal Pilipczuk; Marek Sokolowski 001; Anna Zych-Pawlewicz (STACS, 2022)

Graphs of bounded twin-width are quasi-polynomially χ-bounded. - Michal Pilipczuk; Marek Sokolowski 001 (CoRR, 2022)

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

Flipper Games for Monadically Stable Graph Classes. - Jakub Gajarský; Nikolas Mählmann; Rose McCarty; Pierre Ohlmann; Michal Pilipczuk; Wojciech Przybyszewski; Sebastian Siebertz; Marek Sokolowski 001; Szymon Torunczyk (ICALP, 2023)

Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. - Benjamin Bergougnoux; Jakub Gajarský; Grzegorz Guspiel; Petr Hlinený; Filip Pokrývka; Marek Sokolowski 001 (ISAAC, 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)

Bounds on Half Graph Orders in Powers of Sparse Graphs. - Marek Sokolowski 001 (Electron. J. Comb., 2023)

Graphs of bounded twin-width are quasi-polynomially χ-bounded. - Michal Pilipczuk; Marek Sokolowski 001 (J. Comb. Theory B, 2023)

Elementary first-order model checking for sparse graphs. - Jakub Gajarský; Michal Pilipczuk; Marek Sokolowski 001; Giannos Stamoulis; Szymon Torunczyk (LICS, 2024)

Exact Shortest Paths with Rational Weights on the Word RAM. - Adam Karczmarz; Wojciech Nadara; Marek Sokolowski 001 (SODA, 2024)

Fully dynamic approximation schemes on planar and apex-minor-free graphs. - Tuukka Korhonen; Wojciech Nadara; Michal Pilipczuk; Marek Sokolowski 001 (SODA, 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)

Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth. - Tuukka Korhonen; Marek Sokolowski 001 (STOC, 2024)

Half-integral Erdös-Pósa property for non-null S-T paths. - Vera Chekan; Colin Geniet; Meike Hatzel; Michal Pilipczuk; Marek Sokolowski 001; Michal T. Seweryn; Marcin Witkowski (CoRR, 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)

Fully Dynamic Biconnectivity in Õ(log² n) Time. - Jacob Holm; Wojciech Nadara; Eva Rotenberg; Marek Sokolowski 001 (STOC, 2025)

Low rank MSO. - Mikolaj Bojanczyk; Michal Pilipczuk; Wojciech Przybyszewski; Marek Sokolowski 001; Giannos Stamoulis (CoRR, 2025)

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

Treedepth Inapproximability and Exponential ETH Lower Bound. - Édouard Bonnet; Daniel Neuen; Marek Sokolowski 001 (CoRR, 2025)