Browse by Person
 | Up a level |
1 November 2022
Charalampopoulos, Panagiotis and Gawrychowski, P. and Mozes, S. and Weimann, O. (2022) On the hardness of computing the edit distance of shallow trees. Lecture Notes in Computer Science 13617 , pp. 290-302. ISSN 0302-9743.
25 March 2023
Charalampopoulos, Panagiotis and Gawrychowski, P. and Long, Y. and Mozes, S. and Pettie, S. and Weimann, O. and Wulff-Nilsen, C. (2023) Almost optimal exact distance oracles for planar graphs. Journal of the ACM 70 (2), pp. 1-50. ISSN 0004-5411.
2 July 2024
Charalampopoulos, Panagiotis and Gawrychowski, P. and Ghazawi, S. (2024) Optimal bounds for Distinct Quartics. Leibniz International Proceedings in Informatics (LIPIcs) 297 , 39:1-39:17. ISSN 1868-8969.