Laurent Beaudou

48 papers B 2C 2Journal 38Unranked 5
YearRankTypeTitle / Venue / Authors
2025 C conf
A polynomial-time algorithm recognizing exact cubes of trees.
LAGOS
Laurent Beaudou, Henry Echeverría, Florent Foucaud, Andrea Jiménez, Nikita Manuylenko, Anirudh Rachuri
2025 J jnl
Profile and neighbourhood complexity of graphs with excluded minors and tree-structured graphs.
CoRR
Laurent Beaudou, Jan Bok, Florent Foucaud, Daniel A. Quiroz, Jean-Florent Raymond
2025 J jnl
Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property.
CoRR
Laurent Beaudou, Guillermo Gamboa Quintero
2024 J jnl
Density of 3-critical signed graphs.
J. Graph Theory
Laurent Beaudou, Penny Haxell, Kathryn Nurse, Sagnik Sen, Zhouningxin Wang
2024 B conf
The Canadian Traveller Problem on Outerplanar Graphs.
MFCS
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2024 J jnl
The Canadian Traveller Problem on outerplanar graphs.
CoRR
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2023 J jnl
Complexity of conjunctive regular path query homomorphisms.
CoRR
Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
2023 J jnl
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly.
Discret. Math. Theor. Comput. Sci.
Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2022 J jnl
Graphs with no induced house nor induced hole have the de Bruijn-Erdös property.
J. Graph Theory
Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora
2022 J jnl
Smallest C2ℓ+1-critical graphs of odd-girth 2k+1.
Discret. Appl. Math.
Laurent Beaudou, Florent Foucaud, Reza Naserasr
2021 J jnl
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly.
CoRR
Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2020 J jnl
Graphs with no induced house nor induced hole have the de Bruijn-Erdős property.
CoRR
Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora
2020 — conf
Smallest C
CALDAM
Laurent Beaudou, Florent Foucaud, Reza Naserasr
2019 J jnl
A lower bound on the size of an absorbing set in an arc-coloured tournament.
Discret. Math.
Laurent Beaudou, Luc Devroye, Gena Hahn
2019 J jnl
Bisplit graphs satisfy the Chen-Chvátal conjecture.
Discret. Math. Theor. Comput. Sci.
Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld
2019 J jnl
Broadcast domination and multipacking: bounds and the integrality gap.
Australas. J Comb.
Laurent Beaudou, Richard C. Brewster, Florent Foucaud
2019 C conf
Complexity of Conjunctive Regular Path Query Homomorphisms.
CiE
Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
2019 — conf
Du nombre maximum d'ensembles fermés en 3 dimensions.
EGC
Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah
2019 J jnl
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs.
Discret. Appl. Math.
Laurent Beaudou, Florent Foucaud, Reza Naserasr
2019 J jnl
On the multipacking number of grid graphs.
Discret. Math. Theor. Comput. Sci.
Laurent Beaudou, Richard C. Brewster
2018 — conf
Algorithms for a Bit-Vector Encoding of Trees.
ICO
Kaoutar Ghazi, Laurent Beaudou, Olivier Raynaud
2018 J jnl
Bisplit graphs satisfy the Chen-Chvátal conjecture.
CoRR
Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld
2018 J jnl
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs.
CoRR
Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah
2018 J jnl
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension.
SIAM J. Discret. Math.
Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary, Aline Parreau
2018 J jnl
Encoding partial orders through modular decomposition.
J. Comput. Sci.
Laurent Beaudou, Kaoutar Ghazi, Giacomo Kahn, Olivier Raynaud, Eric Thierry
2018 J jnl
Octal games on graphs: The game 0.33 on subdivided stars and bistars.
Theor. Comput. Sci.
Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena
2018 J jnl
On the multipacking number of grid graphs.
CoRR
Laurent Beaudou, Rick C. Brewster
2017 J jnl
Algorithms for k-meet-semidistributive lattices.
Theor. Comput. Sci.
Laurent Beaudou, Arnaud Mary, Lhouari Nourine
2017 J jnl
Bounds on Directed star arboricity in some digraph classes.
Electron. Notes Discret. Math.
Henri Perret du Cray, Mourad Baïou, Laurent Beaudou, Vincent Limouzy
2017 J jnl
Homomorphism bounds and edge-colourings of K
J. Comb. Theory B
Laurent Beaudou, Florent Foucaud, Reza Naserasr
2016 J jnl
Homomorphism bounds and edge-colourings of K
CoRR
Laurent Beaudou, Florent Foucaud, Reza Naserasr
2016 J jnl
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars.
CoRR
Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena
2016 — conf
Partial Duplication of Convex Sets in Lattices.
CLA
Laurent Beaudou, Lhouari Nourine
2015 J jnl
A De Bruijn-Erdős Theorem for Chordal Graphs.
Electron. J. Comb.
Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols
2015 J jnl
Homomorphisms of binary Cayley graphs.
Discret. Math.
Laurent Beaudou, Reza Naserasr, Claude Tardif
2013 B conf
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs.
ISAAC
Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy
2013 J jnl
Lines in hypergraphs.
Comb.
Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols
2013 J jnl
Making a Graph Crossing-Critical by Multiplying its Edges.
Electron. J. Comb.
Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar
2013 J jnl
On a class of intersection graphs.
CoRR
Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy
2012 — conf
The Lattice of all Betweenness Relations: Structure and Properties.
CLA
Laurent Beaudou, Mamadou Moustapha Kanté, Lhouari Nourine
2010 J jnl
Covering codes in Sierpinski graphs.
Discret. Math. Theor. Comput. Sci.
Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard
2010 J jnl
Drawing Disconnected Graphs on the Klein Bottle.
Graphs Comb.
Laurent Beaudou, Antoine Gerbaud, Roland Grappe, Frédéric Palesi
2010 J jnl
On the Sharpness of Some Results Relating Cuts and Crossing Numbers.
Electron. J. Comb.
Laurent Beaudou, Drago Bokal
2009 — —
Autour de problèmes de plongements de graphes. (Around some problems of graphs embeddings).
Laurent Beaudou
2009 J jnl
On Planarity of Direct Product of multipartite Complete Graphs.
Discret. Math. Algorithms Appl.
Laurent Beaudou, Paul Dorbec, Sylvain Gravier, Pranava K. Jha
2009 J jnl
Subdivided graphs as isometric subgraphs of Hamming graphs.
Eur. J. Comb.
Laurent Beaudou, Sylvain Gravier, Kahina Meslem
2008 J jnl
Isometric Embeddings of Subdivided Complete Graphs in the Hypercube.
SIAM J. Discret. Math.
Laurent Beaudou, Sylvain Gravier, Kahina Meslem
2007 J jnl
Isometric embeddings of subdivided complete graphs in the hypercube.
Electron. Notes Discret. Math.
Laurent Beaudou, Sylvain Gravier, Kahina Meslem