Isometric embeddings of subdivided complete graphs in the hypercube. - Laurent Beaudou; Sylvain Gravier; Kahina Meslem (Electron. Notes Discret. Math., 2007)

On Planarity of Direct Product of multipartite Complete Graphs. - Laurent Beaudou; Paul Dorbec; Sylvain Gravier; Pranava K. Jha (Discret. Math. Algorithms Appl., 2009)

Subdivided graphs as isometric subgraphs of Hamming graphs. - Laurent Beaudou; Sylvain Gravier; Kahina Meslem (Eur. J. Comb., 2009)

Autour de problèmes de plongements de graphes. (Around some problems of graphs embeddings). - Laurent Beaudou (2009)

On the Sharpness of Some Results Relating Cuts and Crossing Numbers. - Laurent Beaudou; Drago Bokal (Electron. J. Comb., 2010)

Covering codes in Sierpinski graphs. - Laurent Beaudou; Sylvain Gravier; Sandi Klavzar; Matjaz Kovse; Michel Mollard (Discret. Math. Theor. Comput. Sci., 2010)

Drawing Disconnected Graphs on the Klein Bottle. - Laurent Beaudou; Antoine Gerbaud; Roland Grappe; Frédéric Palesi (Graphs Comb., 2010)

The Lattice of all Betweenness Relations: Structure and Properties. - Laurent Beaudou; Mamadou Moustapha Kanté; Lhouari Nourine (CLA, 2012)

Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. - Mourad Baïou; Laurent Beaudou; Zhentao Li; Vincent Limouzy (ISAAC, 2013)

Lines in hypergraphs. - Laurent Beaudou; J. Adrian Bondy; Xiaomin Chen; Ehsan Chiniforooshan; Maria Chudnovsky; Vasek Chvátal; Nicolas Fraiman; Yori Zwols (Comb., 2013)

Making a Graph Crossing-Critical by Multiplying its Edges. - Laurent Beaudou; César Hernández-Vélez; Gelasio Salazar (Electron. J. Comb., 2013)

On a class of intersection graphs. - Mourad Baïou; Laurent Beaudou; Zhentao Li; Vincent Limouzy (CoRR, 2013)

A De Bruijn-Erdős Theorem for Chordal Graphs. - Laurent Beaudou; J. Adrian Bondy; Xiaomin Chen; Ehsan Chiniforooshan; Maria Chudnovsky; Vasek Chvátal; Nicolas Fraiman; Yori Zwols (Electron. J. Comb., 2015)

Homomorphisms of binary Cayley graphs. - Laurent Beaudou; Reza Naserasr; Claude Tardif (Discret. Math., 2015)

Partial Duplication of Convex Sets in Lattices. - Laurent Beaudou; Lhouari Nourine (CLA, 2016)

Bounds on Directed star arboricity in some digraph classes. - Henri Perret du Cray; Mourad Baïou; Laurent Beaudou; Vincent Limouzy (Electron. Notes Discret. Math., 2017)

Homomorphism bounds and edge-colourings of K4-minor-free graphs. - Laurent Beaudou; Florent Foucaud; Reza Naserasr (J. Comb. Theory B, 2017)

Algorithms for k-meet-semidistributive lattices. - Laurent Beaudou; Arnaud Mary; Lhouari Nourine (Theor. Comput. Sci., 2017)

Algorithms for a Bit-Vector Encoding of Trees. - Kaoutar Ghazi; Laurent Beaudou; Olivier Raynaud (ICO, 2018)

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. - Alexandre Bazin; Laurent Beaudou; Giacomo Kahn; Kaveh Khoshkhah (CoRR, 2018)

Encoding partial orders through modular decomposition. - Laurent Beaudou; Kaoutar Ghazi; Giacomo Kahn; Olivier Raynaud; Eric Thierry (J. Comput. Sci., 2018)

Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. - Laurent Beaudou; Peter Dankelmann; Florent Foucaud; Michael A. Henning; Arnaud Mary; Aline Parreau (SIAM J. Discret. Math., 2018)

Octal games on graphs: The game 0.33 on subdivided stars and bistars. - Laurent Beaudou; Pierre Coupechoux; Antoine Dailly; Sylvain Gravier; Julien Moncel; Aline Parreau; Éric Sopena (Theor. Comput. Sci., 2018)

Complexity of Conjunctive Regular Path Query Homomorphisms. - Laurent Beaudou; Florent Foucaud; Florent R. Madelaine; Lhouari Nourine; Gaétan Richard (CiE, 2019)

Du nombre maximum d'ensembles fermés en 3 dimensions. - Alexandre Bazin; Laurent Beaudou; Giacomo Kahn; Kaveh Khoshkhah (EGC, 2019)

Broadcast domination and multipacking: bounds and the integrality gap. - Laurent Beaudou; Richard C. Brewster; Florent Foucaud (Australas. J Comb., 2019)

Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. - Laurent Beaudou; Florent Foucaud; Reza Naserasr (Discret. Appl. Math., 2019)

A lower bound on the size of an absorbing set in an arc-coloured tournament. - Laurent Beaudou; Luc Devroye; Gena Hahn (Discret. Math., 2019)

On the multipacking number of grid graphs. - Laurent Beaudou; Richard C. Brewster (Discret. Math. Theor. Comput. Sci., 2019)

Bisplit graphs satisfy the Chen-Chvátal conjecture. - Laurent Beaudou; Giacomo Kahn; Matthieu Rosenfeld (Discret. Math. Theor. Comput. Sci., 2019)

Smallest C2l+1-Critical Graphs of Odd-Girth 2k+1. - Laurent Beaudou; Florent Foucaud; Reza Naserasr (CALDAM, 2020)

Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. - Laurent Beaudou; Florent Foucaud; Reza Naserasr (Discret. Appl. Math., 2022)

Graphs with no induced house nor induced hole have the de Bruijn-Erdös property. - Pierre Aboulker; Laurent Beaudou; Martín Matamala; José Zamora (J. Graph Theory, 2022)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. - Laurent Beaudou; Caroline Brosse; Oscar Defrain; Florent Foucaud; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor (Discret. Math. Theor. Comput. Sci., 2023)

The Canadian Traveller Problem on Outerplanar Graphs. - Laurent Beaudou; Pierre Bergé; Vsevolod Chernyshev; Antoine Dailly; Yan Gerard; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor (MFCS, 2024)

Density of 3-critical signed graphs. - Laurent Beaudou; Penny Haxell; Kathryn Nurse; Sagnik Sen 001; Zhouningxin Wang (J. Graph Theory, 2024)

Profile and neighbourhood complexity of graphs with excluded minors and tree-structured graphs. - Laurent Beaudou; Jan Bok; Florent Foucaud; Daniel A. Quiroz; Jean-Florent Raymond (CoRR, 2025)