Adam Karczmarz

Most-cited papers

Optimal Dynamic Strings
Paweł Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, J. Lacki +1 more
2015ACM-SIAM Symposium on Discrete Algorithms77 citations Open access
Semantic Scholar
Decremental single-source reachability in planar digraphs
G. Italiano, Adam Karczmarz, J. Lacki, P. Sankowski
2017Symposium on the Theory of Computing24 citations
Semantic Scholar
Improved feature importance computation for tree models based on the Banzhaf value
Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, P. Sankowski +1 more
2022Conference on Uncertainty in Artificial Intelligence22 citations
Semantic Scholar
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
Adam Karczmarz, J. Lacki
2019Embedded Systems and Applications20 citations
Semantic Scholar
Improved Bounds for Shortest Paths in Dense Distance Graphs
Paweł Gawrychowski, Adam Karczmarz
2016International Colloquium on Automata, Languages and Programming20 citations
Semantic Scholar
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs
Adam Karczmarz, J. Lacki
2020SIAM Symposium on Simplicity in Algorithms17 citations
Semantic Scholar
Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond
Adam Karczmarz
2018ACM-SIAM Symposium on Discrete Algorithms15 citations
Semantic Scholar
A Deterministic Parallel APSP Algorithm and its Applications
Adam Karczmarz, P. Sankowski
2021ACM-SIAM Symposium on Discrete Algorithms14 citations Open access
Semantic Scholar
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form
Adam Karczmarz, P. Sankowski
2023IEEE Annual Symposium on Foundations of Computer Science13 citations Open access
Semantic Scholar
Contracting a Planar Graph Efficiently
J. Holm, G. Italiano, Adam Karczmarz, J. Lacki +2 more
2017Embedded Systems and Applications13 citations
Semantic Scholar
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs
Panagiotis Charalampopoulos, Adam Karczmarz
2022Embedded Systems and Applications12 citations
Semantic Scholar
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary
Adam Karczmarz, A. Mukherjee, P. Sankowski
2022Symposium on the Theory of Computing12 citations Open access
Semantic Scholar
Decremental SPQR-trees for Planar Graphs
J. Holm, G. Italiano, Adam Karczmarz, J. Lacki +1 more
2018Embedded Systems and Applications11 citations
Semantic Scholar
Optimal Decremental Connectivity in Non-Sparse Graphs
Anders Aamand, Adam Karczmarz, J. Lacki, Nikos Parotsidis +2 more
2021International Colloquium on Automata, Languages and Programming10 citations
Semantic Scholar
Decomposable Submodular Function Minimization via Maximum Flow
Kyriakos Axiotis, Adam Karczmarz, A. Mukherjee, P. Sankowski +1 more
2021International Conference on Machine Learning10 citations
Semantic Scholar
Planar Reachability Under Single Vertex or Edge Failures
G. Italiano, Adam Karczmarz, Nikos Parotsidis
2021ACM-SIAM Symposium on Discrete Algorithms10 citations Open access
Semantic Scholar
Fast and Simple Connectivity in Graph Timelines
Adam Karczmarz, J. Lacki
2015Workshop on Algorithms and Data Structures10 citations Open access
Semantic Scholar
Towards Scalable and Practical Batch-Dynamic Connectivity
Quinten De Man, Laxman Dhulipala, Adam Karczmarz, J. Lacki +2 more
2024Proceedings of the VLDB Endowment8 citations
Semantic Scholar
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf
Adam Karczmarz, A. Mukherjee, P. Sankowski, Piotr Wygocki
2021arXiv.org8 citations
Semantic Scholar
On Incremental Approximate Shortest Paths in Directed Graphs
Adam Górkiewicz, Adam Karczmarz
2025International Colloquium on Automata, Languages and Programming6 citations
Semantic Scholar
Deterministic Fully Dynamic SSSP and More
J. W. van den Brand, Adam Karczmarz
2023IEEE Annual Symposium on Foundations of Computer Science6 citations
Semantic Scholar
On Fully Dynamic Strongly Connected Components
Adam Karczmarz, Marcin Smulewicz
2023Embedded Systems and Applications6 citations
Semantic Scholar
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems
Adam Karczmarz
2021International Colloquium on Automata, Languages and Programming6 citations
Semantic Scholar
Min-Cost Flow in Unit-Capacity Planar Graphs
Adam Karczmarz, P. Sankowski
2019Embedded Systems and Applications6 citations
Semantic Scholar
Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more
Adam Karczmarz, D. Zheng
2024arXiv.org5 citations
Semantic Scholar
A Simple Mergeable Dictionary
Adam Karczmarz
2016Scandinavian Workshop on Algorithm Theory5 citations
Semantic Scholar
Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
Vikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz
2024ACM-SIAM Symposium on Discrete Algorithms4 citations
Semantic Scholar
Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs
Adam Karczmarz, P. Sankowski
2024International Colloquium on Automata, Languages and Programming4 citations
Semantic Scholar
Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths
Adam Karczmarz
2021ACM-SIAM Symposium on Discrete Algorithms3 citations Open access
Semantic Scholar
VARSHAP: Addressing Global Dependency Problems in Explainable AI with Variance-Based Local Feature Attribution
M. Gajewski, Mikolaj Morzy, Adam Karczmarz, Piotr Sankowski
2025arXiv.org2 citations
Semantic Scholar
Fully Dynamic Strongly Connected Components in Planar Digraphs
Adam Karczmarz, Marcin Smulewicz
2024International Colloquium on Automata, Languages and Programming2 citations
Semantic Scholar
Max $s,t$-Flow Oracles and Negative Cycle Detection in Planar Digraphs
Adam Karczmarz
20232 citations
Semantic Scholar
Data structures and dynamic algorithms for planar graphs
Adam Karczmarz
20192 citations
Semantic Scholar
A Deterministic Work-Depth Tradeoff for Strongly Connected Components
Adam Karczmarz, Bartłomiej Lewandowski
2025ACM Symposium on Parallelism in Algorithms and Architectures1 citations Open access
Semantic Scholar
Towards Scalable and Practical Batch-Dynamic Connectivity (Abstract)
Quinten De Man, Laxman Dhulipala, Adam Karczmarz, J. Lacki +2 more
2025HOPC@SPAA1 citations
Semantic Scholar
Fully Dynamic Algorithms for Transitive Reduction
Gramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis
2025International Colloquium on Automata, Languages and Programming1 citations
Semantic Scholar
Dynamic Distances Without Matrix Inverse
J. W. van den Brand, Adam Karczmarz, Aryan Patel
20260 citations
Semantic Scholar
Breaking Two Barriers for Dynamic Planar Reachability
Adam Karczmarz, Michal Wlodarczyk
20260 citations
Semantic Scholar
Strongly Polynomial Parallel Maximum Flow Revisited
Adam Karczmarz, P. Pilarski
2026Embedded Systems and Applications0 citations
Semantic Scholar
Accurate estimation of feature importance faithfulness for tree models
M. Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski
2024AAAI Conference on Artificial Intelligence0 citations
Semantic Scholar
Max s, t-Flow Oracles and Negative Cycle Detection in Planar Digraphs
Adam Karczmarz
2023arXiv.org0 citations
Semantic Scholar
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs
Adam Karczmarz, Jakub Pawlewicz, P. Sankowski
2021International Symposium on Computational Geometry0 citations
Semantic Scholar
Distributed Tasks: Introducing Distributed Computing to Programming Competitions
Adam Karczmarz, J. Lacki, Adam Polak, J. Radoszewski +1 more
20160 citations Open access
Semantic Scholar