Emeric Gioan

According to our database1, Emeric Gioan authored at least 22 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
On the number of circuit-cocircuit reversal classes of an oriented matroid.
Discret. Math., 2019

The active bijection for graphs.
Adv. Appl. Math., 2019

2015
Combinatorial geometries: Matroids, oriented matroids and applications. Special issue in memory of Michel Las Vergnas.
Eur. J. Comb., 2015

2014
Computation with No Memory, and Rearrangeable Multicast Networks.
Discret. Math. Theor. Comput. Sci., 2014

Practical and Efficient Split Decomposition via Graph-Labelled Trees.
Algorithmica, 2014

Practical and Efficient Circle Graph Recognition.
Algorithmica, 2014

2013
Structures combinatoires et interactions.
, 2013

2012
Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs.
Discret. Appl. Math., 2012

A Combinatorial Method for 3D Landmark-Based Morphometry: Application to the Study of Coronal Craniosynostosis.
Proceedings of the Medical Image Computing and Computer-Assisted Intervention - MICCAI 2012, 2012

2011
Circle Graph Recognition in Time O(n+m) α(n+m)
CoRR, 2011

Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2009
A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements.
Electron. Notes Discret. Math., 2009

The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded region.
Eur. J. Comb., 2009

Mapping Computation with No Memory.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

2008
In Situ Design of Register Operations.
Proceedings of the IEEE Computer Society Annual Symposium on VLSI, 2008

2007
Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids.
Electron. Notes Discret. Math., 2007

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

Dynamic Distance Hereditary Graphs Using Split Decomposition.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes.
Electron. J. Comb., 2006

2005
Activity preserving bijections between spanning trees and orientations in graphs.
Discret. Math., 2005

Complete Graph Drawings Up to Triangle Mutations.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004
Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids.
Adv. Appl. Math., 2004


  Loading...