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 | 40 | 2018 |

Improved bounds for shortest paths in dense distance graphs P Gawrychowski, A Karczmarz arXiv preprint arXiv:1602.07013, 2016 | 27 | 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 | 19 | 2017 |

Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs A Karczmarz, J Łącki arXiv preprint arXiv:1907.02266, 2019 | 11 | 2019 |

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 | 11 | 2018 |

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 | 10 | 2020 |

Min-cost flow in unit-capacity planar graphs A Karczmarz, P Sankowski arXiv preprint arXiv:1907.02274, 2019 | 8 | 2019 |

Contracting a Planar Graph Efficiently A Karczmarz, E Rotenberg, GF Italiano, J Holm, J Łącki, P Sankowski | 8* | 2017 |

Fast and simple connectivity in graph timelines A Karczmarz, J Łącki Workshop on Algorithms and Data Structures, 458-469, 2015 | 8 | 2015 |

Decremental SPQR-trees for Planar Graphs J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg arXiv preprint arXiv:1806.10772, 2018 | 5 | 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 | 4 | 2021 |

A Deterministic Parallel APSP Algorithm and its Applications A Karczmarz, P Sankowski Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 4 | 2021 |

A simple mergeable dictionary A Karczmarz 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), 2016 | 4 | 2016 |

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 | 3 | 2022 |

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 | 1 | 2021 |

Data structures and dynamic algorithms for planar graphs A Karczmarz | 1 | 2019 |

Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary A Karczmarz, A Mukherjee, P Sankowski arXiv preprint arXiv:2203.16992, 2022 | | 2022 |

Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths A Karczmarz Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | | 2022 |

Optimal Decremental Connectivity in Non-Sparse Graphs A Aamand, A Karczmarz, J Łącki, N Parotsidis, PMR Rasmussen, ... arXiv preprint arXiv:2111.09376, 2021 | | 2021 |

Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf A Karczmarz, A Mukherjee, P Sankowski, P Wygocki arXiv preprint arXiv:2108.04126, 2021 | | 2021 |