Publications

  • P. Charalampopoulos, P. Gawrychowski, S. Mozes and O. Weimann:
    Almost Optimal Distance Oracles for Planar Graphs,
    STOC 2019. [arxiv]
  • A. Amir, P. Charalampopoulos, S. P. Pissis and J. Radoszewski:
    Longest Common Substring Made Fully Dynamic.
    [arxiv]
  • P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis and J. Radoszewski:
    On-Line Weighted Pattern Matching,
    Inf. Comput. 266: 49-59 (2019). [doi]
  • P. Charalampopoulos, S. Mozes and B. Tebeka:
    Exact Distance Oracles for Planar Graphs with Failing Vertices,
    SODA 2019: 2110-2123. [doi][arxiv]
  • P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter and T. Waleń:
    Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes,
    J. Comb. Optim. 37(2): 501-522 (2019). [doi]
  • Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis and D. Polychronopoulos:
    On overabundant words and their application to biological sequence analysis,
    Theoretical Computer Science (2018). [doi]
  • M. Adamczyk, M. Alzamel, P. Charalampopoulos and J. Radoszewski:
    Palindromic Decompositions with Gaps and Errors,
    Int. J. Found. Comput. Sci. 29(8): 1311-1329 (2018). [doi]
  • P. Charalampopoulos, M. Crochemore, G. Fici, R. Mercaș and S. P. Pissis:
    Alignment-Free Sequence Comparison Using Absent Words,
    Inf. Comput. 262(Part 1): 57-68 (2018). [doi][arxiv]
  • P. Charalampopoulos, M. Crochemore and S. P. Pissis:
    On Extended Special Factors of a Word,
    SPIRE 2018: 131-138. [doi][pdf]
  • L. A. K. Ayad, C. Barton, P. Charalampopoulos, C. S. Iliopoulos and S. P. Pissis:
    Longest Common Prefixes with k-Errors and Applications,
    SPIRE 2018: 27-41. [doi][arxiv]
  • M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski and J. Strazyński:
    Efficient Computation of Sequence Mappability,
    SPIRE 2018: 12-26. [doi][arxiv] Best Paper Award
  • P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter and T. Waleń:
    Linear-Time Algorithm for Long LCF with k Mismatches,
    CPM 2018: 23:1-23:16. [doi][arxiv]
  • P. Charalampopoulos, C. S. Iliopoulos, C. Liu and S. P. Pissis:
    Property Suffix Array with Applications,
    LATIN 2018: 290-302. [doi]
  • H. Alamro, L. A. K. Ayad, P. Charalampopoulos, C. S. Iliopoulos and S. P. Pissis:
    Longest Common Prefixes with k-Mismatches and Applications,
    SOFSEM 2018: 636-649. [doi][pdf]
  • M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski and W. K. Sung:
    Faster Algorithms for 1-Mappability of a Sequence,
    COCOA (2) 2017: 109-121. [doi][arxiv]
  • A. Amir, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis and J. Radoszewski:
    Longest Common Factor After One Edit Operation,
    SPIRE 2017: 14-26. [doi] Best Paper Award
  • Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis and D. Polychronopoulos:
    Optimal Computation of Overabundant Words,
    WABI 2017: 4:1-4:14. [doi][arxiv]
  • P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter and T. Waleń:
    Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes,
    COCOON 2017: 99-111. [doi]
  • M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos and S. P. Pissis:
    How to Answer a Small Batch of RMQs or LCA Queries in Practice,
    IWOCA 2017: 343-355. [doi][arxiv]
  • M. Adamczyk, M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos and J. Radoszewski:
    Palindromic Decompositions with Gaps and Errors,
    CSR 2017: 48-61. [doi][arxiv]
  • Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis and D. Polychronopoulos:
    On avoided words, absent words, and their application to biological sequence analysis,
    Algorithms for Molecular Biology, vol. 12, no. 1, 2017, pp. 5. [doi]
  • Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis and D. Polychronopoulos:
    Optimal Computation of Avoided Words,
    WABI 2016: 1-13. [doi][arxiv]