Adam Karczmarz

MaRDI QIDQ2051853zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On fully dynamic strongly connected components	2025-01-06	Paper
Max \(s\), \(t\)-flow oracles and negative cycle detection in planar digraphs	2024-11-28	Paper
Exact shortest paths with rational weights on the word RAM	2024-11-28	Paper
Optimal decremental connectivity in non-sparse graphs	2024-11-14	Paper
Fully dynamic shortest paths and reachability in sparse digraphs	2024-11-14	Paper
Improved strongly polynomial algorithms for deterministic MDPs, 2VPI feasibility, and discounted all-pairs shortest paths	2024-07-19	Paper
Simple label-correcting algorithms for partially dynamic approximate shortest paths in directed graphs	2024-05-14	Paper
scientific article; zbMATH DE number 7788355 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper
scientific article; zbMATH DE number 7788501 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	2023-12-08	Paper
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.	2023-02-07	Paper
Min-Cost Flow in Unit-Capacity Planar Graphs (available as arXiv preprint)	2022-05-11	Paper
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (available as arXiv preprint)	2022-05-11	Paper
Single-source shortest paths and strong connectivity in dynamic planar graphs Journal of Computer and System Sciences	2021-11-25	Paper
Decremental SPQR-trees for Planar Graphs (available as arXiv preprint)	2021-08-04	Paper
Improved bounds for shortest paths in dense distance graphs (available as arXiv preprint)	2021-07-28	Paper
Contracting a planar graph efficiently (available as arXiv preprint)	2020-05-27	Paper
scientific article; zbMATH DE number 6850408 (Why is no real title available?)	2018-03-15	Paper
scientific article; zbMATH DE number 6850408 (Why is no real title available?) (available as arXiv preprint)	2018-03-15	Paper
scientific article; zbMATH DE number 6850313 (Why is no real title available?)	2018-03-15	Paper
A simple mergeable dictionary	2017-10-17	Paper
Decremental single-source reachability in planar digraphs Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing	2017-08-17	Paper
Fast and Simple Connectivity in Graph Timelines Lecture Notes in Computer Science	2015-10-30	Paper

Research outcomes over time

This page was built for person: Adam Karczmarz