Maximum matchings via Gaussian elimination M Mucha, P Sankowski 45th Annual IEEE Symposium on Foundations of Computer Science, 248-255, 2004 | 323 | 2004 |

Dynamic transitive closure via dynamic matrix inverse P Sankowski 45th Annual IEEE Symposium on Foundations of Computer Science, 509-517, 2004 | 120 | 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 | 108 | 2011 |

Faster dynamic matchings and vertex connectivity P Sankowski Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007 | 101 | 2007 |

Maximum weight bipartite matching in matrix multiplication time P Sankowski Theoretical Computer Science 410 (44), 4480-4488, 2009 | 79* | 2009 |

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (*m*^{10/7} log *W*) TimeMB Cohen, A Mądry, P Sankowski, A Vladu Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 68 | 2017 |

Stochastic analyses for online combinatorial optimization problems N Garg, A Gupta, S Leonardi, P Sankowski Carnegie Mellon University, 2008 | 66 | 2008 |

Round compression for parallel matching algorithms A Czumaj, J Łacki, A Madry, S Mitrovic, K Onak, P Sankowski SIAM Journal on Computing 49 (5), STOC18-1-STOC18-44, 2019 | 63 | 2019 |

Spin-dependent tunneling in modulated structures of (Ga, Mn) As P Sankowski, P Kacman, JA Majewski, T Dietl Physical Review B 75 (4), 045306, 2007 | 63 | 2007 |

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 | 51 | 2011 |

Maximum matchings in planar graphs via Gaussian elimination M Mucha, P Sankowski Algorithmica 45 (1), 3-20, 2006 | 50 | 2006 |

Interlayer exchange coupling in (Ga, Mn) As-based superlattices P Sankowski, P Kacman Physical Review B 71 (20), 201303, 2005 | 50 | 2005 |

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 | 49 | 2012 |

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 | 48 | 2015 |

Min *st*-Cut Oracle for Planar Graphs with Near-Linear Preprocessing TimeG Borradaile, P Sankowski, C Wulff-Nilsen ACM Transactions on Algorithms (TALG) 11 (3), 1-29, 2015 | 48 | 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 | 48* | 2013 |

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 | 43 | 2014 |

Network sparsification for Steiner problems on planar and bounded-genus graphs M Pilipczuk, M Pilipczuk, P Sankowski, EJ Van Leeuwen 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 276-285, 2014 | 43 | 2014 |

Voltage-controlled spin injection in a (Ga, Mn) As∕(Al, Ga) As Zener diode P Van Dorpe, W Van Roy, J De Boeck, G Borghs, P Sankowski, P Kacman, ... Physical Review B 72 (20), 205322, 2005 | 40 | 2005 |

Subexponential-time parameterized algorithm for Steiner tree on planar graphs M Pilipczuk, MP Pilipczuk, EJ van Leeuwen, P Sankowski Dagstuhl Publishing, 2013 | 36 | 2013 |