Directed paths on a tree: coloring, multicut and kernel - Olivier Durand de Gevigney; Frédéric Meunier; Christian Popa; Julien Reygner; Ayrin Romero (CoRR, 2009)

Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree. - Olivier Durand de Gevigney; Frédéric Meunier; Christian Popa; Julien Reygner; Ayrin Romero (4OR, 2011)

On Frank's conjecture on k-connected orientations - Olivier Durand de Gevigney (CoRR, 2012)

Sandwich problems on orientations. - Olivier Durand de Gevigney; Sulamita Klein; Viet Hang Nguyen; Zoltán Szigeti (J. Braz. Comput. Soc., 2012)

Matroid-Based Packing of Arborescences. - Olivier Durand de Gevigney; Viet Hang Nguyen; Zoltán Szigeti (SIAM J. Discret. Math., 2013)

Graphs Orientations : structures and algorithms. (Orientations des graphes : structures et algorithmes). - Olivier Durand de Gevigney (2013)

Decomposition into two trees with orientation constraints. - Olivier Durand de Gevigney (Discret. Optim., 2014)

Packing of rigid spanning subgraphs and spanning trees. - Joseph Cheriyan; Olivier Durand de Gevigney; Zoltán Szigeti (J. Comb. Theory B, 2014)

On minimally 2-T-connected directed graphs. - Olivier Durand de Gevigney; Zoltán Szigeti (Discret. Appl. Math., 2018)

On (2, k)?connected graphs. - Olivier Durand de Gevigney; Zoltán Szigeti (J. Graph Theory, 2019)

On Frank's conjecture on k-connected orientations. - Olivier Durand de Gevigney (J. Comb. Theory B, 2020)