The harmonious coloring problem is NP-complete for interval and permutation graphs. - Katerina Asdre; Kyriaki Ioannidou; Stavros D. Nikolopoulos (Discret. Appl. Math., 2007)

Linear Coloring and Linear Graphs - Kyriaki Ioannidou; Stavros D. Nikolopoulos (CoRR, 2008)

The Longest Path Problem Is Polynomial on Interval Graphs. - Kyriaki Ioannidou; George B. Mertzios; Stavros D. Nikolopoulos (MFCS, 2009)

Colinear Coloring on Graphs. - Kyriaki Ioannidou; Stavros D. Nikolopoulos (WALCOM, 2009)

Χαρακτηρισμός νέων κλάσεων τέλειων γραφημάτων και αγλόριθμοι χρωματισμού και μέγιστων διαδρομών - Kyriaki Ioannidou (2009)

Harmonious Coloring on Subclasses of Colinear Graphs. - Kyriaki Ioannidou; Stavros D. Nikolopoulos (WALCOM, 2010)

The Longest Path Problem has a Polynomial Solution on Interval Graphs. - Kyriaki Ioannidou; George B. Mertzios; Stavros D. Nikolopoulos (Algorithmica, 2011)

Construction du lexique LGLex à partir des tables du Lexique-Grammaire des verbes du grec moderne - Kyriaki Ioannidou; Elsa Tolone (CoRR, 2011)

The Longest Path Problem Is Polynomial on Cocomparability Graphs. - Kyriaki Ioannidou; Stavros D. Nikolopoulos (Algorithmica, 2013)

Building and evaluating resources for sentiment analysis in the Greek language. - Adam Tsakalidis; Symeon Papadopoulos; Rania Voskaki; Kyriaki Ioannidou; Christina Boididou; Alexandra I. Cristea; Maria Liakata; Yiannis Kompatsiaris (Lang. Resour. Evaluation, 2018)