Concepedia

Piotr Sankowski

PS

45

Publications

1.6K

Citations

22

H-Index

2004

Active since

Affiliations

University of Warsaw(Current)

Sapienza University of Rome

Tel Aviv University

University of Warmia and Mazury in Olsztyn

University of Copenhagen

Piotr Sankowski is an author at University of Warsaw specializing in engineering, combinatorial optimization, and computational complexity.

Top concepts

EngineeringCombinatorial OptimizationComputer ScienceComputational ComplexityGraph TheoryDiscrete MathematicsMathematical ProgrammingComputational GeometryNetwork AnalysisComputer Engineering

Publications per year

2004–2019

45

Publications

45

Maximum Matchings via Gaussian Elimination

Marcin Mucha, Piotr Sankowski · 2004 · 269 citations

Mathematical Programming, Engineering, Graph Theory +14

Faster dynamic matchings and vertex connectivity

Piotr Sankowski · Symposium on Discrete Algorithms · 2007 · 94 citations

Dynamic Subquadratic Algorithms, Engineering, Network Analysis +19

Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)

Piotr Sankowski · 2004 · 81 citations

Mathematical Programming, Computational Complexity Theory, Engineering +16

Improved algorithms for min cut and max flow in undirected planar graphs

Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski et al. · 2011 · 78 citations

Engineering, Min St-cut, Planar Graph +22

Round compression for parallel matching algorithms

Artur Czumaj, Jakub Łącki, Aleksander Mądry et al. · 2018 · 69 citations · Full text

Cluster Computing, Engineering, Distributed Algorithms +24

Rows per page

1–5 of 45