On graphs without P5 and P5_. - Jean-Luc Fouquet; Vassilis Giakoumakis; Frédéric Maire; Henri Thuillier (Discret. Math., 1995)

P_4-laden Graphs: A New Class of Brittle Graphs. - Vassilis Giakoumakis (Inf. Process. Lett., 1996)

Weighted Parameters in (P5, P5)-free Graphs. - Vassilis Giakoumakis; Irena Rusu (Discret. Appl. Math., 1997)

On semi-P4-sparse graphs. - Jean-Luc Fouquet; Vassilis Giakoumakis (Discret. Math., 1997)

On the closure of graphs under substitution. - Vassilis Giakoumakis (Discret. Math., 1997)

Scattering number and modular decomposition. - Vassilis Giakoumakis; Florian Roussel; Henri Thuillier (Discret. Math., 1997)

On P4-tidy graphs. - Vassilis Giakoumakis; Florian Roussel; Henri Thuillier (Discret. Math. Theor. Comput. Sci., 1997)

On Extended P4-Reducible and Extended P4-Sparse Graphs. - Vassilis Giakoumakis; Jean-Marie Vanherpe (Theor. Comput. Sci., 1997)

Bipartite Graphs Totally Decomposable by Canonical Decomposition. - Jean-Luc Fouquet; Vassilis Giakoumakis; Jean-Marie Vanherpe (Int. J. Found. Comput. Sci., 1999)

Linear time recognition of Weak bisplit graphs. - Vassilis Giakoumakis; Jean-Marie Vanherpe (Electron. Notes Discret. Math., 2000)

Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs. - Vassilis Giakoumakis; Jean-Marie Vanherpe (Int. J. Found. Comput. Sci., 2003)

The set of prime extensions of a graph: the finite and the infinite case. - Vassilis Giakoumakis; Stephan Olariu (Electron. Notes Discret. Math., 2004)

All minimal prime extensions of hereditary classes of graphs. - Vassilis Giakoumakis; Stephan Olariu (Theor. Comput. Sci., 2007)

On co-distance hereditary graphs. - Swan Dubois; Vassilis Giakoumakis; Cheikh Brahim Ould El Mounir (CTW, 2008)

Enumerating all Finite Sets of Minimal Prime Extensions of Graphs. - Vassilis Giakoumakis; Cheikh Brahim Ooud El Mounir (CTW, 2009)

Optimal Technological Architecture Evolutions of Information Systems. - Vassilis Giakoumakis; Daniel Krob; Leo Liberti; Fabio Roda (CSDM, 2010)

Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences - Andreas Brandstädt; Vassilis Giakoumakis (CoRR, 2011)

Technological architecture evolutions of information systems: Trade-off and optimization. - Vassilis Giakoumakis; Daniel Krob; Leo Liberti; Fabio Roda (Concurr. Eng. Res. Appl., 2012)

Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. - Andreas Brandstädt; Vassilis Giakoumakis; Frédéric Maffray (Discret. Appl. Math., 2012)

Maximum Weight Independent Sets in hole- and co-chair-free graphs. - Andreas Brandstädt; Vassilis Giakoumakis (Inf. Process. Lett., 2012)

Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time. - Andreas Brandstädt; Vassilis Giakoumakis (CoRR, 2014)

Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. - Anne Berry; Andreas Brandstädt; Vassilis Giakoumakis; Frédéric Maffray (Discret. Appl. Math., 2015)

Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs. - Andreas Brandstädt; Vassilis Giakoumakis (Inf. Process. Lett., 2015)

Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs. - Andreas Brandstädt; Vassilis Giakoumakis; Martin Milanic (Discret. Appl. Math., 2018)