Jakub Łącki

Available identifiers

zbMath Open lacki.jakubMaRDI QIDQ1693989

List of research outcomes

Publication	Date of Publication	Type
Fully dynamic consistent \(k\)-center clustering	2024-11-28	Paper
Optimal decremental connectivity in non-sparse graphs	2024-11-14	Paper
Near-optimal decremental hopsets with applications	2024-06-24	Paper
Simple label-correcting algorithms for partially dynamic approximate shortest paths in directed graphs	2024-05-14	Paper
Stochastic graph exploration	2022-07-21	Paper
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs	2022-05-11	Paper
Decremental SPQR-trees for Planar Graphs	2021-08-04	Paper
Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time	2021-02-02	Paper
Walking randomly, massively, and efficiently	2021-01-19	Paper
Round Compression for Parallel Matching Algorithms	2020-10-29	Paper
Contracting a Planar Graph Efficiently	2020-05-27	Paper
Round compression for parallel matching algorithms	2019-08-22	Paper
Algorithmic Complexity of Power Law Networks	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4607988	2018-03-15	Paper
Optimal decremental connectivity in planar graphs	2018-02-01	Paper
https://portal.mardi4nfdi.de/entity/Q5365129	2017-09-29	Paper
Decremental single-source reachability in planar digraphs	2017-08-17	Paper
Reachability in graph timelines	2017-05-16	Paper
Optimal Decremental Connectivity in Planar Graphs.	2017-01-24	Paper
Fast and Simple Connectivity in Graph Timelines	2015-10-30	Paper
The Power of Dynamic Distance Oracles	2015-08-21	Paper
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components	2014-12-05	Paper
Single Source - All Sinks Max Flows in Planar Digraphs	2012-10-17	Paper
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time	2011-09-16	Paper

Research outcomes over time

This page was built for person: Jakub Łącki