Computing bounded-width tree and branch decompositions of k-outerplanar graphs - Ioannis Katsikarelis (CoRR, 2013)

Structural parameters, tight bounds, and approximation for (k, r)-center. - Ioannis Katsikarelis; Michael Lampis; Vangelis Th. Paschos (Discret. Appl. Math., 2019)

Structurally Parameterized Tight Bounds and Approximation for Generalizations of Independence and Domination. (Limites exactes et approximation structurellement paramétré pour généralisations d'indépendance et de domination). - Ioannis Katsikarelis (2019)

Parameterized Orientable Deletion. - Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Yota Otachi; Florian Sikora (Algorithmica, 2020)

Parameterized Complexity of Safe Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Hirotaka Ono 001; Yota Otachi (J. Graph Algorithms Appl., 2020)

Structurally parameterized d-scattered set. - Ioannis Katsikarelis; Michael Lampis; Vangelis Th. Paschos (Discret. Appl. Math., 2022)

New Results on Directed Edge Dominating Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Eun Jung Kim 002; Michael Lampis (Discret. Math. Theor. Comput. Sci., 2023)

Improved (In-)Approximability Bounds for d-Scattered Set. - Ioannis Katsikarelis; Michael Lampis; Vangelis Th. Paschos (J. Graph Algorithms Appl., 2023)