Guillaume Bagan

30 papers A* 2B 4Misc 2Journal 21
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the parameterized complexity of the Maker-Breaker domination game.
CoRR
Guillaume Bagan, Mathieu Hilaire, Nacim Oijid, Aline Parreau
2026 J jnl
Token positional games.
CoRR
Guillaume Bagan, Quentin Deschamps, Florian Galliot, Mirjana Mikalacki, Nacim Oijid
2025 J jnl
Partition Strategies for the Maker-Breaker Domination Game.
Algorithmica
Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau
2025 J jnl
Poset positional games.
Discret. Math.
Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic
2024 B conf
Fast Winning Strategies for the Attacker in Eternal Domination.
WG
Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron
2024 J jnl
Fast winning strategies for the attacker in eternal domination.
CoRR
Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron
2024 J jnl
Partition strategies for the Maker-Breaker domination game.
CoRR
Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau
2024 Misc conf
Poset Positional Games.
FUN
Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic
2024 J jnl
Poset Positional Games.
CoRR
Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic
2022 J jnl
Complexity of edge monitoring on some graph classes.
Discret. Appl. Math.
Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci
2021 J jnl
Eternal dominating sets on digraphs and orientations of graphs.
Discret. Appl. Math.
Guillaume Bagan, Alice Joffard, Hamamache Kheddouci
2021 J jnl
Weighted total acquisition.
Discret. Appl. Math.
Guillaume Bagan, Valentin Gledel, Marc Heinrich, Fionn Mc Inerney
2020 J jnl
A trichotomy for regular simple path queries on graphs.
J. Comput. Syst. Sci.
Guillaume Bagan, Angela Bonifati, Benoît Groz
2018 J jnl
Eternal dominating sets on digraphs and orientations of graphs.
CoRR
Guillaume Bagan, Alice Joffard, Hamamache Kheddouci
2017 J jnl
Complexity of Edge Monitoring on Some Graph Classes.
CoRR
Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci
2017 J jnl
On some domination colorings of graphs.
Discret. Appl. Math.
Guillaume Bagan, Hocine Boumediene Merouane, Mohammed Haddad, Hamamache Kheddouci
2017 A* conf
gMark: Schema-Driven Generation of Graphs and Queries.
ICDE
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
2017 J jnl
gMark: Schema-Driven Generation of Graphs and Queries.
IEEE Trans. Knowl. Data Eng.
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
2016 J jnl
Edge Monitoring Problem on Interval Graphs.
Electron. Notes Discret. Math.
Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci
2016 J jnl
Generating Flexible Workloads for Graph Databases.
Proc. VLDB Endow.
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
2015 J jnl
Controlling Diversity in Benchmarking Graph Databases.
CoRR
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
2013 A* conf
A trichotomy for regular simple path queries on graphs.
PODS
Guillaume Bagan, Angela Bonifati, Benoît Groz
2012 J jnl
A Trichotomy for Regular Simple Path Queries on Graphs
CoRR
Guillaume Bagan, Angela Bonifati, Benoît Groz
2010 Misc conf
A novel framework to detect source code plagiarism: now, students have to work for real!
SAC
Boris Lesner, Romain Brixtel, Cyril Bazin, Guillaume Bagan
2010 B conf
Efficient Enumeration for Conjunctive Queries over X-underbar Structures.
CSL
Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin
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 J jnl
Approximable 1-Turn Routing Problems in All-Optical Mesh Networks.
Algorithmic Oper. Res.
Jérôme Palaysi, Olivier Cogis, Guillaume Bagan
2008 J jnl
Computing the jth solution of a first-order query.
RAIRO Theor. Informatics Appl.
Guillaume Bagan, Arnaud Durand, Etienne Grandjean, Frédéric Olive
2007 B conf
On Acyclic Conjunctive Queries and Constant Delay Enumeration.
CSL
Guillaume Bagan, Arnaud Durand, Etienne Grandjean
2006 B conf
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay.
CSL
Guillaume Bagan