Efficient Labeling for Reachability in Directed Acyclic Graphs. - Maciej Duleba; Pawel Gawrychowski; Wojciech Janczewski (ISAAC, 2020)

Efficient Labeling for Reachability in Digraphs. - Maciej Duleba; Pawel Gawrychowski; Wojciech Janczewski (CoRR, 2020)

Shorter Labels for Routing in Trees. - Pawel Gawrychowski; Wojciech Janczewski; Jakub Lopuszanski (SODA, 2021)

Fully dynamic approximation of LIS in polylogarithmic time. - Pawel Gawrychowski; Wojciech Janczewski (STOC, 2021)

Conditional Lower Bounds for Variants of Dynamic LIS. - Pawel Gawrychowski; Wojciech Janczewski (CoRR, 2021)

Simpler Adjacency Labeling for Planar Graphs with B-Trees. - Pawel Gawrychowski; Wojciech Janczewski (SOSA, 2022)

Optimal Distance Labeling for Permutation Graphs. - Pawel Gawrychowski; Wojciech Janczewski (ICALP, 2025)