Laurent Beaudou

Publications

Communication dans un congrès (9)

A polynomial-time algorithm recognizing exact cubes of trees Laurent Beaudou,Henry Echeverría,Florent Foucaud,Andrea Jiménez,Nikita Manuylenkoet al. 13th Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 2025), Nov 2025, Buenos Aires, Argentina. pp.86-93, ⟨10.1016/j.procs.2025.10.284⟩ Communication dans un congrès hal-05383639v1
The Canadian Traveller Problem on Outerplanar Graphs Laurent Beaudou,Pierre Bergé,Vsevolod Chernyshev,Antoine Dailly,Yan Gerardet al. Mathematical Foundations of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. pp.1-16, ⟨10.4230/LIPIcs.MFCS.2024.19⟩ Communication dans un congrès hal-04818742v1
Smallest $C_{2l+1}$-Critical Graphs of Odd-Girth $2k+1$ Laurent Beaudou,Florent Foucaud,Reza Naserasr 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.184-196, ⟨10.1007/978-3-030-39219-2_16⟩ Communication dans un congrès hal-03041342v1
Complexity of Conjunctive Regular Path Query Homomorphisms Laurent Beaudou,Florent Foucaud,Florent Madelaine,Lhouari Nourine,Gaétan Richard Conference on Computability in Europe (CiE 2019), Jul 2019, Durham, United Kingdom. pp.108-119, ⟨10.1007/978-3-030-22996-2_10⟩ Communication dans un congrès hal-02288666v1
Du nombre maximum d'ensembles fermés en 3 dimensions Alexandre Bazin,Laurent Beaudou,Giacomo Kahn,Kaveh Khoshkhah Extraction et Gestion des connaissances, 2019, Metz, France. pp.345--350 Communication dans un congrès hal-02093569v1
Octal Games on Graphs Laurent Beaudou,Pierre Coupechoux,Antoine Dailly,Sylvain Gravier,Julien Moncelet al. Combinatorial Game Theory Colloquium II, CGTC 2, Jan 2017, Lisbonne, Portugal Communication dans un congrès hal-02264751v1
Partial Duplication of Convex Sets in Lattices Laurent Beaudou,Lhouari Nourine Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, 2016, Moscow, Russia. pp.33--43 Communication dans un congrès hal-02093571v1
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs Mourad Baïou,Laurent Beaudou,Zhentao Li,Vincent Limouzy International Symposium on Algorithms and Computation, Dec 2013, Hong-Kong, China. pp.196-206, ⟨10.1007/978-3-642-45030-3_19⟩ Communication dans un congrès istex hal-02082711v1
The Lattice of all Betweenness Relations: Structure and Properties Laurent Beaudou,Mamadou Moustapha Kanté,Lhouari Nourine Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, 2012, Fuengirola (Málaga), Spain. pp.317--326 Communication dans un congrès hal-02083534v1

Pré-publication, Document de travail (3)

Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property Laurent Beaudou,Guillermo Gamboa Quintero 2025 Pré-publication, Document de travail hal-05375497v1
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. Full proof of Theorem 22 Laurent Beaudou,Pierre Coupechoux,Antoine Dailly,Sylvain Gravier,Julien Moncelet al. 2018 Pré-publication, Document de travail hal-01807116v1
Drawing disconnected graphs on the Klein bottle Laurent Beaudou,Antoine Gerbaud,Roland Grappe,Frédéric Palesi 2008 Pré-publication, Document de travail hal-00363494v1

Article dans une revue (25)

