MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay. - Guillaume Bagan (CSL, 2006)

On Acyclic Conjunctive Queries and Constant Delay Enumeration. - Guillaume Bagan; Arnaud Durand 001; Etienne Grandjean (CSL, 2007)

Computing the jth solution of a first-order query. - Guillaume Bagan; Arnaud Durand 001; Etienne Grandjean; Frédéric Olive (RAIRO Theor. Informatics Appl., 2008)

Approximable 1-Turn Routing Problems in All-Optical Mesh Networks. - Jérôme Palaysi; Olivier Cogis; Guillaume Bagan (Algorithmic Oper. Res., 2009)

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). - Guillaume Bagan (2009)

Efficient Enumeration for Conjunctive Queries over X-underbar Structures. - Guillaume Bagan; Arnaud Durand 001; Emmanuel Filiot; Olivier Gauwin (CSL, 2010)

A novel framework to detect source code plagiarism: now, students have to work for real! - Boris Lesner; Romain Brixtel; Cyril Bazin; Guillaume Bagan (SAC, 2010)

Controlling Diversity in Benchmarking Graph Databases. - Guillaume Bagan; Angela Bonifati; Radu Ciucanu; George H. L. Fletcher; Aurélien Lemay; Nicky Advokaat (CoRR, 2015)

Edge Monitoring Problem on Interval Graphs. - Guillaume Bagan; Fairouz Beggas; Mohammed Haddad 001; Hamamache Kheddouci (Electron. Notes Discret. Math., 2016)

Generating Flexible Workloads for Graph Databases. - Guillaume Bagan; Angela Bonifati; Radu Ciucanu; George H. L. Fletcher; Aurélien Lemay; Nicky Advokaat (Proc. VLDB Endow., 2016)

On some domination colorings of graphs. - Guillaume Bagan; Hocine Boumediene Merouane; Mohammed Haddad 001; Hamamache Kheddouci (Discret. Appl. Math., 2017)

gMark: Schema-Driven Generation of Graphs and Queries. - Guillaume Bagan; Angela Bonifati; Radu Ciucanu; George H. L. Fletcher; Aurélien Lemay; Nicky Advokaat (IEEE Trans. Knowl. Data Eng., 2017)

A trichotomy for regular simple path queries on graphs. - Guillaume Bagan; Angela Bonifati; Benoît Groz (J. Comput. Syst. Sci., 2020)

Weighted total acquisition. - Guillaume Bagan; Valentin Gledel; Marc Heinrich; Fionn Mc Inerney (Discret. Appl. Math., 2021)

Eternal dominating sets on digraphs and orientations of graphs. - Guillaume Bagan; Alice Joffard; Hamamache Kheddouci (Discret. Appl. Math., 2021)

Complexity of edge monitoring on some graph classes. - Guillaume Bagan; Fairouz Beggas; Mohammed Haddad 001; Hamamache Kheddouci (Discret. Appl. Math., 2022)

Fast Winning Strategies for the Attacker in Eternal Domination. - Guillaume Bagan; Nicolas Bousquet 001; Nacim Oijid; Théo Pierron (WG, 2024)

Poset positional games. - Guillaume Bagan; Éric Duchêne; Florian Galliot; Valentin Gledel; Mirjana Mikalacki; Nacim Oijid; Aline Parreau; Milos Stojakovic (Discret. Math., 2025)

Partition Strategies for the Maker-Breaker Domination Game. - Guillaume Bagan; Éric Duchêne; Valentin Gledel; Tuomo Lehtilä; Aline Parreau (Algorithmica, 2025)