Olivier Baudon

ORCID

Publication Activity (10 Years)

Years Active: 1999-2020
Publications (10 Years): 12

Top Venues

Discret. Appl. Math.

Discret. Math. Theor. Comput. Sci.

Discuss. Math. Graph Theory

CoRR

Grenoble Alpes University, France (PHD)

Education History

Grenoble Alpes University, France

PHD

Publications

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) (2020)
Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena
Edge weights and vertex colours: Minimizing sum count. Discret. Appl. Math. 270 (2019)
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)
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)
Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. Discret. Appl. Math. 251 (2018)
Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. 222 (2017)
Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak
The neighbour-sum-distinguishing edge-colouring game. Discret. Math. 340 (7) (2017)
Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak
Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory 37 (1) (2017)
Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
Equitable neighbour-sum-distinguishing edge and total colourings. CoRR (2017)
Olivier Baudon, Julien Bensmail, Éric Sopena
An oriented version of the 1-2-3 Conjecture. Discuss. Math. Graph Theory 35 (1) (2015)
Olivier Baudon, Julien Bensmail, Éric Sopena
On the complexity of determining the irregular chromatic index of a graph. J. Discrete Algorithms 30 (2015)
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. 49 (2015)
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) (2014)
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
Partitioning powers of traceable or hamiltonian graphs. Theor. Comput. Sci. 520 (2014)
Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak
On the structure of arbitrarily partitionable graphs with given connectivity. Discret. Appl. Math. 162 (2014)
Olivier Baudon, Julien Bensmail, Éric Sopena
Partitioning Harary graphs into connected subgraphs containing prescribed vertices. Discret. Math. Theor. Comput. Sci. 16 (3) (2014)
Olivier Baudon, Jakub Przybylo, Mariusz Wozniak
On minimal arbitrarily partitionable graphs. Inf. Process. Lett. 112 (17-18) (2012)
Olivier Baudon
2-1 routing requests in the hypercube. Electron. Notes Discret. Math. 22 (2005)
Dominique Barth, Olivier Baudon, Joël Puech
Decomposable trees: a polynomial algorithm fortripodes. Discret. Appl. Math. 119 (3) (2002)
Olivier Baudon, Guillaume Fertin, Ivan Havel
Routing permutations and 2-1 routing requests in the hypercube. Discret. Appl. Math. 113 (1) (2001)
Olivier Baudon, Guillaume Fertin, Ivan Havel
Routing Permutations in the Hypercube. WG (1999)

Olivier Baudon.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Olivier Baudon