Browse by Staff

Article

Bathie, G. and Charalampopoulos, Panagiotis and Starikovskaya, T. (2024) Longest common extensions with wildcards: trade-off and applications. Leibniz International Proceedings in Informatics (LIPIcs) 308 , 10:1-19:17. ISSN 1868-8969.

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.

Bathie, Gabriel and Charalampopoulos, Panagiotis and Starikovskaya, Tatiana (2024) Pattern Matching with Mismatches and Wildcards. 32nd Annual European Symposium on Algorithms (ESA 2024) ,

Bathie, G. and Charalampopoulos, Panagiotis and Starikovskaya, T. (2024) Internal pattern matching in small space and applications. Leibniz International Proceedings in Informatics (LIPIcs) , ISSN 1868-8969.

Bannai, H. and Charalampopoulos, Panagiotis and Radoszewski, J. (2024) Maintaining the size of LZ77 on semi-dynamic strings. Leibniz International Proceedings in Informatics (LIPIcs) , ISSN 1868-8969.

Charalampopoulos, Panagiotis and Pissis, Solon P. and Radoszewski, Jakub and Rytter, Wojciech and Walen, Tomasz and Zuba, Wiktor (2024) Approximate Circular Pattern Matching under Edit Distance. Leibniz International Proceedings in Informatics (LIPIcs) 289 , 24:1-24:22. ISSN 1868-8969.

Charalampopoulos, Panagiotis and Chen, H. and Christen, P. and Loukides, G. and Pisanti, N. and Pissis, S.P. and Radoszewski, J. (2024) Pattern masking for dictionary matching: theory and practice. Algorithmica , ISSN 0178-4617.

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.

Charalampopoulos, Panagiotis and Kociumaka, T. and Wellnitz, P. (2022) Faster pattern matching under edit distance : a reduction to dynamic puzzle matching and the Seaweed Monoid of permutation matrices. 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022 , pp. 698-707. ISSN 2575-8454.

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.

Charalampopoulos, Panagiotis and Pissis, S.P. and Radoszewski, J. and Rytter, W. and Waleń, T. and Zuba, W. (2022) Subsequence covers of words. Lecture Notes in Computer Science , pp. 3-15. ISSN 0302-9743.