| 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 | 69 | 2018 |
| Improved bounds for shortest paths in dense distance graphs P Gawrychowski, A Karczmarz arXiv preprint arXiv:1602.07013, 2016 | 28 | 2016 |
| 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 | 27 | 2017 |
| Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs A Karczmarz, J Łącki arXiv preprint arXiv:1907.02266, 2019 | 22 | 2019 |
| Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs A Karczmarz, J Łącki Symposium on Simplicity in Algorithms, 106-120, 2020 | 19 | 2020 |
| A Deterministic Parallel APSP Algorithm and its Applications A Karczmarz, P Sankowski Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 16 | 2021 |
| Decremental transitive closure and shortest paths for planar digraphs and beyond A Karczmarz Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 14 | 2018 |
| Decomposable submodular function minimization via maximum flow K Axiotis, A Karczmarz, A Mukherjee, P Sankowski, A Vladu International Conference on Machine Learning, 446-456, 2021 | 12 | 2021 |
| Contracting a Planar Graph Efficiently A Karczmarz, E Rotenberg, GF Italiano, J Holm, J Łącki, P Sankowski | 12* | 2017 |
| Fast and simple connectivity in graph timelines A Karczmarz, J Łącki Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015 | 10 | 2015 |
| Subquadratic dynamic path reporting in directed graphs against an adaptive adversary A Karczmarz, A Mukherjee, P Sankowski Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 9 | 2022 |
| Optimal Decremental Connectivity in Non-Sparse Graphs A Aamand, A Karczmarz, J Łącki, N Parotsidis, PMR Rasmussen, ... arXiv preprint arXiv:2111.09376, 2021 | 9 | 2021 |
| Planar Reachability Under Single Vertex or Edge Failures GF Italiano, A Karczmarz, N Parotsidis Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 9 | 2021 |
| Decremental SPQR-trees for Planar Graphs J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg arXiv preprint arXiv:1806.10772, 2018 | 9 | 2018 |
| Single-source shortest paths and strong connectivity in dynamic planar graphs P Charalampopoulos, A Karczmarz Journal of Computer and System Sciences 124, 97-111, 2022 | 8 | 2022 |
| Min-cost flow in unit-capacity planar graphs A Karczmarz, P Sankowski arXiv preprint arXiv:1907.02274, 2019 | 8 | 2019 |
| A simple mergeable dictionary A Karczmarz 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), 2016 | 8 | 2016 |
| Improved feature importance computation for tree models based on the Banzhaf value A Karczmarz, T Michalak, A Mukherjee, P Sankowski, P Wygocki Uncertainty in Artificial Intelligence, 969-979, 2022 | 7 | 2022 |
| Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems A Karczmarz arXiv preprint arXiv:2106.11744, 2021 | 6 | 2021 |
| Sensitivity and dynamic distance oracles via generic matrices and Frobenius form A Karczmarz, P Sankowski 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 5 | 2023 |
