Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Beaudou
Person information
- affiliation: University of Bordeaux 1, LABRI, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i9]Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard:
Complexity of conjunctive regular path query homomorphisms. CoRR abs/2305.07271 (2023)- 2022
- [j24]Laurent Beaudou, Florent Foucaud, Reza Naserasr
:
Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. Discret. Appl. Math. 319: 564-575 (2022) - [j23]Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora:
Graphs with no induced house nor induced hole have the de Bruijn-Erdös property. J. Graph Theory 100(4): 638-652 (2022) - 2021
- [i8]Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. CoRR abs/2110.14003 (2021) - 2020
- [c7]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Smallest C2l+1-Critical Graphs of Odd-Girth 2k+1. CALDAM 2020: 184-196 - [i7]Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora:
Graphs with no induced house nor induced hole have the de Bruijn-Erdős property. CoRR abs/2005.09447 (2020)
2010 – 2019
- 2019
- [j22]Laurent Beaudou, Richard C. Brewster, Florent Foucaud:
Broadcast domination and multipacking: bounds and the integrality gap. Australas. J Comb. 74: 86-97 (2019) - [j21]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. Discret. Appl. Math. 261: 40-51 (2019) - [j20]Laurent Beaudou, Luc Devroye, Gena Hahn:
A lower bound on the size of an absorbing set in an arc-coloured tournament. Discret. Math. 342(1): 143-144 (2019) - [j19]Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld:
Bisplit graphs satisfy the Chen-Chvátal conjecture. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j18]Laurent Beaudou, Richard C. Brewster:
On the multipacking number of grid graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [c6]Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard:
Complexity of Conjunctive Regular Path Query Homomorphisms. CiE 2019: 108-119 - [c5]Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah:
Du nombre maximum d'ensembles fermés en 3 dimensions. EGC 2019: 345-350 - 2018
- [j17]Laurent Beaudou, Kaoutar Ghazi, Giacomo Kahn, Olivier Raynaud, Eric Thierry:
Encoding partial orders through modular decomposition. J. Comput. Sci. 25: 446-455 (2018) - [j16]Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary, Aline Parreau:
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. SIAM J. Discret. Math. 32(2): 902-918 (2018) - [j15]Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena:
Octal games on graphs: The game 0.33 on subdivided stars and bistars. Theor. Comput. Sci. 746: 19-35 (2018) - [c4]Kaoutar Ghazi, Laurent Beaudou, Olivier Raynaud:
Algorithms for a Bit-Vector Encoding of Trees. ICO 2018: 418-427 - [i6]Laurent Beaudou, Rick C. Brewster:
On the multipacking number of grid graphs. CoRR abs/1803.09639 (2018) - [i5]Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah:
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. CoRR abs/1807.09030 (2018) - [i4]Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld:
Bisplit graphs satisfy the Chen-Chvátal conjecture. CoRR abs/1808.08710 (2018) - 2017
- [j14]Henri Perret du Cray, Mourad Baïou, Laurent Beaudou, Vincent Limouzy:
Bounds on Directed star arboricity in some digraph classes. Electron. Notes Discret. Math. 62: 267-272 (2017) - [j13]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds and edge-colourings of K4-minor-free graphs. J. Comb. Theory, Ser. B 124: 128-164 (2017) - [j12]Laurent Beaudou, Arnaud Mary, Lhouari Nourine:
Algorithms for k-meet-semidistributive lattices. Theor. Comput. Sci. 658: 391-398 (2017) - 2016
- [c3]Laurent Beaudou, Lhouari Nourine:
Partial Duplication of Convex Sets in Lattices. CLA 2016: 33-43 - [i3]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds and edge-colourings of K4-minor-free graphs. CoRR abs/1610.03999 (2016) - [i2]Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena:
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. CoRR abs/1612.05772 (2016) - 2015
- [j11]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
A De Bruijn-Erdős Theorem for Chordal Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j10]Laurent Beaudou, Reza Naserasr, Claude Tardif:
Homomorphisms of binary Cayley graphs. Discret. Math. 338(12): 2539-2544 (2015) - 2013
- [j9]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
Lines in hypergraphs. Comb. 33(6): 633-654 (2013) - [j8]Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar:
Making a Graph Crossing-Critical by Multiplying its Edges. Electron. J. Comb. 20(1): 61 (2013) - [c2]Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy:
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. ISAAC 2013: 196-206 - [i1]Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy:
On a class of intersection graphs. CoRR abs/1306.2498 (2013) - 2012
- [c1]Laurent Beaudou, Mamadou Moustapha Kanté, Lhouari Nourine:
The Lattice of all Betweenness Relations: Structure and Properties. CLA 2012: 317-326 - 2010
- [j7]Laurent Beaudou, Drago Bokal:
On the Sharpness of Some Results Relating Cuts and Crossing Numbers. Electron. J. Comb. 17(1) (2010) - [j6]Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard:
Covering codes in Sierpinski graphs. Discret. Math. Theor. Comput. Sci. 12(3): 63-74 (2010) - [j5]Laurent Beaudou, Antoine Gerbaud, Roland Grappe, Frédéric Palesi:
Drawing Disconnected Graphs on the Klein Bottle. Graphs Comb. 26(4): 471-481 (2010)
2000 – 2009
- 2009
- [b1]Laurent Beaudou:
Autour de problèmes de plongements de graphes. (Around some problems of graphs embeddings). Joseph Fourier University, Grenoble, France, 2009 - [j4]Laurent Beaudou, Paul Dorbec, Sylvain Gravier, Pranava K. Jha:
On Planarity of Direct Product of multipartite Complete Graphs. Discret. Math. Algorithms Appl. 1(1): 85-104 (2009) - [j3]Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Subdivided graphs as isometric subgraphs of Hamming graphs. Eur. J. Comb. 30(5): 1062-1070 (2009) - 2008
- [j2]Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Isometric Embeddings of Subdivided Complete Graphs in the Hypercube. SIAM J. Discret. Math. 22(3): 1226-1238 (2008) - 2007
- [j1]Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Isometric embeddings of subdivided complete graphs in the hypercube. Electron. Notes Discret. Math. 29: 277-281 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-01 22:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
