Emeric Gioan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2022

Complete Graph Drawings up to Triangle MutationsEmeric Gioan. dcg, 67(4):985-1022, 2022. [doi]

On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroidsEmeric Gioan. DM, 345(7):112796, 2022. [doi]

2019

The active bijection for graphsEmeric Gioan, Michel Las Vergnas. aam, 104:165-236, 2019. [doi]

On the number of circuit-cocircuit reversal classes of an oriented matroidEmeric Gioan, Chi Ho Yuen. DM, 342(4):1056-1059, 2019. [doi]

2015

Combinatorial geometries: Matroids, oriented matroids and applications. Special issue in memory of Michel Las VergnasRaul Cordovil, Komei Fukuda, Emeric Gioan, Jorge L. Ramírez Alfonsín. ejc, 49:269-270, 2015. [doi]

Combinatorial geometries: Matroids, oriented matroids and applications. Special issue in memory of Michel Las VergnasRaul Cordovil, Komei Fukuda, Emeric Gioan, Jorge L. Ramírez Alfonsín. ejc, 50:1-3, 2015. [doi]

2014

Computation with No Memory, and Rearrangeable Multicast NetworksSerge Burckel, Emeric Gioan, Emmanuel Thomé. dmtcs, 16(1):121-142, 2014. [doi]

Practical and Efficient Split Decomposition via Graph-Labelled TreesEmeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil. algorithmica, 69(4):789-843, 2014. [doi]

Practical and Efficient Circle Graph RecognitionEmeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil. algorithmica, 69(4):759-788, 2014. [doi]

2013

Structures combinatoires et interactionsEmeric Gioan. 2013. [doi]

2012

A Combinatorial Method for 3D Landmark-Based Morphometry: Application to the Study of Coronal CraniosynostosisEmeric Gioan, Kevin Sol, Gérard Subsol. miccai 2012: 533-541 [doi]

Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphsEmeric Gioan, Christophe Paul. DAM, 160(6):708-733, 2012. [doi]

2011

Orientations of Simplices Determined by Orderings on the Coordinates of their VerticesEmeric Gioan, Kevin Sol, Gérard Subsol. cccg 2011: [doi]

2009

Mapping Computation with No MemorySerge Burckel, Emeric Gioan, Emmanuel ThomÃ©. uc 2009: 85-97 [doi]

A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane ArrangementsEmeric Gioan, Michel Las Vergnas. endm, 34:307-311, 2009. [doi]

The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded regionEmeric Gioan, Michel Las Vergnas. ejc, 30(8):1868-1886, 2009. [doi]

2008

In Situ Design of Register OperationsSerge Burckel, Emeric Gioan. isvlsi 2008: 451-454 [doi]

2007

Enumerating degree sequences in digraphs and a cycle-cocycle reversing systemEmeric Gioan. ejc, 28(4):1351-1366, 2007. [doi]

Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented MatroidsEmeric Gioan, Michel Las Vergnas. endm, 29:365-371, 2007. [doi]

Dynamic Distance Hereditary Graphs Using Split DecompositionEmeric Gioan, Christophe Paul. isaac 2007: 41-51 [doi]

2006

The Active Bijection between Regions and Simplices in Supersolvable Arrangements of HyperplanesEmeric Gioan, Michel Las Vergnas. combinatorics, 11(2), 2006. [doi]

2005

Activity preserving bijections between spanning trees and orientations in graphsEmeric Gioan, Michel Las Vergnas. DM, 298(1-3):169-188, 2005. [doi]

Complete Graph Drawings Up to Triangle MutationsEmeric Gioan. criwg 2005: 139-150 [doi]

2004

Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroidsEmeric Gioan, Michel Las Vergnas. aam, 32(1-2):212-238, 2004. [doi]

Sign in or sign up to see more results.

runs on WebDSL