Vassilis Giakoumakis

According to our database, Vassilis Giakoumakis authored at least 24 papers between 1995 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

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

2015

Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs.

Andreas Brandstädt, Vassilis Giakoumakis

Inf. Process. Lett., 2015

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

2014

Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time.

Andreas Brandstädt, Vassilis Giakoumakis

CoRR, 2014

2012

Maximum Weight Independent Sets in hole- and co-chair-free graphs.

Andreas Brandstädt, Vassilis Giakoumakis

Inf. Process. Lett., 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

Technological architecture evolutions of information systems: Trade-off and optimization.

Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda

Concurr. Eng. Res. Appl., 2012

2011

Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences

Andreas Brandstädt, Vassilis Giakoumakis

CoRR, 2011

2010

Optimal Technological Architecture Evolutions of Information Systems.

Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda

Proceedings of the Complex Systems Design & Management, 2010

2009

Enumerating all Finite Sets of Minimal Prime Extensions of Graphs.

Vassilis Giakoumakis, Cheikh Brahim Ooud El Mounir

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

On co-distance hereditary graphs.

Swan Dubois, Vassilis Giakoumakis, Cheikh Brahim Ould El Mounir

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

All minimal prime extensions of hereditary classes of graphs.

Vassilis Giakoumakis, Stephan Olariu

Theor. Comput. Sci., 2007

2004

The Set of Prime Extensions of a Graph: the Finite and the Infinite Case.

Vassilis Giakoumakis, Stephan Olariu

Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003

Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P₆-Free Graphs.

Vassilis Giakoumakis, Jean-Marie Vanherpe

Int. J. Found. Comput. Sci., 2003

2000

Linear time recognition of Weak bisplit graphs.

Vassilis Giakoumakis, Jean-Marie Vanherpe

Electron. Notes Discret. Math., 2000

1999

Bipartite Graphs Totally Decomposable by Canonical Decomposition.

Jean-Luc Fouquet, Vassilis Giakoumakis, Jean-Marie Vanherpe

Int. J. Found. Comput. Sci., 1999

1997

On Extended P₄-Reducible and Extended P₄-Sparse Graphs.

Vassilis Giakoumakis, Jean-Marie Vanherpe

Theor. Comput. Sci., 1997

On P₄-tidy graphs.

Vassilis Giakoumakis, Florian Roussel, Henri Thuillier

Discret. Math. Theor. Comput. Sci., 1997

Scattering number and modular decomposition.

Vassilis Giakoumakis, Florian Roussel, Henri Thuillier

Discret. Math., 1997

On the closure of graphs under substitution.

Vassilis Giakoumakis

Discret. Math., 1997

On semi-P₄-sparse graphs.

Jean-Luc Fouquet, Vassilis Giakoumakis

Discret. Math., 1997

Weighted Parameters in _{(P5, P5)-free} Graphs.

Vassilis Giakoumakis, Irena Rusu

Discret. Appl. Math., 1997

1996

P_4-laden Graphs: A New Class of Brittle Graphs.

Vassilis Giakoumakis

Inf. Process. Lett., 1996

1995

On graphs without P₅ and P₅^_.

Jean-Luc Fouquet, Vassilis Giakoumakis, Frédéric Maire, Henri Thuillier

Discret. Math., 1995