( en | de | ru )

 

Disambiguation of "Iliopoulos, Costas S."

Author of the publication

copydeleteadd this publication to your clipboard
The Maximum Number of Squares in a Tree.

, , , , , , , and . CPM, volume 7354 of Lecture Notes in Computer Science, page 27-40. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christos Iliopoulos

Nikolaos Iliopoulos

Peter Costas

Costas Averkiou

Costas Higoumenakis

 

Other publications of authors with the same name

Property Matching and Weighted Matching., , , , and . CPM, volume 4009 of Lecture Notes in Computer Science, page 188-199. Springer, (2006)Generic Algorithms for Factoring Strings., , , and . Information Theory, Combinatorics, and Search Theory, volume 7777 of Lecture Notes in Computer Science, page 402-418. Springer, (2013)A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns., and . SOFSEM, volume 4910 of Lecture Notes in Computer Science, page 316-327. Springer, (2008)Average-Case Optimal Approximate Circular String Matching., , and . LATA, volume 8977 of Lecture Notes in Computer Science, page 85-96. Springer, (2015)Finding Patterns in Given Intervals., , and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 645-656. Springer, (2007)String Matching with Swaps in a Weighted Sequence., , and . CIS, volume 3314 of Lecture Notes in Computer Science, page 698-704. Springer, (2004)A Brief Overview of Dead-Zone Pattern Matching Algorithms., , , , and . AIAI (Workshops), volume 560 of IFIP Advances in Information and Communication Technology, page 208-218. Springer, (2019)Smart Meter Data Analysis., , , , and . ICC 2016, page 22:1-22:6. ACM, (2016)Off-line and on-line algorithms for closed string factorization., , , and . Theor. Comput. Sci., (2019)An algorithm for mapping short reads to a dynamically changing genomic sequence., , , , , and . J. Discrete Algorithms, (2012)