Wojciech Janczewski

According to our database, Wojciech Janczewski authored at least 7 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Optimal Distance Labeling for Permutation Graphs.

Pawel Gawrychowski, Wojciech Janczewski

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2022

Simpler Adjacency Labeling for Planar Graphs with B-Trees.

Pawel Gawrychowski, Wojciech Janczewski

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

2021

Conditional Lower Bounds for Variants of Dynamic LIS.

Pawel Gawrychowski, Wojciech Janczewski

CoRR, 2021

Fully dynamic approximation of LIS in polylogarithmic time.

Pawel Gawrychowski, Wojciech Janczewski

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Shorter Labels for Routing in Trees.

Pawel Gawrychowski, Wojciech Janczewski, Jakub Lopuszanski

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Efficient Labeling for Reachability in Digraphs.

Maciej Duleba, Pawel Gawrychowski, Wojciech Janczewski

CoRR, 2020

Efficient Labeling for Reachability in Directed Acyclic Graphs.

Maciej Duleba, Pawel Gawrychowski, Wojciech Janczewski

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020