Adam Karczmarz

69 papers A* 24A 7B 2Journal 33Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP. SODA Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
2025	B	`conf`	A Deterministic Work-Depth Tradeoff for Strongly Connected Components. SPAA Adam Karczmarz, Bartlomiej Lewandowski
2025	A*	`conf`	Accurate Estimation of Feature Importance Faithfulness for Tree Models. AAAI Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski
2025	A*	`conf`	Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs. SODA Vikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz
2025	A*	`conf`	Fully Dynamic Algorithms for Transitive Reduction. ICALP Gramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis
2025	J	`jnl`	Fully Dynamic Algorithms for Transitive Reduction. CoRR Gramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis
2025	A*	`conf`	On Incremental Approximate Shortest Paths in Directed Graphs. ICALP Adam Górkiewicz, Adam Karczmarz
2025	J	`jnl`	On Incremental Approximate Shortest Paths in Directed Graphs. CoRR Adam Górkiewicz, Adam Karczmarz
2025	J	`jnl`	Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP. CoRR Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
2025	A*	`conf`	Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decrementai reachability, and more. SODA Adam Karczmarz, Da Wei Zheng
2025	—	`conf`	Towards Scalable and Practical Batch-Dynamic Connectivity (Abstract). HOPC@SPAA Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Lacki, Julian Shun, Zhongqi Wang
2025	J	`jnl`	VARSHAP: Addressing Global Dependency Problems in Explainable AI with Variance-Based Local Feature Attribution. CoRR Mateusz Gajewski, Mikolaj Morzy, Adam Karczmarz, Piotr Sankowski
2024	J	`jnl`	Accurate estimation of feature importance faithfulness for tree models. CoRR Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski
2024	A*	`conf`	Exact Shortest Paths with Rational Weights on the Word RAM. SODA Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
2024	J	`jnl`	Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs. CoRR Vikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz
2024	J	`jnl`	Fully Dynamic Shortest Paths in Sparse Digraphs. CoRR Adam Karczmarz, Piotr Sankowski
2024	A*	`conf`	Fully Dynamic Strongly Connected Components in Planar Digraphs. ICALP Adam Karczmarz, Marcin Smulewicz
2024	J	`jnl`	Fully Dynamic Strongly Connected Components in Planar Digraphs. CoRR Adam Karczmarz, Marcin Smulewicz
2024	A*	`conf`	Max SODA Adam Karczmarz
2024	J	`jnl`	Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more. CoRR Adam Karczmarz, Da Wei Zheng
2024	J	`jnl`	Towards Scalable and Practical Batch-Dynamic Connectivity. CoRR Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Lacki, Julian Shun, Zhongqi Wang
2024	J	`jnl`	Towards Scalable and Practical Batch-Dynamic Connectivity. Proc. VLDB Endow. Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Lacki, Julian Shun, Zhongqi Wang
2023	A*	`conf`	Deterministic Fully Dynamic SSSP and More. FOCS Jan van den Brand, Adam Karczmarz
2023	J	`jnl`	Deterministic Fully Dynamic SSSP and More. CoRR Jan van den Brand, Adam Karczmarz
2023	J	`jnl`	Exact Shortest Paths with Rational Weights on the Word RAM. CoRR Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
2023	A*	`conf`	Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. ICALP Adam Karczmarz, Piotr Sankowski
2023	J	`jnl`	Max s, t-Flow Oracles and Negative Cycle Detection in Planar Digraphs. CoRR Adam Karczmarz
2023	A	`conf`	On Fully Dynamic Strongly Connected Components. ESA Adam Karczmarz, Marcin Smulewicz
2023	A*	`conf`	Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
2023	A*	`conf`	Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. FOCS Adam Karczmarz, Piotr Sankowski
2023	J	`jnl`	Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. CoRR Adam Karczmarz, Piotr Sankowski
2022	A*	`conf`	Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths. SODA Adam Karczmarz
2022	A	`conf`	Improved feature importance computation for tree models based on the Banzhaf value. UAI Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki
2022	J	`jnl`	Single-source shortest paths and strong connectivity in dynamic planar graphs. J. Comput. Syst. Sci. Panagiotis Charalampopoulos, Adam Karczmarz
2022	J	`jnl`	Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary. CoRR Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
2022	A*	`conf`	Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. STOC Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
2021	A*	`conf`	A Deterministic Parallel APSP Algorithm and its Applications. SODA Adam Karczmarz, Piotr Sankowski
2021	J	`jnl`	A Deterministic Parallel APSP Algorithm and its Applications. CoRR Adam Karczmarz, Piotr Sankowski
2021	A*	`conf`	Decomposable Submodular Function Minimization via Maximum Flow. ICML Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
2021	J	`jnl`	Decomposable Submodular Function Minimization via Maximum Flow. CoRR Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
2021	A*	`conf`	Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. ICALP Adam Karczmarz
2021	J	`jnl`	Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. CoRR Adam Karczmarz
2021	J	`jnl`	Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. CoRR Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki
2021	J	`jnl`	Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths. CoRR Adam Karczmarz
2021	J	`jnl`	Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
2021	A*	`conf`	Planar Reachability Under Single Vertex or Edge Failures. SODA Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
2021	J	`jnl`	Planar Reachability Under Single Vertex or Edge Failures. CoRR Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
2021	A*	`conf`	Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. SoCG Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
2021	J	`jnl`	Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. CoRR Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
2020	—	`conf`	Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. SOSA Adam Karczmarz, Jakub Lacki
2020	A	`conf`	Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ESA Panagiotis Charalampopoulos, Adam Karczmarz
2019	A	`conf`	Min-Cost Flow in Unit-Capacity Planar Graphs. ESA Adam Karczmarz, Piotr Sankowski
2019	J	`jnl`	Min-Cost Flow in Unit-Capacity Planar Graphs. CoRR Adam Karczmarz, Piotr Sankowski
2019	A	`conf`	Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. ESA Adam Karczmarz, Jakub Lacki
2019	J	`jnl`	Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. CoRR Adam Karczmarz, Jakub Lacki
2018	A*	`conf`	Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond. SODA Adam Karczmarz
2018	A	`conf`	Decremental SPQR-trees for Planar Graphs. ESA Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
2018	J	`jnl`	Decremental SPQR-trees for Planar Graphs. CoRR Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
2018	A*	`conf`	Improved Bounds for Shortest Paths in Dense Distance Graphs. ICALP Pawel Gawrychowski, Adam Karczmarz
2018	A*	`conf`	Optimal Dynamic Strings. SODA Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
2017	A	`conf`	Contracting a Planar Graph Efficiently. ESA Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
2017	J	`jnl`	Contracting a Planar Graph Efficiently. CoRR Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
2017	J	`jnl`	Decremental Single-Source Reachability in Planar Digraphs. CoRR Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
2017	A*	`conf`	Decremental single-source reachability in planar digraphs. STOC Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
2016	—	`conf`	A Simple Mergeable Dictionary. SWAT Adam Karczmarz
2016	J	`jnl`	Improved Bounds for Shortest Paths in Dense Distance Graphs. CoRR Pawel Gawrychowski, Adam Karczmarz
2015	B	`conf`	Fast and Simple Connectivity in Graph Timelines. WADS Adam Karczmarz, Jakub Lacki
2015	J	`jnl`	Fast and simple connectivity in graph timelines. CoRR Adam Karczmarz, Jakub Lacki
2015	J	`jnl`	Optimal Dynamic Strings. CoRR Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski