Guillaume Bagan

According to our database, Guillaume Bagan authored at least 17 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Fast winning strategies for the attacker in eternal domination.

Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron

CoRR, 2024

2022

Complexity of edge monitoring on some graph classes.

Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci

Discret. Appl. Math., 2022

2021

Eternal dominating sets on digraphs and orientations of graphs.

Guillaume Bagan, Alice Joffard, Hamamache Kheddouci

Discret. Appl. Math., 2021

Weighted total acquisition.

Guillaume Bagan, Valentin Gledel, Marc Heinrich, Fionn Mc Inerney

Discret. Appl. Math., 2021

2020

A trichotomy for regular simple path queries on graphs.

Guillaume Bagan, Angela Bonifati, Benoît Groz

J. Comput. Syst. Sci., 2020

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

On some domination colorings of graphs.

Guillaume Bagan, Hocine Boumediene Merouane, Mohammed Haddad, Hamamache Kheddouci

Discret. Appl. Math., 2017

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

Edge Monitoring Problem on Interval Graphs.

Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci

Electron. Notes Discret. Math., 2016

2015

Controlling Diversity in Benchmarking Graph Databases.

Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat

CoRR, 2015

2010

A novel framework to detect source code plagiarism: now, students have to work for real!

Boris Lesner, Romain Brixtel, Cyril Bazin, Guillaume Bagan

Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Efficient Enumeration for Conjunctive Queries over X-underbar Structures.

Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

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

PhD thesis, 2009

Approximable 1-Turn Routing Problems in All-Optical Mesh Networks.

Jérôme Palaysi, Olivier Cogis, Guillaume Bagan

Algorithmic Oper. Res., 2009

2008

Computing the jth solution of a first-order query.

Guillaume Bagan, Arnaud Durand, Etienne Grandjean, Frédéric Olive

RAIRO Theor. Informatics Appl., 2008

2007

On Acyclic Conjunctive Queries and Constant Delay Enumeration.

Guillaume Bagan, Arnaud Durand, Etienne Grandjean

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay.

Guillaume Bagan

Proceedings of the Computer Science Logic, 20th International Workshop, 2006