| 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 | 99 | 2018 |
| 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 | 61 | 2018 |
| Improved deterministic algorithms for decremental reachability and strongly connected components J £±cki ACM Transactions on Algorithms (TALG) 9 (3), 1-15, 2013 | 61 | 2013 |
| Near-optimal massively parallel graph connectivity S Behnezhad, L Dhulipala, H Esfandiari, J Lacki, V Mirrokni 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 57 | 2019 |
| Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time J £±cki, P Sankowski European Symposium on Algorithms, 155-166, 2011 | 49 | 2011 |
| The power of dynamic distance oracles: Efficient dynamic algorithms for the steiner tree J £±cki, J Oęwieja, M Pilipczuk, P Sankowski, A Zych Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 42 | 2015 |
| Single source--All sinks max flows in planar digraphs J Lacki, Y Nussbaum, P Sankowski, C Wulff-Nilsen 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 599-608, 2012 | 42 | 2012 |
| Massively parallel computation via remote memory access S Behnezhad, L Dhulipala, H Esfandiari, J £±cki, V Mirrokni, W Schudy ACM Transactions on Parallel Computing 8 (3), 1-25, 2021 | 40 | 2021 |
| Faster algorithms for Markov decision processes with low treewidth K Chatterjee, J £±cki International Conference on Computer Aided Verification, 543-558, 2013 | 36 | 2013 |
| Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time S Behnezhad, J £±cki, V Mirrokni Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 35 | 2020 |
| Algorithmic complexity of power law networks P Brach, M Cygan, J £±cki, P Sankowski Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 32 | 2016 |
| Decremental single-source reachability and strongly connected components in O (m√ n) total update time S Chechik, TD Hansen, GF Italiano, J £±cki, N Parotsidis 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 29 | 2016 |
| Walking randomly, massively, and efficiently J £±cki, S Mitrovię, K Onak, P Sankowski Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 26 | 2020 |
| Community detection on evolving graphs A Anagnostopoulos, J £±cki, S Lattanzi, S Leonardi, M Mahdian Advances in Neural Information Processing Systems 29, 2016 | 25 | 2016 |
| Scalable community detection via parallel correlation clustering J Shi, L Dhulipala, D Eisenstat, J £±cki, V Mirrokni arXiv preprint arXiv:2108.01731, 2021 | 24 | 2021 |
| Decremental single-source reachability in planar digraphs GF Italiano, A Karczmarz, J £±cki, P Sankowski Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 24 | 2017 |
| Hierarchical agglomerative graph clustering in nearly-linear time L Dhulipala, D Eisenstat, J £±cki, V Mirrokni, J Shi International conference on machine learning, 2676-2686, 2021 | 21 | 2021 |
| Reliable hubs for partially-dynamic all-pairs shortest paths in directed graphs A Karczmarz, J £±cki arXiv preprint arXiv:1907.02266, 2019 | 21 | 2019 |
| Connected components at scale via local contractions J £±cki, V Mirrokni, M W³odarczyk arXiv preprint arXiv:1807.10727, 2018 | 21 | 2018 |
| Improved deterministic algorithms for decremental transitive closure and strongly connected components J £±cki Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 21 | 2011 |
Piotr SankowskiIDEAS NCBR, MIM Solutions, Warsaw UniversityPreverjeni e-po¹tni naslov na mimuw.edu.pl
