Michalis Christou
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Quasiperiodicities in Fibonacci strings. | 2017-04-21 | Paper |
| On the appearance of seeds in words JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-05-30 | Paper |
| Bipartite Ramsey numbers involving stars, stripes and trees Electronic Journal of Graph Theory and Applications | 2015-03-05 | Paper |
| Tree template matching in unranked ordered trees Journal of Discrete Algorithms | 2014-08-13 | Paper |
| Maximizing the size of planar graphs under girth constraints JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2014-08-12 | Paper |
| Abelian borders in binary words Discrete Applied Mathematics | 2014-05-06 | Paper |
| Degree/diameter problem for trees and pseudotrees AKCE International Journal of Graphs and Combinatorics | 2014-04-25 | Paper |
| On the average number of regularities in a word Theoretical Computer Science | 2014-03-13 | Paper |
| Efficient seed computation revisited Theoretical Computer Science | 2014-01-09 | Paper |
| Overlapping factors in words The Australasian Journal of Combinatorics | 2013-12-13 | Paper |
| On left and right seeds of a string Journal of Discrete Algorithms | 2013-06-24 | Paper |
| Identifying all abelian periods of a string in quadratic time and relevant problems International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
| Computing all subtree repeats in ordered trees Information Processing Letters | 2013-03-21 | Paper |
| On the right-seed array of a string Lecture Notes in Computer Science | 2011-08-17 | Paper |
| Efficient seeds computation revisited Combinatorial Pattern Matching | 2011-06-29 | Paper |
Research outcomes over time
This page was built for person: Michalis Christou
