default search action
Emeric Gioan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Emeric Gioan, Michel Las Vergnas:
Computing the fully optimal spanning tree of an ordered bipolar directed graph. Discret. Math. 347(5): 113895 (2024) - 2022
- [j17]Emeric Gioan:
Complete Graph Drawings up to Triangle Mutations. Discret. Comput. Geom. 67(4): 985-1022 (2022) - [j16]Emeric Gioan:
On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids. Discret. Math. 345(7): 112796 (2022)
2010 – 2019
- 2019
- [j15]Emeric Gioan, Michel Las Vergnas:
The active bijection for graphs. Adv. Appl. Math. 104: 165-236 (2019) - [j14]Emeric Gioan, Chi Ho Yuen:
On the number of circuit-cocircuit reversal classes of an oriented matroid. Discret. Math. 342(4): 1056-1059 (2019) - 2016
- [i5]Emeric Gioan, Kevin Sol, Gérard Subsol:
Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices. CoRR abs/1602.01641 (2016) - 2015
- [j13]Raul Cordovil, Komei Fukuda, Emeric Gioan, Jorge L. Ramírez Alfonsín:
Combinatorial geometries: Matroids, oriented matroids and applications. Special issue in memory of Michel Las Vergnas. Eur. J. Comb. 49: 269-270 (2015) - [j12]Raul Cordovil, Komei Fukuda, Emeric Gioan, Jorge L. Ramírez Alfonsín:
Combinatorial geometries: Matroids, oriented matroids and applications. Special issue in memory of Michel Las Vergnas. Eur. J. Comb. 50: 1-3 (2015) - 2014
- [j11]Emeric Gioan, Christophe Paul
, Marc Tedder, Derek G. Corneil:
Practical and Efficient Circle Graph Recognition. Algorithmica 69(4): 759-788 (2014) - [j10]Emeric Gioan, Christophe Paul
Practical and Efficient Split Decomposition via Graph-Labelled Trees. Algorithmica 69(4): 789-843 (2014) - [j9]Serge Burckel
Computation with No Memory, and Rearrangeable Multicast Networks. Discret. Math. Theor. Comput. Sci. 16(1): 121-142 (2014) - 2013
- [b1]Emeric Gioan:
Structures combinatoires et interactions. Montpellier 2 University, France, 2013 - [i4]Serge Burckel, Emeric Gioan, Emmanuel Thomé:
Computation with No Memory, and Rearrangeable Multicast Networks. CoRR abs/1310.5380 (2013) - 2012
- [j8]Emeric Gioan, Christophe Paul
Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs. Discret. Appl. Math. 160(6): 708-733 (2012) - [c6]Emeric Gioan, Kevin Sol, Gérard Subsol:
A Combinatorial Method for 3D Landmark-Based Morphometry: Application to the Study of Coronal Craniosynostosis. MICCAI (3) 2012: 533-541 - 2011
- [c5]Emeric Gioan, Kevin Sol, Gérard Subsol:
Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices. CCCG 2011 - [i3]Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil:
Practical and Efficient Split Decomposition via Graph-Labelled Trees. CoRR abs/1104.3283 (2011) - [i2]Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil:
Circle Graph Recognition in Time O(n+m) α(n+m). CoRR abs/1104.3284 (2011)
2000 – 2009
- 2009
- [j7]Emeric Gioan, Michel Las Vergnas:
The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded region. Eur. J. Comb. 30(8): 1868-1886 (2009) - [j6]Emeric Gioan, Michel Las Vergnas:
A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements. Electron. Notes Discret. Math. 34: 307-311 (2009) - [c4]Serge Burckel, Emeric Gioan, Emmanuel Thomé
Mapping Computation with No Memory. UC 2009: 85-97 - 2008
- [c3]Serge Burckel, Emeric Gioan:
In Situ Design of Register Operations. ISVLSI 2008: 451-454 - [i1]Emeric Gioan, Christophe Paul:
Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs. CoRR abs/0810.1823 (2008) - 2007
- [j5]Emeric Gioan:
Enumerating degree sequences in digraphs and a cycle-cocycle reversing system. Eur. J. Comb. 28(4): 1351-1366 (2007) - [j4]Emeric Gioan, Michel Las Vergnas:
Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids. Electron. Notes Discret. Math. 29: 365-371 (2007) - [c2]Emeric Gioan, Christophe Paul:
Dynamic Distance Hereditary Graphs Using Split Decomposition. ISAAC 2007: 41-51 - 2006
- [j3]Emeric Gioan, Michel Las Vergnas:
The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes. Electron. J. Comb. 11(2) (2006) - 2005
- [j2]Emeric Gioan, Michel Las Vergnas:
Activity preserving bijections between spanning trees and orientations in graphs. Discret. Math. 298(1-3): 169-188 (2005) - [c1]Emeric Gioan:
Complete Graph Drawings Up to Triangle Mutations. WG 2005: 139-150 - 2004
- [j1]Emeric Gioan, Michel Las Vergnas:
Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids. Adv. Appl. Math. 32(1-2): 212-238 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: