The following pages link to Jakub Łącki (Q1693989):
Displaying 23 items.
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components (Q2933657) (← links)
- The Power of Dynamic Distance Oracles (Q2941483) (← links)
- Optimal Decremental Connectivity in Planar Graphs. (Q2955027) (← links)
- Reachability in graph timelines (Q2986875) (← links)
- Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time (Q3092225) (← links)
- Fast and Simple Connectivity in Graph Timelines (Q3449843) (← links)
- Algorithmic Complexity of Power Law Networks (Q4575673) (← links)
- (Q4607988) (← links)
- Decremental single-source reachability in planar digraphs (Q4978051) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- Stochastic graph exploration (Q5092339) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Walking randomly, massively, and efficiently (Q5144923) (← links)
- Fully Dynamic Matching: Beating 2-Approximation in Δ<sup><i>ϵ</i></sup> Update Time (Q5146943) (← links)
- Round compression for parallel matching algorithms (Q5230311) (← links)
- (Q5365129) (← links)
- Simple label-correcting algorithms for partially dynamic approximate shortest paths in directed graphs (Q6538739) (← links)
- Near-optimal decremental hopsets with applications (Q6560884) (← links)
- Optimal decremental connectivity in non-sparse graphs (Q6637992) (← links)
- Fully dynamic consistent \(k\)-center clustering (Q6645488) (← links)
