Almalki, Nada; Michail, Othon On geometric shape construction via growth operations. (English) Zbl 07782078 Theor. Comput. Sci. 984, Article ID 114324, 19 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{N. Almalki} and \textit{O. Michail}, Theor. Comput. Sci. 984, Article ID 114324, 19 p. (2024; Zbl 07782078) Full Text: DOI
Almethen, Abdullah; Michail, Othon; Potapov, Igor Distributed transformations of Hamiltonian shapes based on line moves. (English) Zbl 07635998 Theor. Comput. Sci. 942, 142-168 (2023). MSC: 68W15 PDFBibTeX XMLCite \textit{A. Almethen} et al., Theor. Comput. Sci. 942, 142--168 (2023; Zbl 07635998) Full Text: DOI
Connor, Matthew; Michail, Othon; Potapov, Igor Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach. (English) Zbl 1508.68376 Theor. Comput. Sci. 936, 77-91 (2022). MSC: 68T40 68Q09 68U05 PDFBibTeX XMLCite \textit{M. Connor} et al., Theor. Comput. Sci. 936, 77--91 (2022; Zbl 1508.68376) Full Text: DOI
Almethen, Abdullah; Michail, Othon; Potapov, Igor On efficient connectivity-preserving transformations in a grid. (English) Zbl 1478.68375 Theor. Comput. Sci. 898, 132-148 (2022). MSC: 68T40 68Q09 68Q10 68Q25 68U05 68W15 PDFBibTeX XMLCite \textit{A. Almethen} et al., Theor. Comput. Sci. 898, 132--148 (2022; Zbl 1478.68375) Full Text: DOI arXiv
Almethen, Abdullah; Michail, Othon; Potapov, Igor Pushing lines helps: efficient universal centralised transformations for programmable matter. (English) Zbl 1443.68066 Theor. Comput. Sci. 830-831, 43-59 (2020). MSC: 68Q09 68T40 68W15 PDFBibTeX XMLCite \textit{A. Almethen} et al., Theor. Comput. Sci. 830--831, 43--59 (2020; Zbl 1443.68066) Full Text: DOI arXiv
Michail, Othon; Spirakis, Paul G. Connectivity preserving network transformers. (English) Zbl 1370.68023 Theor. Comput. Sci. 671, 36-55 (2017). MSC: 68M12 68M10 68Q05 PDFBibTeX XMLCite \textit{O. Michail} and \textit{P. G. Spirakis}, Theor. Comput. Sci. 671, 36--55 (2017; Zbl 1370.68023) Full Text: DOI
Michail, Othon; Spirakis, Paul G. Traveling salesman problems in temporal graphs. (English) Zbl 1338.90349 Theor. Comput. Sci. 634, 1-23 (2016). MSC: 90C27 68Q17 68W25 90C35 90C59 PDFBibTeX XMLCite \textit{O. Michail} and \textit{P. G. Spirakis}, Theor. Comput. Sci. 634, 1--23 (2016; Zbl 1338.90349) Full Text: DOI
Chatzigiannakis, Ioannis; Michail, Othon; Nikolaou, Stavros; Spirakis, Paul G. The computational power of simple protocols for self-awareness on graphs. (English) Zbl 1358.68034 Theor. Comput. Sci. 512, 98-118 (2013). MSC: 68M12 68Q45 68R10 PDFBibTeX XMLCite \textit{I. Chatzigiannakis} et al., Theor. Comput. Sci. 512, 98--118 (2013; Zbl 1358.68034) Full Text: DOI
Chatzigiannakis, Ioannis; Michail, Othon; Nikolaou, Stavros; Pavlogiannis, Andreas; Spirakis, Paul G. Passively mobile communicating machines that use restricted space. (English) Zbl 1228.68028 Theor. Comput. Sci. 412, No. 46, 6469-6483 (2011). MSC: 68Q05 68Q85 68M14 68Q15 PDFBibTeX XMLCite \textit{I. Chatzigiannakis} et al., Theor. Comput. Sci. 412, No. 46, 6469--6483 (2011; Zbl 1228.68028) Full Text: DOI arXiv
Michail, Othon; Chatzigiannakis, Ioannis; Spirakis, Paul G. Mediated population protocols. (English) Zbl 1218.68082 Theor. Comput. Sci. 412, No. 22, 2434-2450 (2011). MSC: 68Q05 68M07 68Q15 PDFBibTeX XMLCite \textit{O. Michail} et al., Theor. Comput. Sci. 412, No. 22, 2434--2450 (2011; Zbl 1218.68082) Full Text: DOI