default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Bagan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Poset Positional Games. FUN 2024: 2:1-2:12- [i7]Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron:
Fast winning strategies for the attacker in eternal domination. CoRR abs/2401.10584 (2024) - [i6]Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Poset Positional Games. CoRR abs/2404.07700 (2024) - [i5]Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau:
Partition strategies for the Maker-Breaker domination game. CoRR abs/2406.15165 (2024) - 2022
- [j10]Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci:
Complexity of edge monitoring on some graph classes. Discret. Appl. Math. 321: 49-63 (2022) - 2021
- [j9]Guillaume Bagan, Alice Joffard, Hamamache Kheddouci:
Eternal dominating sets on digraphs and orientations of graphs. Discret. Appl. Math. 291: 99-115 (2021) - [j8]Guillaume Bagan, Valentin Gledel, Marc Heinrich, Fionn Mc Inerney
:
Weighted total acquisition. Discret. Appl. Math. 304: 260-282 (2021) - 2020
- [j7]Guillaume Bagan, Angela Bonifati, Benoît Groz:
A trichotomy for regular simple path queries on graphs. J. Comput. Syst. Sci. 108: 29-48 (2020)
2010 – 2019
- 2018
- [i4]Guillaume Bagan, Alice Joffard, Hamamache Kheddouci:
Eternal dominating sets on digraphs and orientations of graphs. CoRR abs/1805.09623 (2018) - 2017
- [j6]Guillaume Bagan, Hocine Boumediene Merouane, Mohammed Haddad, Hamamache Kheddouci:
On some domination colorings of graphs. Discret. Appl. Math. 230: 34-50 (2017) - [j5]Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat:
gMark: Schema-Driven Generation of Graphs and Queries. IEEE Trans. Knowl. Data Eng. 29(4): 856-869 (2017) - [c6]Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat:
gMark: Schema-Driven Generation of Graphs and Queries. ICDE 2017: 63-64 - [i3]Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci:
Complexity of Edge Monitoring on Some Graph Classes. CoRR abs/1710.02013 (2017) - 2016
- [j4]Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci:
Edge Monitoring Problem on Interval Graphs. Electron. Notes Discret. Math. 54: 331-336 (2016) - [j3]Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat:
Generating Flexible Workloads for Graph Databases. Proc. VLDB Endow. 9(13): 1457-1460 (2016) - 2015
- [i2]Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat:
Controlling Diversity in Benchmarking Graph Databases. CoRR abs/1511.08386 (2015) - 2013
- [c5]Guillaume Bagan, Angela Bonifati, Benoît Groz:
A trichotomy for regular simple path queries on graphs. PODS 2013: 261-272 - 2012
- [i1]Guillaume Bagan, Angela Bonifati, Benoît Groz:
A Trichotomy for Regular Simple Path Queries on Graphs. CoRR abs/1212.6857 (2012) - 2010
- [c4]Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin:
Efficient Enumeration for Conjunctive Queries over X-underbar Structures. CSL 2010: 80-94 - [c3]Boris Lesner, Romain Brixtel, Cyril Bazin, Guillaume Bagan:
A novel framework to detect source code plagiarism: now, students have to work for real! SAC 2010: 57-58
2000 – 2009
- 2009
- [b1]Guillaume Bagan:
Algorithmes et complexité des problèmes d'énumération pour l'évaluation de requêtes logiques. (Algorithms and complexity of enumeration problems for the evaluation of logical queries). University of Caen Normandy, France, 2009 - [j2]Jérôme Palaysi, Olivier Cogis, Guillaume Bagan:
Approximable 1-Turn Routing Problems in All-Optical Mesh Networks. Algorithmic Oper. Res. 4(2): 95-101 (2009) - 2008
- [j1]Guillaume Bagan, Arnaud Durand, Etienne Grandjean, Frédéric Olive:
Computing the jth solution of a first-order query. RAIRO Theor. Informatics Appl. 42(1): 147-164 (2008) - 2007
- [c2]Guillaume Bagan, Arnaud Durand, Etienne Grandjean:
On Acyclic Conjunctive Queries and Constant Delay Enumeration. CSL 2007: 208-222 - 2006
- [c1]Guillaume Bagan:
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay. CSL 2006: 167-181
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 2024-07-25 20:20 CEST 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:
