default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Baudon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Olivier Baudon, Julien Bensmail, Morgan Boivin:
Interplays between variations of arbitrarily partitionable graphs under minimality constraints. Appl. Math. Comput. 475: 128753 (2024)- 2020
- [j19]Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak
, Jakub Przybylo, Mariusz Wozniak:
On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory 40(4): 1175-1186 (2020)
2010 – 2019
- 2019
- [j18]Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena:
Edge weights and vertex colours: Minimizing sum count. Discret. Appl. Math. 270: 13-24 (2019) - [j17]Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - 2018
- [j16]Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena:
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. Discret. Appl. Math. 251: 83-92 (2018) - [j15]Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
On locally irregular decompositions and the 1-2 Conjecture in digraphs. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - 2017
- [j14]Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. 222: 40-53 (2017) - [j13]Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak:
The neighbour-sum-distinguishing edge-colouring game. Discret. Math. 340(7): 1564-1572 (2017) - [j12]Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak:
Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory 37(1): 89-115 (2017) - [i1]Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
Equitable neighbour-sum-distinguishing edge and total colourings. CoRR abs/1701.04648 (2017) - 2015
- [j11]Olivier Baudon, Julien Bensmail, Éric Sopena:
An oriented version of the 1-2-3 Conjecture. Discuss. Math. Graph Theory 35(1): 141-156 (2015) - [j10]Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. 49: 90-104 (2015) - [j9]Olivier Baudon, Julien Bensmail, Éric Sopena:
On the complexity of determining the irregular chromatic index of a graph. J. Discrete Algorithms 30: 113-127 (2015) - 2014
- [j8]Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak:
On the structure of arbitrarily partitionable graphs with given connectivity. Discret. Appl. Math. 162: 381-385 (2014) - [j7]Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak:
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. Discret. Math. Theor. Comput. Sci. 16(1): 225-232 (2014) - [j6]Olivier Baudon, Julien Bensmail, Éric Sopena:
Partitioning Harary graphs into connected subgraphs containing prescribed vertices. Discret. Math. Theor. Comput. Sci. 16(3): 263-278 (2014) - [j5]Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
Partitioning powers of traceable or hamiltonian graphs. Theor. Comput. Sci. 520: 133-137 (2014) - 2012
- [j4]Olivier Baudon, Jakub Przybylo, Mariusz Wozniak:
On minimal arbitrarily partitionable graphs. Inf. Process. Lett. 112(17-18): 697-700 (2012)
2000 – 2009
- 2005
- [j3]Olivier Baudon:
2-1 routing requests in the hypercube. Electron. Notes Discret. Math. 22: 535-538 (2005) - 2002
- [j2]Dominique Barth, Olivier Baudon, Joël Puech:
Decomposable trees: a polynomial algorithm fortripodes. Discret. Appl. Math. 119(3): 205-216 (2002) - 2001
- [j1]Olivier Baudon, Guillaume Fertin, Ivan Havel:
Routing permutations and 2-1 routing requests in the hypercube. Discret. Appl. Math. 113(1): 43-58 (2001)
1990 – 1999
- 1999
- [c1]Olivier Baudon, Guillaume Fertin, Ivan Havel:
Routing Permutations in the Hypercube. WG 1999: 179-190 - 1990
- [b1]Olivier Baudon:
Cabri-graphes : un cahier de brouillon interactif pour la théorie des graphes. (Cabri-graphes, an interactive sketchpad for graph theory). Joseph Fourier University, Grenoble, France, 1990
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 2024-05-23 22:13 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:
