We stand with Ukraine  

Wojciech Janczewski

Orcid: 0000-0001-9540-0522

According to our database1, Wojciech Janczewski authored at least 7 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimal Distance Labeling for Permutation Graphs.
[BibTeX]
[DOI]
Pawel Gawrychowski
,
Wojciech Janczewski
CoRR, 2024

2022
Simpler Adjacency Labeling for Planar Graphs with B-Trees.
[BibTeX]
[DOI]
Pawel Gawrychowski
,
Wojciech Janczewski
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

2021
Conditional Lower Bounds for Variants of Dynamic LIS.
[BibTeX]
[DOI]
Pawel Gawrychowski
,
Wojciech Janczewski
CoRR, 2021

Fully dynamic approximation of LIS in polylogarithmic time.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Pawel Gawrychowski
,
Wojciech Janczewski
,
Jakub Lopuszanski
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Efficient Labeling for Reachability in Digraphs.
[BibTeX]
[DOI]
Maciej Duleba
,
Pawel Gawrychowski
,
Wojciech Janczewski
CoRR, 2020

Efficient Labeling for Reachability in Directed Acyclic Graphs.
[BibTeX]
[DOI]
Maciej Duleba
,
Pawel Gawrychowski
,
Wojciech Janczewski
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020


  Loading...