Scholar
Marek Sokołowski
Google Scholar ID: 5H3JOJgAAAAJ
University of Warsaw
graph algorithms
parameterized complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
163
H-index
8
i10-index
6
Publications
20
Co-authors
0
Contact
CV
Open ↗
Publications
14 items
Time-Optimal APSP and Matrix Multiplication in Classes of Linear Neighborhood Complexity
2026
Cited
0
A tight lower bound for malicious online bipartite matching with limited recourse budget
2026
Cited
0
Multiway $f$-Cut is fixed-parameter tractable
2026
Cited
0
An Erdős-Pósa theorem for cycles and faces of distinct lengths
2026
Cited
0
Fast decremental tree sums in forests
2026
Cited
0
Dynamic Detours
2026
Cited
0
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
Load more
