Adam Karczmarz

Available identifiers

zbMath Open karczmarz.adamMaRDI QIDQ2051853

List of research outcomes

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
https://portal.mardi4nfdi.de/entity/Q6147264	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147421	2024-01-15	Paper
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary	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	2022-05-11	Paper
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs	2022-05-11	Paper
Single-source shortest paths and strong connectivity in dynamic planar graphs	2021-11-25	Paper
Decremental SPQR-trees for Planar Graphs	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5002738	2021-07-28	Paper
Contracting a Planar Graph Efficiently	2020-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q4607988	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607877	2018-03-15	Paper
A Simple Mergeable Dictionary	2017-10-17	Paper
Decremental single-source reachability in planar digraphs	2017-08-17	Paper
Fast and Simple Connectivity in Graph Timelines	2015-10-30	Paper

Research outcomes over time

This page was built for person: Adam Karczmarz