Vassilis Giakoumakis

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