Vassilis Giakoumakis

Publication Activity (10 Years)

Years Active: 1995-2018
Publications (10 Years): 1

Top Topics

Graph Theoretic

Bipartite Matching

Minimum Spanning Tree

Top Venues

Discret. Appl. Math.

Inf. Process. Lett.

Concurr. Eng. Res. Appl.

Publications

Andreas Brandstädt, Vassilis Giakoumakis, Martin Milanic
Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs. Discret. Appl. Math. 250 (2018)
Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Discret. Appl. Math. 184 (2015)
Andreas Brandstädt, Vassilis Giakoumakis
Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. 115 (2) (2015)
Andreas Brandstädt, Vassilis Giakoumakis
Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time. CoRR (2014)
Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda
Technological architecture evolutions of information systems: Trade-off and optimization. Concurr. Eng. Res. Appl. 20 (2) (2012)
Andreas Brandstädt, Vassilis Giakoumakis
Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. 112 (3) (2012)
Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. Discret. Appl. Math. 160 (4-5) (2012)
Andreas Brandstädt, Vassilis Giakoumakis
Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences CoRR (2011)
Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda
Optimal Technological Architecture Evolutions of Information Systems. CSDM (2010)
Vassilis Giakoumakis, Cheikh Brahim Ooud El Mounir
Enumerating all Finite Sets of Minimal Prime Extensions of Graphs. CTW (2009)
Swan Dubois, Vassilis Giakoumakis, Cheikh Brahim Ould El Mounir
On co-distance hereditary graphs. CTW (2008)
Vassilis Giakoumakis, Stephan Olariu
All minimal prime extensions of hereditary classes of graphs. Theor. Comput. Sci. 370 (1-3) (2007)
Vassilis Giakoumakis, Stephan Olariu
The set of prime extensions of a graph: the finite and the infinite case. Electron. Notes Discret. Math. 17 (2004)
Vassilis Giakoumakis, Stephan Olariu
The Set of Prime Extensions of a Graph: the Finite and the Infinite Case. CTW (2004)
Vassilis Giakoumakis, Jean-Marie Vanherpe
-Free Graphs. Int. J. Found. Comput. Sci. 14 (1) (2003)
Vassilis Giakoumakis, Jean-Marie Vanherpe
Linear time recognition of Weak bisplit graphs. Electron. Notes Discret. Math. 5 (2000)
Jean-Luc Fouquet, Vassilis Giakoumakis, Jean-Marie Vanherpe
Bipartite Graphs Totally Decomposable by Canonical Decomposition. Int. J. Found. Comput. Sci. 10 (4) (1999)
Vassilis Giakoumakis, Irena Rusu
Graphs. Discret. Appl. Math. 80 (2-3) (1997)
Vassilis Giakoumakis, Jean-Marie Vanherpe
-Sparse Graphs. Theor. Comput. Sci. 180 (1-2) (1997)
Vassilis Giakoumakis
On the closure of graphs under substitution. Discret. Math. 177 (1-3) (1997)
Jean-Luc Fouquet, Vassilis Giakoumakis
-sparse graphs. Discret. Math. (1997)
Vassilis Giakoumakis, Florian Roussel, Henri Thuillier
Scattering number and modular decomposition. Discret. Math. (1997)
Vassilis Giakoumakis, Florian Roussel, Henri Thuillier
-tidy graphs. Discret. Math. Theor. Comput. Sci. 1 (1) (1997)
Vassilis Giakoumakis
P_4-laden Graphs: A New Class of Brittle Graphs. Inf. Process. Lett. 60 (1) (1996)
Jean-Luc Fouquet, Vassilis Giakoumakis, Frédéric Maire, Henri Thuillier
. Discret. Math. 146 (1-3) (1995)