Laurent Beaudou

2021¹

2020¹

2019⁶

• Article Beaudou L., Devroye L., Hahn G. A lower bound on the size of an absorbing set in an arc-coloured tournament // Discrete Mathematics. 2019. Vol. 342. No. 1. P. 143-144. doi
• Article Beaudou L., Kahn G., Rosenfeld M. Bisplit graphs satisfy the Chen-Chvátal conjecture // Discrete Mathematics and Theoretical Computer Science. 2019. Vol. 21. No. 1. P. 1-12. doi
• Article Beaudou L., Brewster R. C., Foucaud F. Broadcast domination and multipacking: bounds and the integrality gap // Australasian Journal of Combinatorics. 2019. Vol. 74. No. 1. P. 86-97.
• Chapter Beaudou L., Foucaud F., Madelaine F., Nourine L., Richard G. Complexity of Conjunctive Regular Path Query Homomorphisms, in: (LNCS 11558) Computing with Foresight and Industry, Proceedings of 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019. Switzerland : Springer, 2019. doi P. 108-119. doi
• Article Beaudou L., Foucaud F., Naserasr R. Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs // Discrete Applied Mathematics. 2019. Vol. 261. P. 40-51. doi
• Article Beaudou L., Brewster R. C. On the multipacking number of grid graphs // Discrete Mathematics and Theoretical Computer Science. 2019. Vol. 21. No. 3. P. 1-13.

2018³

• Article Beaudou L., Dankelmann P., Foucaud F., Henning M. A., Mary A., Parreau A. Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension // SIAM Journal of Discrete Mathematics. 2018. Vol. 32. No. 2. P. 902-918. doi
• Article Beaudou L., Ghazi K., Kahn G., Raynaud O., Thierry É. Encoding partial orders through modular decomposition. // Journal of Computational Science. 2018. Vol. 25. P. 446-455. doi
• Article Beaudou L., Coupechoux P., Dailly A., Gravier S., Moncel J., Parreau A., Sopéna É. Octal games on graphs: The game 0.33 on subdivided stars and bistars // Theoretical Computer Science. 2018. Vol. 746. P. 19-35. doi

2017³

• Article Beaudou L., Nourine L., Mary A. Algorithms for k-meet-semidistributive lattices // Theoretical Computer Science. 2017. Vol. 658. P. 391-398. doi
• Article Perret du Cray H., Baïou M., Beaudou L., Limouzy V. Bounds on Directed star arboricity in some digraph classes // Electronic Notes in Discrete Mathematics. 2017. Vol. 62. P. 267-272. doi
• Article Beaudou L., Foucaud F., Naserasr R. Homomorphism bounds and edge-colourings of K4-minor-free graphs // Journal of Combinatorial Theory. Series B. 2017. Vol. 124. P. 128-164. doi

2016¹

2015²

• Article Beaudou L., Bondy A., Chen X., Chiniforooshan E., Chudnovsky M., Chvátal V., Fraiman N., Zwols Y. A De Bruijn-Erdős Theorem for Chordal Graphs // Electronic Journal of Combinatorics. 2015. Vol. 22. No. 1. P. 1-6.
• Article Beaudou L., Naserasr R., Tardif C. Homomorphisms of binary Cayley graphs. // Discrete Mathematics. 2015. Vol. 338. No. 12. P. 2539-2544. doi

2013⁴

• Article Beaudou L., Grappe R., Hahn G. Gathering information in a graph // Journal of Combinatorial Mathematics and Combinatorial Computing. 2013. Vol. 85. P. 65-78.
• Chapter Baïou M., Beaudou L., Limouzy V., Li Z. Hardness and Algorithms for Variants of Line Graphs of Directed Graphs, in: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings. Heidelberg : Springer, 2013. doi P. 196-206. doi
• Article Beaudou L., Bondy A., Chen X., Chiniforooshan E., Chudnovsky M., Chvátal V., Fraiman N., Zwols Y. Lines in hypergraphs // Combinatorica. 2013. Vol. 33. No. 6. P. 633-654. doi
• Article Beaudou L., Hernández-Vélez C., Salazar G. Making a Graph Crossing-Critical by Multiplying its Edges // Electronic Journal of Combinatorics. 2013. Vol. 20. No. 1. P. 1-14.