Fast and Simple Connectivity in Graph Timelines. - Adam Karczmarz; Jakub Lacki (WADS, 2015)

A Simple Mergeable Dictionary. - Adam Karczmarz (SWAT, 2016)

Contracting a Planar Graph Efficiently. - Jacob Holm; Giuseppe F. Italiano; Adam Karczmarz; Jakub Lacki; Eva Rotenberg; Piotr Sankowski (ESA, 2017)

Decremental single-source reachability in planar digraphs. - Giuseppe F. Italiano; Adam Karczmarz; Jakub Lacki; Piotr Sankowski (STOC, 2017)

Decremental SPQR-trees for Planar Graphs. - Jacob Holm; Giuseppe F. Italiano; Adam Karczmarz; Jakub Lacki; Eva Rotenberg (ESA, 2018)

Improved Bounds for Shortest Paths in Dense Distance Graphs. - Pawel Gawrychowski; Adam Karczmarz (ICALP, 2018)

Optimal Dynamic Strings. - Pawel Gawrychowski; Adam Karczmarz; Tomasz Kociumaka; Jakub Lacki; Piotr Sankowski (SODA, 2018)

Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond. - Adam Karczmarz (SODA, 2018)

Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. - Adam Karczmarz; Jakub Lacki (ESA, 2019)

Min-Cost Flow in Unit-Capacity Planar Graphs. - Adam Karczmarz; Piotr Sankowski (ESA, 2019)

Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. - Adam Karczmarz; Jakub Lacki (SOSA, 2020)

Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. - Adam Karczmarz; Jakub Pawlewicz; Piotr Sankowski (SoCG, 2021)

Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. - Adam Karczmarz (ICALP, 2021)

Decomposable Submodular Function Minimization via Maximum Flow. - Kyriakos Axiotis; Adam Karczmarz; Anish Mukherjee 001; Piotr Sankowski; Adrian Vladu (ICML, 2021)

Planar Reachability Under Single Vertex or Edge Failures. - Giuseppe F. Italiano; Adam Karczmarz; Nikos Parotsidis (SODA, 2021)

A Deterministic Parallel APSP Algorithm and its Applications. - Adam Karczmarz; Piotr Sankowski (SODA, 2021)

Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. - Adam Karczmarz; Anish Mukherjee 001; Piotr Sankowski; Piotr Wygocki (CoRR, 2021)

Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths. - Adam Karczmarz (SODA, 2022)

Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. - Adam Karczmarz; Anish Mukherjee 001; Piotr Sankowski (STOC, 2022)

Improved feature importance computation for tree models based on the Banzhaf value. - Adam Karczmarz; Tomasz P. Michalak; Anish Mukherjee 001; Piotr Sankowski; Piotr Wygocki (UAI, 2022)

Single-source shortest paths and strong connectivity in dynamic planar graphs. - Panagiotis Charalampopoulos; Adam Karczmarz (J. Comput. Syst. Sci., 2022)

On Fully Dynamic Strongly Connected Components. - Adam Karczmarz; Marcin Smulewicz (ESA, 2023)

Deterministic Fully Dynamic SSSP and More. - Jan van den Brand; Adam Karczmarz (FOCS, 2023)

Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. - Adam Karczmarz; Piotr Sankowski (FOCS, 2023)

Optimal Decremental Connectivity in Non-Sparse Graphs. - Anders Aamand; Adam Karczmarz; Jakub Lacki; Nikos Parotsidis; Peter M. R. Rasmussen; Mikkel Thorup (ICALP, 2023)

Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. - Adam Karczmarz; Piotr Sankowski (ICALP, 2023)

Max s, t-Flow Oracles and Negative Cycle Detection in Planar Digraphs. - Adam Karczmarz (CoRR, 2023)

Fully Dynamic Strongly Connected Components in Planar Digraphs. - Adam Karczmarz; Marcin Smulewicz (ICALP, 2024)

Max s, t-Flow Oracles and Negative Cycle Detection in Planar Digraphs. - Adam Karczmarz (SODA, 2024)

Exact Shortest Paths with Rational Weights on the Word RAM. - Adam Karczmarz; Wojciech Nadara; Marek Sokolowski 001 (SODA, 2024)

Fully Dynamic Shortest Paths in Sparse Digraphs. - Adam Karczmarz; Piotr Sankowski (CoRR, 2024)

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more. - Adam Karczmarz; Da Wei Zheng (CoRR, 2024)

Towards Scalable and Practical Batch-Dynamic Connectivity. - Quinten De Man; Laxman Dhulipala; Adam Karczmarz; Jakub Lacki; Julian Shun; Zhongqi Wang (Proc. VLDB Endow., 2024)

Accurate Estimation of Feature Importance Faithfulness for Tree Models. - Mateusz Gajewski; Adam Karczmarz; Mateusz Rapicki; Piotr Sankowski (AAAI, 2025)

Towards Scalable and Practical Batch-Dynamic Connectivity (Abstract). - Quinten De Man; Laxman Dhulipala; Adam Karczmarz; Jakub Lacki; Julian Shun; Zhongqi Wang (HOPC@SPAA, 2025)

Fully Dynamic Algorithms for Transitive Reduction. - Gramoz Goranci; Adam Karczmarz; Ali Momeni 003; Nikos Parotsidis (ICALP, 2025)

On Incremental Approximate Shortest Paths in Directed Graphs. - Adam Górkiewicz; Adam Karczmarz (ICALP, 2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs. - Vikrant Ashvinkumar; Aaron Bernstein; Adam Karczmarz (SODA, 2025)

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decrementai reachability, and more. - Adam Karczmarz; Da Wei Zheng (SODA, 2025)

A Deterministic Work-Depth Tradeoff for Strongly Connected Components. - Adam Karczmarz; Bartlomiej Lewandowski (SPAA, 2025)

VARSHAP: Addressing Global Dependency Problems in Explainable AI with Variance-Based Local Feature Attribution. - Mateusz Gajewski; Mikolaj Morzy; Adam Karczmarz; Piotr Sankowski (CoRR, 2025)