Laurent Beaudou

Orcid: 0000-0003-1959-6855

Affiliations:
  • University of Bordeaux 1, LABRI, France


According to our database1, Laurent Beaudou authored at least 35 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Canadian Traveller Problem on outerplanar graphs.
CoRR, 2024

2022
Graphs with no induced house nor induced hole have the de Bruijn-Erdös property.
J. Graph Theory, 2022

Smallest C2ℓ+1-critical graphs of odd-girth 2k+1.
Discret. Appl. Math., 2022

2021
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly.
CoRR, 2021

2020
Smallest C<sub>2l+1</sub>-Critical Graphs of Odd-Girth 2k+1.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
Bisplit graphs satisfy the Chen-Chvátal conjecture.
Discret. Math. Theor. Comput. Sci., 2019

On the multipacking number of grid graphs.
Discret. Math. Theor. Comput. Sci., 2019

A lower bound on the size of an absorbing set in an arc-coloured tournament.
Discret. Math., 2019

Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs.
Discret. Appl. Math., 2019

Broadcast domination and multipacking: bounds and the integrality gap.
Australas. J Comb., 2019

Du nombre maximum d'ensembles fermés en 3 dimensions.
Proceedings of the Extraction et Gestion des connaissances, 2019

Complexity of Conjunctive Regular Path Query Homomorphisms.
Proceedings of the Computing with Foresight and Industry, 2019

2018
Octal games on graphs: The game 0.33 on subdivided stars and bistars.
Theor. Comput. Sci., 2018

Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension.
SIAM J. Discret. Math., 2018

Encoding partial orders through modular decomposition.
J. Comput. Sci., 2018

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs.
CoRR, 2018

Algorithms for a Bit-Vector Encoding of Trees.
ICO, 2018

2017
Algorithms for k-meet-semidistributive lattices.
Theor. Comput. Sci., 2017

Homomorphism bounds and edge-colourings of K<sub>4</sub>-minor-free graphs.
J. Comb. Theory, Ser. B, 2017

Bounds on Directed star arboricity in some digraph classes.
Electron. Notes Discret. Math., 2017

2016
Partial Duplication of Convex Sets in Lattices.
Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, 2016

2015
Homomorphisms of binary Cayley graphs.
Discret. Math., 2015

A De Bruijn-Erdős Theorem for Chordal Graphs.
Electron. J. Comb., 2015

2013
On a class of intersection graphs.
CoRR, 2013

Making a Graph Crossing-Critical by Multiplying its Edges.
Electron. J. Comb., 2013

Lines in hypergraphs.
Comb., 2013

Hardness and Algorithms for Variants of Line Graphs of Directed Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
The Lattice of all Betweenness Relations: Structure and Properties.
Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, 2012

2010
Drawing Disconnected Graphs on the Klein Bottle.
Graphs Comb., 2010

Covering codes in Sierpinski graphs.
Discret. Math. Theor. Comput. Sci., 2010

On the Sharpness of Some Results Relating Cuts and Crossing Numbers.
Electron. J. Comb., 2010

2009
Autour de problèmes de plongements de graphes. (Around some problems of graphs embeddings).
PhD thesis, 2009

Subdivided graphs as isometric subgraphs of Hamming graphs.
Eur. J. Comb., 2009

On Planarity of Direct Product of multipartite Complete Graphs.
Discret. Math. Algorithms Appl., 2009

2007
Isometric embeddings of subdivided complete graphs in the hypercube.
Electron. Notes Discret. Math., 2007


  Loading...