Adam Karczmarz

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 49

Top Topics

Strongly Connected Components

Top Venues

Publications

Adam Karczmarz, Marcin Smulewicz
Fully Dynamic Strongly Connected Components in Planar Digraphs. CoRR (2024)
Adam Karczmarz
-Flow Oracles and Negative Cycle Detection in Planar Digraphs. SODA (2024)
Adam Karczmarz, Marcin Smulewicz
Fully Dynamic Strongly Connected Components in Planar Digraphs. ICALP (2024)
Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
Exact Shortest Paths with Rational Weights on the Word RAM. SODA (2024)
Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski
Accurate estimation of feature importance faithfulness for tree models. CoRR (2024)
Adam Karczmarz, Piotr Sankowski
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. CoRR (2023)
Jan van den Brand, Adam Karczmarz
Deterministic Fully Dynamic SSSP and More. CoRR (2023)
Adam Karczmarz, Marcin Smulewicz
On Fully Dynamic Strongly Connected Components. ESA (2023)
Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP (2023)
Adam Karczmarz, Piotr Sankowski
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. FOCS (2023)
Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
Exact Shortest Paths with Rational Weights on the Word RAM. CoRR (2023)
Adam Karczmarz
Max s, t-Flow Oracles and Negative Cycle Detection in Planar Digraphs. CoRR (2023)
Adam Karczmarz, Piotr Sankowski
Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. ICALP (2023)
Jan van den Brand, Adam Karczmarz
Deterministic Fully Dynamic SSSP and More. FOCS (2023)
Adam Karczmarz
Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths. SODA (2022)
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. STOC (2022)
Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki
Improved feature importance computation for tree models based on the Banzhaf value. UAI (2022)
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary. CoRR (2022)
Panagiotis Charalampopoulos, Adam Karczmarz
Single-source shortest paths and strong connectivity in dynamic planar graphs. J. Comput. Syst. Sci. 124 (2022)
Adam Karczmarz, Piotr Sankowski
A Deterministic Parallel APSP Algorithm and its Applications. SODA (2021)
Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
Planar Reachability Under Single Vertex or Edge Failures. CoRR (2021)
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
Decomposable Submodular Function Minimization via Maximum Flow. ICML (2021)
Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
Planar Reachability Under Single Vertex or Edge Failures. SODA (2021)
Adam Karczmarz
Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths. CoRR (2021)
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. CoRR (2021)
Adam Karczmarz, Piotr Sankowski
A Deterministic Parallel APSP Algorithm and its Applications. CoRR (2021)
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
Decomposable Submodular Function Minimization via Maximum Flow. CoRR (2021)
Adam Karczmarz
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. CoRR (2021)
Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR (2021)
Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. SoCG (2021)
Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. CoRR (2021)
Adam Karczmarz
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. ICALP (2021)
Adam Karczmarz, Jakub Lacki
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. SOSA (2020)
Panagiotis Charalampopoulos, Adam Karczmarz
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ESA (2020)
Adam Karczmarz, Jakub Lacki
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. CoRR (2019)
Adam Karczmarz, Jakub Lacki
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. ESA (2019)
Adam Karczmarz, Piotr Sankowski
Min-Cost Flow in Unit-Capacity Planar Graphs. ESA (2019)
Adam Karczmarz, Piotr Sankowski
Min-Cost Flow in Unit-Capacity Planar Graphs. CoRR (2019)
Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
Optimal Dynamic Strings. SODA (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
Decremental SPQR-trees for Planar Graphs. CoRR (2018)
Adam Karczmarz
Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond. SODA (2018)
Pawel Gawrychowski, Adam Karczmarz
Improved Bounds for Shortest Paths in Dense Distance Graphs. ICALP (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
Decremental SPQR-trees for Planar Graphs. ESA (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
Contracting a Planar Graph Efficiently. CoRR (2017)
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
Decremental Single-Source Reachability in Planar Digraphs. CoRR (2017)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
Contracting a Planar Graph Efficiently. ESA (2017)
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
Decremental single-source reachability in planar digraphs. STOC (2017)
Adam Karczmarz
A Simple Mergeable Dictionary. SWAT (2016)
Pawel Gawrychowski, Adam Karczmarz
Improved Bounds for Shortest Paths in Dense Distance Graphs. CoRR (2016)
Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
Optimal Dynamic Strings. CoRR (2015)
Adam Karczmarz, Jakub Lacki
Fast and Simple Connectivity in Graph Timelines. WADS (2015)
Adam Karczmarz, Jakub Lacki
Fast and simple connectivity in graph timelines. CoRR (2015)