Follow
Marek Sokołowski
Marek Sokołowski
Verified email at mimuw.edu.pl - Homepage
Title
Cited by
Cited by
Year
Compact representation for matrices of bounded twin-width
M Pilipczuk, M Sokołowski, A Zych-Pawlewicz
arXiv preprint arXiv:2110.08106, 2021
202021
Graphs of bounded twin-width are quasi-polynomially χ-bounded
M Pilipczuk, M Sokołowski
Journal of Combinatorial Theory, Series B 161, 382-406, 2023
152023
Max weight independent set in graphs with no long claws: An analog of the gyárfás’ path argument
K Majewski, T Masařík, J Masaříková, K Okrasa, M Pilipczuk, P Rzążewski, ...
ACM Transactions on Computation Theory 16 (2), 1-18, 2024
92024
Flipper games for monadically stable graph classes
J Gajarský, N Mählmann, R McCarty, P Ohlmann, M Pilipczuk, ...
arXiv preprint arXiv:2301.13735, 2023
82023
Determining 4-edge-connected components in linear time
W Nadara, M Radecki, M Smulewicz, M Sokołowski
arXiv preprint arXiv:2105.01699, 2021
82021
Maintaining CMSO₂ properties on dynamic structures with bounded feedback vertex number
K Majewski, M Pilipczuk, M Sokołowski
40th International Symposium on Theoretical Aspects of Computer Science …, 2023
62023
Simpler and faster algorithms for detours in planar digraphs
M Hatzel, K Majewski, M Pilipczuk, M Sokołowski
Symposium on Simplicity in Algorithms (SOSA), 156-165, 2023
52023
Dynamic treewidth
T Korhonen, K Majewski, W Nadara, M Pilipczuk, M Sokołowski
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
42023
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard
Ł Kowalik, A Lassota, K Majewski, M Pilipczuk, M Sokołowski
2024 Symposium on Simplicity in Algorithms (SOSA), 279-285, 2024
12024
Bounds on half graph orders in powers of sparse graphs
M Sokołowski
Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021
12021
Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
T Korhonen, M Sokołowski
arXiv preprint arXiv:2402.12364, 2024
2024
Elementary first-order model checking for sparse graphs
J Gajarský, M Pilipczuk, M Sokołowski, G Stamoulis, S Toruńczyk
arXiv preprint arXiv:2401.16230, 2024
2024
Exact Shortest Paths with Rational Weights on the Word RAM
A Karczmarz, W Nadara, M Sokołowski
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
2024
Fully dynamic approximation schemes on planar and apex-minor-free graphs
T Korhonen, W Nadara, M Pilipczuk, M Sokołowski
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
2024
Sparse Graphs of Twin-width 2 Have Bounded Tree-width
B Bergougnoux, J Gajarský, G Guśpiel, P Hliněný, F Pokrývka, ...
arXiv preprint arXiv:2307.01732, 2023
2023
Maintaining properties on dynamic structures with bounded feedback vertex number
K Majewski, M Pilipczuk, M Sokołowski
arXiv preprint arXiv:2107.06232, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–16