Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids. - Emeric Gioan; Michel Las Vergnas (Adv. Appl. Math., 2004)

Activity preserving bijections between spanning trees and orientations in graphs. - Emeric Gioan; Michel Las Vergnas (Discret. Math., 2005)

The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes. - Emeric Gioan; Michel Las Vergnas (Electron. J. Comb., 2006)

Dynamic Distance Hereditary Graphs Using Split Decomposition. - Emeric Gioan; Christophe Paul (ISAAC, 2007)

Enumerating degree sequences in digraphs and a cycle-cocycle reversing system. - Emeric Gioan (Eur. J. Comb., 2007)

Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids. - Emeric Gioan; Michel Las Vergnas (Electron. Notes Discret. Math., 2007)

In Situ Design of Register Operations. - Serge Burckel; Emeric Gioan (ISVLSI, 2008)

Mapping Computation with No Memory. - Serge Burckel; Emeric Gioan; Emmanuel Thomé (UC, 2009)

The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded region. - Emeric Gioan; Michel Las Vergnas (Eur. J. Comb., 2009)

A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements. - Emeric Gioan; Michel Las Vergnas (Electron. Notes Discret. Math., 2009)

Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices. - Emeric Gioan; Kevin Sol; Gérard Subsol (CCCG, 2011)

Circle Graph Recognition in Time O(n+m) α(n+m) - Emeric Gioan; Christophe Paul; Marc Tedder; Derek G. Corneil (CoRR, 2011)

A Combinatorial Method for 3D Landmark-Based Morphometry: Application to the Study of Coronal Craniosynostosis. - Emeric Gioan; Kevin Sol; Gérard Subsol (MICCAI (3), 2012)

Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs. - Emeric Gioan; Christophe Paul (Discret. Appl. Math., 2012)

Structures combinatoires et interactions. - Emeric Gioan (2013)

Practical and Efficient Circle Graph Recognition. - Emeric Gioan; Christophe Paul; Marc Tedder; Derek G. Corneil (Algorithmica, 2014)

Practical and Efficient Split Decomposition via Graph-Labelled Trees. - Emeric Gioan; Christophe Paul; Marc Tedder; Derek G. Corneil (Algorithmica, 2014)

Computation with No Memory, and Rearrangeable Multicast Networks. - Serge Burckel; Emeric Gioan; Emmanuel Thomé (Discret. Math. Theor. Comput. Sci., 2014)

Combinatorial geometries: Matroids, oriented matroids and applications. Special issue in memory of Michel Las Vergnas. - Raul Cordovil; Komei Fukuda; Emeric Gioan; Jorge L. Ramírez Alfonsín (Eur. J. Comb., 2015)

The active bijection for graphs. - Emeric Gioan; Michel Las Vergnas (Adv. Appl. Math., 2019)

On the number of circuit-cocircuit reversal classes of an oriented matroid. - Emeric Gioan; Chi Ho Yuen (Discret. Math., 2019)

Complete Graph Drawings up to Triangle Mutations. - Emeric Gioan (Discret. Comput. Geom., 2022)

On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids. - Emeric Gioan (Discret. Math., 2022)

Computing the fully optimal spanning tree of an ordered bipolar directed graph. - Emeric Gioan; Michel Las Vergnas (Discret. Math., 2024)