Complexity dichotomy for oriented homomorphism of planar graphs with large girth. - Guillaume Guégan; Pascal Ochem (Theor. Comput. Sci., 2015)

A short proof that shuffle squares are 7-avoidable. - Guillaume Guégan; Pascal Ochem (RAIRO Theor. Informatics Appl., 2016)

The interval number of a planar graph is at most three. - Guillaume Guégan; Kolja Knauer; Jonathan Rollin; Torsten Ueckerdt (J. Comb. Theory B, 2021)