Maximum matchings via Gaussian elimination M Mucha, P Sankowski
45th Annual IEEE Symposium on Foundations of Computer Science, 248-255, 2004
375 2004 Improved algorithms for min cut and max flow in undirected planar graphs GF Italiano, Y Nussbaum, P Sankowski, C Wulff-Nilsen
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
150 2011 Dynamic transitive closure via dynamic matrix inverse P Sankowski
45th Annual IEEE Symposium on Foundations of Computer Science, 509-517, 2004
138 2004 Faster dynamic matchings and vertex connectivity P Sankowski
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
134 2007 Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m 10/7 log W ) Time MB Cohen, A Mądry, P Sankowski, A Vladu
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
121 2017 Round compression for parallel matching algorithms A Czumaj, J Łącki, A Mądry, S Mitrović, K Onak, P Sankowski
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
105 2018 Maximum weight bipartite matching in matrix multiplication time P Sankowski
Theoretical Computer Science 410 (44), 4480-4488, 2009
98 * 2009 Stochastic analyses for online combinatorial optimization problems N Garg, A Gupta, S Leonardi, P Sankowski
Carnegie Mellon University, 2008
82 2008 Algorithmic applications of baur-strassen’s theorem: Shortest cycles, diameter, and matchings M Cygan, HN Gabow, P Sankowski
Journal of the ACM (JACM) 62 (4), 1-30, 2015
73 2015 Optimal dynamic strings P Gawrychowski, A Karczmarz, T Kociumaka, J Łącki, P Sankowski
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
72 2018 Spin-dependent tunneling in modulated structures of (Ga, Mn) As P Sankowski, P Kacman, JA Majewski, T Dietl
Physical Review B—Condensed Matter and Materials Physics 75 (4), 045306, 2007
68 2007 Online bipartite matching in offline time B Bosek, D Leniowski, P Sankowski, A Zych
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 384-393, 2014
67 2014 Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time G Borradaile, P Sankowski, C Wulff-Nilsen
ACM Transactions on Algorithms (TALG) 11 (3), 1-29, 2015
65 2015 Set covering with our eyes closed F Grandoni, A Gupta, S Leonardi, P Miettinen, P Sankowski, M Singh
SIAM Journal on Computing 42 (3), 808-830, 2013
63 * 2013 Single valued combinatorial auctions with budgets A Fiat, S Leonardi, J Saia, P Sankowski
Proceedings of the 12th ACM conference on Electronic commerce, 223-232, 2011
61 2011 Interlayer exchange coupling in (Ga, Mn) As-based superlattices P Sankowski, P Kacman
Physical Review B—Condensed Matter and Materials Physics 71 (20), 201303, 2005
61 2005 Maximum matchings in planar graphs via Gaussian elimination M Mucha, P Sankowski
Algorithmica 45, 3-20, 2006
56 2006 Revenue maximizing envy-free multi-unit auctions with budgets M Feldman, A Fiat, S Leonardi, P Sankowski
Proceedings of the 13th ACM conference on electronic commerce, 532-549, 2012
55 2012 Min-Cuts and Shortest Cycles in Planar Graphs in O (n loglogn ) Time J Łącki, P Sankowski
European Symposium on Algorithms, 155-166, 2011
54 2011 Voltage-controlled spin injection in a P Van Dorpe, W Van Roy, J De Boeck, G Borghs, P Sankowski, P Kacman, ...
Physical Review B—Condensed Matter and Materials Physics 72 (20), 205322, 2005
53 2005 