Guillaume Bagan

According to our database1, Guillaume Bagan authored at least 19 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Partition strategies for the Maker-Breaker domination game.
CoRR, 2024

Fast winning strategies for the attacker in eternal domination.
CoRR, 2024

Poset Positional Games.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2022
Complexity of edge monitoring on some graph classes.
Discret. Appl. Math., 2022

2021
Eternal dominating sets on digraphs and orientations of graphs.
Discret. Appl. Math., 2021

Weighted total acquisition.
Discret. Appl. Math., 2021

2020
A trichotomy for regular simple path queries on graphs.
J. Comput. Syst. Sci., 2020

2017
gMark: Schema-Driven Generation of Graphs and Queries.
IEEE Trans. Knowl. Data Eng., 2017

On some domination colorings of graphs.
Discret. Appl. Math., 2017

2016
Generating Flexible Workloads for Graph Databases.
Proc. VLDB Endow., 2016

Edge Monitoring Problem on Interval Graphs.
Electron. Notes Discret. Math., 2016

2015
Controlling Diversity in Benchmarking Graph Databases.
CoRR, 2015

2010
A novel framework to detect source code plagiarism: now, students have to work for real!
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Efficient Enumeration for Conjunctive Queries over X-underbar Structures.
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).
PhD thesis, 2009

Approximable 1-Turn Routing Problems in All-Optical Mesh Networks.
Algorithmic Oper. Res., 2009

2008
Computing the jth solution of a first-order query.
RAIRO Theor. Informatics Appl., 2008

2007
On Acyclic Conjunctive Queries and Constant Delay Enumeration.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006


  Loading...