| 2026 | ESA | Strongly Polynomial Parallel Maximum Flow Revisited. | Adam Karczmarz, Pawel Pilarski |
| 2026 | SODA | Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP. | Adam Karczmarz, Wojciech Nadara, Marek Sokolowski |
| 2025 | AAAI | Accurate Estimation of Feature Importance Faithfulness for Tree Models. | Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski |
| 2025 | ICALP | Fully Dynamic Algorithms for Transitive Reduction. | Gramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis |
| 2025 | ICALP | On Incremental Approximate Shortest Paths in Directed Graphs. | Adam Grkiewicz, Adam Karczmarz |
| 2025 | SODA | Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs. | Vikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz |
| 2025 | SODA | Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decrementai reachability, and more. | Adam Karczmarz, Da Wei Zheng |
| 2025 | SPAA | A Deterministic Work-Depth Tradeoff for Strongly Connected Components. | Adam Karczmarz, Bartlomiej Lewandowski |
| 2024 | ICALP | Fully Dynamic Strongly Connected Components in Planar Digraphs. | Adam Karczmarz, Marcin Smulewicz |
| 2024 | SODA | Max | Adam Karczmarz |
| 2024 | SODA | Exact Shortest Paths with Rational Weights on the Word RAM. | Adam Karczmarz, Wojciech Nadara, Marek Sokolowski |
| 2023 | ESA | On Fully Dynamic Strongly Connected Components. | Adam Karczmarz, Marcin Smulewicz |
| 2023 | FOCS | Deterministic Fully Dynamic SSSP and More. | Jan van den Brand, Adam Karczmarz |
| 2023 | FOCS | Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. | Adam Karczmarz, Piotr Sankowski |
| 2023 | ICALP | Optimal Decremental Connectivity in Non-Sparse Graphs. | Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup |
| 2023 | ICALP | Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. | Adam Karczmarz, Piotr Sankowski |
| 2022 | SODA | Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths. | Adam Karczmarz |
| 2022 | STOC | Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. | Adam Karczmarz, Anish Mukherjee, Piotr Sankowski |
| 2022 | UAI | Improved feature importance computation for tree models based on the Banzhaf value. | Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki |
| 2021 | ICALP | Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. | Adam Karczmarz |
| 2021 | ICML | Decomposable Submodular Function Minimization via Maximum Flow. | Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu |
| 2021 | SODA | Planar Reachability Under Single Vertex or Edge Failures. | Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis |
| 2021 | SODA | A Deterministic Parallel APSP Algorithm and its Applications. | Adam Karczmarz, Piotr Sankowski |
| 2020 | ESA | Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. | Panagiotis Charalampopoulos, Adam Karczmarz |
| 2020 | SODA | Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. | Adam Karczmarz, Jakub Lacki |
| 2019 | ESA | Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. | Adam Karczmarz, Jakub Lacki |
| 2019 | ESA | Min-Cost Flow in Unit-Capacity Planar Graphs. | Adam Karczmarz, Piotr Sankowski |
| 2018 | ESA | Decremental SPQR-trees for Planar Graphs. | Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg |
| 2018 | ICALP | Improved Bounds for Shortest Paths in Dense Distance Graphs. | Pawel Gawrychowski, Adam Karczmarz |
| 2018 | SODA | Optimal Dynamic Strings. | Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski |
| 2018 | SODA | Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond. | Adam Karczmarz |
| 2017 | ESA | Contracting a Planar Graph Efficiently. | Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski |
| 2017 | STOC | Decremental single-source reachability in planar digraphs. | Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski |
| 2015 | WADS | Fast and Simple Connectivity in Graph Timelines. | Adam Karczmarz, Jakub Lacki |