default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Karczmarz
Person information
- affiliation: University of Warsaw, Institute of Informatics, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Adam Karczmarz, Marcin Smulewicz:
Fully Dynamic Strongly Connected Components in Planar Digraphs. ICALP 2024: 95:1-95:20- [c27]Adam Karczmarz:
Max s, t-Flow Oracles and Negative Cycle Detection in Planar Digraphs. SODA 2024: 1606-1620 - [c26]Adam Karczmarz, Wojciech Nadara, Marek Sokolowski:
Exact Shortest Paths with Rational Weights on the Word RAM. SODA 2024: 2597-2608 - [i24]Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski:
Accurate estimation of feature importance faithfulness for tree models. CoRR abs/2404.03426 (2024) - [i23]Adam Karczmarz, Marcin Smulewicz:
Fully Dynamic Strongly Connected Components in Planar Digraphs. CoRR abs/2406.10420 (2024) - [i22]Adam Karczmarz, Piotr Sankowski:
Fully Dynamic Shortest Paths in Sparse Digraphs. CoRR abs/2408.14406 (2024) - 2023
- [c25]Adam Karczmarz, Marcin Smulewicz:
On Fully Dynamic Strongly Connected Components. ESA 2023: 68:1-68:15 - [c24]Adam Karczmarz, Piotr Sankowski:
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. FOCS 2023: 1745-1756 - [c23]Jan van den Brand
, Adam Karczmarz:
Deterministic Fully Dynamic SSSP and More. FOCS 2023: 2312-2321 - [c22]Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP 2023: 6:1-6:17 - [c21]Adam Karczmarz, Piotr Sankowski:
Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. ICALP 2023: 84:1-84:20 - [i21]Adam Karczmarz, Piotr Sankowski:
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. CoRR abs/2308.08870 (2023) - [i20]Jan van den Brand, Adam Karczmarz:
Deterministic Fully Dynamic SSSP and More. CoRR abs/2309.16594 (2023) - [i19]Adam Karczmarz:
Max s, t-Flow Oracles and Negative Cycle Detection in Planar Digraphs. CoRR abs/2311.01094 (2023) - [i18]Adam Karczmarz, Wojciech Nadara, Marek Sokolowski:
Exact Shortest Paths with Rational Weights on the Word RAM. CoRR abs/2311.03321 (2023) - 2022
- [j1]Panagiotis Charalampopoulos, Adam Karczmarz:
Single-source shortest paths and strong connectivity in dynamic planar graphs. J. Comput. Syst. Sci. 124: 97-111 (2022) - [c20]Adam Karczmarz:
Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths. SODA 2022: 154-172 - [c19]Adam Karczmarz, Anish Mukherjee, Piotr Sankowski:
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. STOC 2022: 1643-1656 - [c18]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: 969-979 - [i17]Adam Karczmarz, Anish Mukherjee, Piotr Sankowski:
Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary. CoRR abs/2203.16992 (2022) - 2021
- [c17]Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski:
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. SoCG 2021: 46:1-46:15 - [c16]Adam Karczmarz:
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. ICALP 2021: 83:1-83:20 - [c15]Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu:
Decomposable Submodular Function Minimization via Maximum Flow. ICML 2021: 446-456 - [c14]Adam Karczmarz, Piotr Sankowski:
A Deterministic Parallel APSP Algorithm and its Applications. SODA 2021: 255-272 - [c13]Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis:
Planar Reachability Under Single Vertex or Edge Failures. SODA 2021: 2739-2758 - [i16]Adam Karczmarz, Piotr Sankowski:
A Deterministic Parallel APSP Algorithm and its Applications. CoRR abs/2101.02311 (2021) - [i15]Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis:
Planar Reachability Under Single Vertex or Edge Failures. CoRR abs/2101.02574 (2021) - [i14]Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu:
Decomposable Submodular Function Minimization via Maximum Flow. CoRR abs/2103.03868 (2021) - [i13]Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski:
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. CoRR abs/2103.09684 (2021) - [i12]Adam Karczmarz:
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. CoRR abs/2106.11744 (2021) - [i11]Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki:
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. CoRR abs/2108.04126 (2021) - [i10]Adam Karczmarz:
Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths. CoRR abs/2110.15070 (2021) - [i9]Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR abs/2111.09376 (2021) - 2020
- [c12]Panagiotis Charalampopoulos, Adam Karczmarz:
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ESA 2020: 31:1-31:23 - [c11]Adam Karczmarz, Jakub Lacki:
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. SOSA 2020: 106-120
2010 – 2019
- 2019
- [c10]Adam Karczmarz, Jakub Lacki:
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. ESA 2019: 65:1-65:15 - [c9]Adam Karczmarz, Piotr Sankowski:
Min-Cost Flow in Unit-Capacity Planar Graphs. ESA 2019: 66:1-66:17 - [i8]Adam Karczmarz, Jakub Lacki:
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. CoRR abs/1907.02266 (2019) - [i7]Adam Karczmarz, Piotr Sankowski:
Min-Cost Flow in Unit-Capacity Planar Graphs. CoRR abs/1907.02274 (2019) - 2018
- [c8]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. ESA 2018: 46:1-46:16 - [c7]Pawel Gawrychowski, Adam Karczmarz:
Improved Bounds for Shortest Paths in Dense Distance Graphs. ICALP 2018: 61:1-61:15 - [c6]Adam Karczmarz:
Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond. SODA 2018: 73-92 - [c5]Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski:
Optimal Dynamic Strings. SODA 2018: 1509-1528 - [i6]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. CoRR abs/1806.10772 (2018) - 2017
- [c4]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. ESA 2017: 50:1-50:15 - [c3]Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski:
Decremental single-source reachability in planar digraphs. STOC 2017: 1108-1121 - [i5]Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski:
Decremental Single-Source Reachability in Planar Digraphs. CoRR abs/1705.11163 (2017) - [i4]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. CoRR abs/1706.10228 (2017) - 2016
- [c2]Adam Karczmarz:
A Simple Mergeable Dictionary. SWAT 2016: 7:1-7:13 - [i3]Pawel Gawrychowski, Adam Karczmarz:
Improved Bounds for Shortest Paths in Dense Distance Graphs. CoRR abs/1602.07013 (2016) - 2015
- [c1]Adam Karczmarz, Jakub Lacki:
Fast and Simple Connectivity in Graph Timelines. WADS 2015: 458-469 - [i2]Adam Karczmarz, Jakub Lacki:
Fast and simple connectivity in graph timelines. CoRR abs/1506.02973 (2015) - [i1]Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski:
Optimal Dynamic Strings. CoRR abs/1511.02612 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