Density of 3‐critical signed graphs Laurent Beaudou,Penny Haxell,Kathryn Nurse,Sagnik Sen,Zhouningxin Wang Journal of Graph Theory, 2024, 107 (1), pp.212-239. ⟨10.1002/jgt.23117⟩ Article dans une revue hal-04996608v1
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 Lagoutteet al. Discrete Mathematics and Theoretical Computer Science, 2024, vol. 25:2 (Graph Theory), ⟨10.46298/dmtcs.8715⟩ Article dans une revue hal-03406709v1
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs Alexandre Bazin,Laurent Beaudou,Giacomo Kahn,Kaveh Khoshkhah Discrete Mathematics and Theoretical Computer Science, 2023, 23 (2 (special issue in honour of Maurice Pouzet)), pp.#10. ⟨10.46298/dmtcs.7129⟩ Article dans une revue hal-01847459v7
Graphs with no induced house nor induced hole have the de Bruijn–Erdös property Pierre Aboulker,Laurent Beaudou,Martín Matamala,José Zamora Journal of Graph Theory, 2022, ⟨10.1002/jgt.22799⟩ Article dans une revue hal-03559740v1
Bisplit graphs satisfy the Chen-Chvátal conjecture Laurent Beaudou,Giacomo Kahn,Matthieu Rosenfeld Discrete Mathematics and Theoretical Computer Science, 2019, 21 (1), ⟨10.23638/DMTCS-21-1-5⟩ Article dans une revue hal-03560934v1
Broadcast domination and multipacking: bounds and the integrality gap Laurent Beaudou,Richard C. Brewster,Florent Foucaud The Australasian Journal of Combinatorics, 2019, 74 (1), pp.86-97 Article dans une revue hal-03041313v1
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 Discrete Applied Mathematics, 2019, 261, pp.40-51. ⟨10.1016/j.dam.2018.09.004⟩ Article dans une revue hal-01915269v1
A lower bound on the size of an absorbing set in an arc-coloured tournament Laurent Beaudou,Luc Devroye,Gena Hahn Discrete Mathematics, 2019, 342, pp.143-144. ⟨10.1016/j.disc.2018.09.013⟩ Article dans une revue hal-02093568v1
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars Laurent Beaudou,Pierre Coupechoux,Antoine Dailly,Sylvain Gravier,Julien Moncelet al. Theoretical Computer Science, 2018, 746, pp.19-35. ⟨10.1016/j.tcs.2018.06.018⟩ Article dans une revue hal-01418153v3
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 Antony Henning,Arnaud Maryet al. SIAM Journal on Discrete Mathematics, 2018, 32 (2), pp.902 - 918. ⟨10.1137/16M1097833⟩ Article dans une revue hal-01848648v1
Bisplit graphs satisfy the Chen-Chvátal conjecture Laurent Beaudou,Giacomo Kahn,Matthieu Rosenfeld Computing Research Repository, 2018, abs/1808.08710 Article dans une revue hal-02093570v1
Encoding partial orders through modular decomposition Laurent Beaudou,Kaoutar Ghazi,Giacomo Kahn,Olivier Raynaud,Eric Thierry Journal of computational science, 2018, 25, pp.446-455 Article dans une revue hal-01995145v1
Bounds on Directed star arboricity in some digraph classes Henri Perret Du Cray,Mourad Baïou,Laurent Beaudou,Vincent Limouzy Electronic Notes in Discrete Mathematics, 2017, 62, pp.267 - 272. ⟨10.1016/j.endm.2017.10.046⟩ Article dans une revue hal-01784822v1
Algorithms for k-meet-semidistributive lattices Laurent Beaudou,Arnaud Mary,Lhouari Nourine Theoretical Computer Science, 2017, 658, pp.391 - 398. ⟨10.1016/j.tcs.2015.10.029⟩ Article dans une revue hal-01571243v1
Homomorphism bounds and edge-colourings of K4-minor-free graphs Laurent Beaudou,Florent Foucaud,Reza Naserasr Journal of Combinatorial Theory, Series B, 2017, 124, pp.128-164. ⟨10.1016/j.jctb.2017.01.001⟩ Article dans une revue hal-01520741v1
A De Bruijn–Erdős theorem for chordal graphs Laurent Beaudou,Adrian Bondy,Xiaomin Chen,Ehsan Chiniforooshan,Maria Chudnovskyet al. The Electronic Journal of Combinatorics, 2015, 22 (1), pp.1.70 Article dans une revue hal-01263335v1
Homomorphisms of binary Cayley graphs Laurent Beaudou,Reza Naserasr,Claude Tardif Discrete Mathematics, 2015, 338, pp.2539--2544. ⟨10.1016/j.disc.2015.06.025⟩ Article dans une revue hal-02093572v1
Making a Graph Crossing-Critical by Multiplying its Edges Laurent Beaudou,César Hernández-Vélez,Gelasio Salazar The Electronic Journal of Combinatorics, 2013, 20, pp.P61 Article dans une revue hal-02093574v1
On a class of intersection graphs Mourad Baïou,Laurent Beaudou,Zhentao Li,Vincent Limouzy Computing Research Repository, 2013, abs/1306.2498 Article dans une revue hal-02093575v1
Lines in hypergraphs Laurent Beaudou,John Bondy,Xiaomin Chen,Ehsan Chiniforooshan,Maria Chudnovskyet al. Combinatorica, 2013, 33, pp.633--654. ⟨10.1007/s00493-013-2910-5⟩ Article dans une revue istex hal-02093573v1
On the Sharpness of Some Results Relating Cuts and Crossing Numbers Laurent Beaudou,Drago Bokal The Electronic Journal of Combinatorics, 2010, 17 Article dans une revue hal-02093577v1
Covering codes in Sierpinski graphs Laurent Beaudou,Sylvain Gravier,Sandi Klavžar,Matjaz Kovse,Michel Mollard Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 3 (3), pp.63-74. ⟨10.46298/dmtcs.508⟩ Article dans une revue hal-00990423v1
Subdivided graphs as isometric subgraphs of Hamming graphs Laurent Beaudou,Sylvain Gravier,Kahina Meslem European Journal of Combinatorics, 2009, 30, pp.1062--1070. ⟨10.1016/j.ejc.2008.09.011⟩ Article dans une revue hal-00192300v1
On planarity of direct product of multipartite complete graphs Laurent Beaudou,Paul Dorbec,Pranava K. Jha,Sylvain Gravier Discrete Mathematics, Algorithms and Applications, 2009, 1 (1), pp.85-104. ⟨10.1142/S179383090900004X⟩ Article dans une revue hal-00387303v1
Isometric embeddings of subidivided complete graphs in the hypercube Laurent Beaudou,Sylvain Gravier,Kahina Meslem SIAM Journal on Discrete Mathematics, 2008, 22, pp.1226--1238. ⟨10.1137/070681909⟩ Article dans une revue hal-00187039v1

Chapitre d'ouvrage (2)

A survey about Solitaire Clobber Eric Duchene,Sylvain Gravier,Laurent Beaudou Richard Nowakowski. Games of No Chance, 4, MSRI Publications, 2015, 9781107011038 Chapitre d'ouvrage hal-01283826v1
A survey on Solitaire Clobber Laurent Beaudou,Eric Duchene,Sylvain Gravier "Games of no Chance 4". Cambridge University Press, 2015 Chapitre d'ouvrage hal-02004245v1

Thèse (1)

Autour de problèmes de plongements de graphes Laurent Beaudou Mathématiques [math]. Université Joseph-Fourier - Grenoble I, 2009. Français. ⟨NNT : ⟩ Thèse tel-00401226v1