default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVassilis Giakoumakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j19]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: 130-144 (2018)- 2015
- [j18]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: 50-61 (2015) - [j17]Andreas Brandstädt, Vassilis Giakoumakis:
Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. 115(2): 345-350 (2015) - 2014
- [i2]Andreas Brandstädt, Vassilis Giakoumakis:
Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time. CoRR abs/1407.4593 (2014) - 2012
- [j16]Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda:
Technological architecture evolutions of information systems: Trade-off and optimization. Concurr. Eng. Res. Appl. 20(2): 127-147 (2012) - [j15]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): 471-478 (2012) - [j14]Andreas Brandstädt, Vassilis Giakoumakis:
Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. 112(3): 67-71 (2012) - 2011
- [i1]Andreas Brandstädt, Vassilis Giakoumakis:
Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences. CoRR abs/1105.2874 (2011) - 2010
- [c4]Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda:
Optimal Technological Architecture Evolutions of Information Systems. CSDM 2010: 137-148
2000 – 2009
- 2009
- [c3]Vassilis Giakoumakis, Cheikh Brahim Ooud El Mounir:
Enumerating all Finite Sets of Minimal Prime Extensions of Graphs. CTW 2009: 305-309 - 2008
- [c2]Swan Dubois, Vassilis Giakoumakis, Cheikh Brahim Ould El Mounir:
On co-distance hereditary graphs. CTW 2008: 94-97 - 2007
- [j13]Vassilis Giakoumakis, Stephan Olariu:
All minimal prime extensions of hereditary classes of graphs. Theor. Comput. Sci. 370(1-3): 74-93 (2007) - 2004
- [j12]Vassilis Giakoumakis, Stephan Olariu:
The set of prime extensions of a graph: the finite and the infinite case. Electron. Notes Discret. Math. 17: 169-174 (2004) - [c1]Vassilis Giakoumakis, Stephan Olariu:
The Set of Prime Extensions of a Graph: the Finite and the Infinite Case. CTW 2004: 152-156 - 2003
- [j11]Vassilis Giakoumakis, Jean-Marie Vanherpe:
Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs. Int. J. Found. Comput. Sci. 14(1): 107-136 (2003) - 2000
- [j10]Vassilis Giakoumakis, Jean-Marie Vanherpe:
Linear time recognition of Weak bisplit graphs. Electron. Notes Discret. Math. 5: 138-141 (2000)
1990 – 1999
- 1999
- [j9]Jean-Luc Fouquet, Vassilis Giakoumakis, Jean-Marie Vanherpe:
Bipartite Graphs Totally Decomposable by Canonical Decomposition. Int. J. Found. Comput. Sci. 10(4): 513-534 (1999) - 1997
- [j8]Vassilis Giakoumakis, Irena Rusu:
Weighted Parameters in (P5, P5)-free Graphs. Discret. Appl. Math. 80(2-3): 255-261 (1997) - [j7]Jean-Luc Fouquet, Vassilis Giakoumakis:
On semi-P4-sparse graphs. Discret. Math. 165-166: 277-300 (1997) - [j6]Vassilis Giakoumakis, Florian Roussel, Henri Thuillier:
Scattering number and modular decomposition. Discret. Math. 165-166: 321-342 (1997) - [j5]Vassilis Giakoumakis:
On the closure of graphs under substitution. Discret. Math. 177(1-3): 83-97 (1997) - [j4]Vassilis Giakoumakis, Florian Roussel, Henri Thuillier:
On P4-tidy graphs. Discret. Math. Theor. Comput. Sci. 1(1): 17-41 (1997) - [j3]Vassilis Giakoumakis, Jean-Marie Vanherpe:
On Extended P4-Reducible and Extended P4-Sparse Graphs. Theor. Comput. Sci. 180(1-2): 269-286 (1997) - 1996
- [j2]Vassilis Giakoumakis:
P_4-laden Graphs: A New Class of Brittle Graphs. Inf. Process. Lett. 60(1): 29-36 (1996) - 1995
- [j1]Jean-Luc Fouquet, Vassilis Giakoumakis, Frédéric Maire, Henri Thuillier:
On graphs without P5 and P5_. Discret. Math. 146(1-3): 33-44 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
