Get started
Author

Piotr Sankowski

Maximum Matchings via Gaussian Elimination
2004 · M. Mucha, P. Sankowski · Annual Symposium on Foundations of Computer Science · 268
Faster dynamic matchings and vertex connectivity
2007 · Piotr Sankowski · Symposium on Discrete Algorithms · 91
Improved algorithms for min cut and max flow in undirected planar graphs
2011 · Giuseppe F. Italiano, Yahav Nussbaum, et al. · ACM Symposium on Theory of Computing (STOC) · 77
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)
2004 · P. Sankowski · Annual Symposium on Foundations of Computer Science · 77
Round compression for parallel matching algorithms
2018 · Artur Czumaj, Jakub Łącki, et al. · ACM SIGACT Symposium on Theory of Computing (STOC) · 67
Interlayer exchange coupling in (Ga,Mn)As-based superlattices
2005 · P. Sankowski, P. Kacman · Physical Review B · 62
PDF
Single valued combinatorial auctions with budgets
2011 · Amos Fiat, Stefano Leonardi, et al. · ACM Conference on Electronic Commerce (EC) · 61
Maximum weight bipartite matching in matrix multiplication time
2009 · Piotr Sankowski · Theoretical Computer Science · 55
PDF
Stochastic Analyses for Online Combinatorial Optimization Problems
2008 · Naveen Garg, Anupam Gupta, et al. · 54
Spin-dependent tunneling in modulated structures of (Ga,Mn)As
2007 · P. Sankowski, P. Kacman, et al. · Physical Review B · 52
PDF
Revenue maximizing envy-free multi-unit auctions with budgets
2012 · Michal Feldman, Amos Fiat, et al. · ACM Conference on Electronic Commerce (EC) · 50
Maximum matchings in planar graphs via gaussian elimination
2006 · Marcin Mucha, Piotr Sankowski · Algorithmica · 49
Online Bipartite Matching in Offline Time
2014 · Bartlomiej Bosek, Dariusz Leniowski, et al. · Annual Symposium on Foundations of Computer Science · 43
Optimal Dynamic Strings
2018 · Paweł Gawrychowski, Adam Karczmarz, et al. · Society for Industrial and Applied Mathematics eBooks · 40
PDF
Algorithmic Applications of Baur-Strassen’s Theorem
2015 · Marek Cygan, Harold N. Gabow, et al. · Journal of the ACM · 40
Maximum Matchings in Planar Graphs via Gaussian Elimination
2004 · Marcin Mucha, Piotr Sankowski · Lecture notes in computer science · 39
Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
2015 · Glencora Borradaile, Piotr Sankowski, et al. · ACM Transactions on Algorithms · 37
Voltage-controlled spin injection in a ( Ga , Mn ) As ∕ ( Al , Ga ) As Zener diode
2005 · P. Van Dorpe, W. Van Roy, et al. · Physical Review B · 37
PDF
Subquadratic Algorithm for Dynamic Shortest Distances
2005 · Piotr Sankowski · Lecture notes in computer science · 37
The Power of Dynamic Distance Oracles
2015 · Jakub Łącki, Jakub Oćwieja, et al. · ACM Symposium on Theory of Computing (STOC) · 34
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m 10/7 log W) Time.
2016 · Michael B. Cohen, Aleksander Mądry, et al. · arXiv (Cornell University) · 32
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
2018 · Marcin Pilipczuk, Michał Pilipczuk, et al. · ACM Transactions on Algorithms · 28
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
2011 · Jakub Łącki, Piotr Sankowski · Lecture notes in computer science · 28
Network formation games with local coalitions
2007 · Stefano Leonardi, Piotr Sankowski · ACM Symposium on Principles of Distributed Computing (PODC) · 28
Shortest Paths in Matrix Multiplication Time
2005 · Piotr Sankowski · Lecture notes in computer science · 27
Works count: 214
Citation count: 2,310
H-index: 26
I10-index: 61
Year
Topic
Type