Olivier Baudon

dblp:08/1950 · DBLP profile ↗

← Back

10ranked-venue papers

9as first author

1since 2021 · last 2026

0000-0002-7330-6479ORCID · corroborated

Theory of computation · 10 · 9 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

Year	Publication	Venue	Position
2026	The strong ( 2 , 2 ) -Conjecture for more classes of graphs Olivier Baudon, Julien Bensmail, Morgan Boivin, Igor Grzelec, Clara Marcille	Discret. Appl. Math.	1
2019	Edge weights and vertex colours: Minimizing sum count Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena	Discret. Appl. Math.	1
2018	Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena	Discret. Appl. Math.	1
2017	Equitable neighbour-sum-distinguishing edge and total colourings Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak	Discret. Appl. Math.	1
2014	On the structure of arbitrarily partitionable graphs with given connectivity Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak	Discret. Appl. Math.	1
2014	Partitioning powers of traceable or hamiltonian graphs Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak	Theor. Comput. Sci.	1
2012	On minimal arbitrarily partitionable graphs Olivier Baudon, Jakub Przybylo, Mariusz Wozniak	Inf. Process. Lett.	1
2002	Decomposable trees: a polynomial algorithm fortripodes Dominique Barth, Olivier Baudon, Joël Puech	Discret. Appl. Math.	2
2001	Routing permutations and 2-1 routing requests in the hypercube Olivier Baudon, Guillaume Fertin, Ivan Havel	Discret. Appl. Math.	1
1999	Routing Permutations in the Hypercube Olivier Baudon, Guillaume Fertin, Ivan Havel	WG	1