Adam Karczmarz

According to our database, Adam Karczmarz authored at least 36 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decrementai reachability, and more.

Adam Karczmarz, Da Wei Zheng

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs.

Vikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Towards Scalable and Practical Batch-Dynamic Connectivity.

Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Lacki, Julian Shun, Zhongqi Wang

CoRR, 2024

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more.

Adam Karczmarz, Da Wei Zheng

CoRR, 2024

Fully Dynamic Shortest Paths in Sparse Digraphs.

Adam Karczmarz, Piotr Sankowski

CoRR, 2024

Accurate estimation of feature importance faithfulness for tree models.

Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski

CoRR, 2024

Exact Shortest Paths with Rational Weights on the Word RAM.

Adam Karczmarz, Wojciech Nadara, Marek Sokolowski

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Max <i>s</i>, <i>t</i>-Flow Oracles and Negative Cycle Detection in Planar Digraphs.

Adam Karczmarz

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Fully Dynamic Strongly Connected Components in Planar Digraphs.

Adam Karczmarz, Marcin Smulewicz

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Max s, t-Flow Oracles and Negative Cycle Detection in Planar Digraphs.

Adam Karczmarz

CoRR, 2023

Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs.

Adam Karczmarz, Piotr Sankowski

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Optimal Decremental Connectivity in Non-Sparse Graphs.

Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form.

Adam Karczmarz, Piotr Sankowski

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Deterministic Fully Dynamic SSSP and More.

Jan van den Brand, Adam Karczmarz

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

On Fully Dynamic Strongly Connected Components.

Adam Karczmarz, Marcin Smulewicz

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Single-source shortest paths and strong connectivity in dynamic planar graphs.

Panagiotis Charalampopoulos, Adam Karczmarz

J. Comput. Syst. Sci., 2022

Improved feature importance computation for tree models based on the Banzhaf value.

Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki

Proceedings of the Uncertainty in Artificial Intelligence, 2022

Subquadratic dynamic path reporting in directed graphs against an adaptive adversary.

Adam Karczmarz, Anish Mukherjee, Piotr Sankowski

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths.

Adam Karczmarz

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf.

Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki

CoRR, 2021

A Deterministic Parallel APSP Algorithm and its Applications.

Adam Karczmarz, Piotr Sankowski

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Planar Reachability Under Single Vertex or Edge Failures.

Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Decomposable Submodular Function Minimization via Maximum Flow.

Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu

Proceedings of the 38th International Conference on Machine Learning, 2021

Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems.

Adam Karczmarz

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs.

Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs.

Adam Karczmarz, Jakub Lacki

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

2019

Min-Cost Flow in Unit-Capacity Planar Graphs.

Adam Karczmarz, Piotr Sankowski

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs.

Adam Karczmarz, Jakub Lacki

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond.

Adam Karczmarz

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Optimal Dynamic Strings.

Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Improved Bounds for Shortest Paths in Dense Distance Graphs.

Pawel Gawrychowski, Adam Karczmarz

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Decremental SPQR-trees for Planar Graphs.

Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Decremental single-source reachability in planar digraphs.

Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Contracting a Planar Graph Efficiently.

Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

A Simple Mergeable Dictionary.

Adam Karczmarz

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2015

Fast and Simple Connectivity in Graph Timelines.

Adam Karczmarz, Jakub Lacki

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015