Scholar

Marek Sokołowski

Google Scholar ID: 5H3JOJgAAAAJ

University of Warsaw

graph algorithmsparameterized complexity

Homepage↗Google Scholar↗

Citations & Impact

All-time

Citations

163

H-index

8

i10-index

6

Publications

20

Co-authors

0

Contact

Publications

8 items

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions

2026

Cited

0

Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP

2025

Cited

0

Treedepth Inapproximability and Exponential ETH Lower Bound

2025

Cited

0

Fully dynamic biconnectivity in $ ilde{mathcal{O}}(log^2 n)$ time

2025

Cited

0

2025

Cited

0

Elementary first-order model checking for sparse graphs

Logic in Computer Science · 2024

Cited

2

Flipper games for monadically stable graph classes

International Colloquium on Automata, Languages and Programming · 2023

Cited

14

Maintaining $mathsf{CMSO}_2$ properties on dynamic structures with bounded feedback vertex number

2021

Cited

0

Resume (English only)

Co-authors

0 total

Co-authors: 0 (list not available)