Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Emeric Gioan"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 16 no. 1 (2014)
We investigate the computation of mappings from a set S^n to itself with "in situ programs", that is using no extra variables than the input, and performing modifications of one component at a time, hence using no extra memory. In this paper, we surv
Externí odkaz:
https://doaj.org/article/e4829ddb9f474b14a5681dbfde508056
Autor:
Emeric Gioan
Publikováno v:
Handbook of the Tutte Polynomial and Related Topics ISBN: 9780429161612
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7018d96ece98cb18a7ea08560c396d4f
https://doi.org/10.1201/9780429161612-28
https://doi.org/10.1201/9780429161612-28
Autor:
Emeric Gioan
Publikováno v:
Handbook of the Tutte Polynomial and Related Topics ISBN: 9780429161612
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9439e3b8db6d4c5236b1a4f6d18f1fcf
https://doi.org/10.1201/9780429161612-31
https://doi.org/10.1201/9780429161612-31
Autor:
Chi Ho Yuen, Emeric Gioan
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2019, 342 (4), pp.1056-1059. ⟨10.1016/j.disc.2018.12.006⟩
Discrete Mathematics, Elsevier, 2019, 342 (4), pp.1056-1059. ⟨10.1016/j.disc.2018.12.006⟩
The first author introduced the circuit-cocircuit reversal system of an oriented matroid, and showed that when the underlying matroid is regular, the cardinalities of such system and its variations are equal to special evaluations of the Tutte polyno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88e4748afcdc85a0b3f4a425aa11bcf5
https://doi.org/10.1016/j.disc.2018.12.006
https://doi.org/10.1016/j.disc.2018.12.006
Autor:
Spyros Xanthakis, Emeric Gioan
Publikováno v:
Artificial Intelligence Methods for Software Engineering
M. Kalech; R. Abreu; M. Last. Artificial Intelligence Methods for Software Engineering, Chapter 12, World Scientific, pp.331-367, 2021, ⟨10.1142/9789811239922⟩
M. Kalech; R. Abreu; M. Last. Artificial Intelligence Methods for Software Engineering, Chapter 12, World Scientific, pp.331-367, 2021, ⟨10.1142/9789811239922⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec175e4521503785fff47cb8dc8001b2
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03371990/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03371990/document
Autor:
Emeric Gioan, Michel Las Vergnas
Publikováno v:
Advances in Applied Mathematics
Advances in Applied Mathematics, Elsevier, 2019, 104, pp.165-236. ⟨10.1016/j.aam.2018.11.001⟩
Advances in Applied Mathematics, Elsevier, 2019, 104, pp.165-236. ⟨10.1016/j.aam.2018.11.001⟩
The active bijection forms a package of results studied by the authors in a series of papers in oriented matroids. The present paper is intended to state the main results in the particular case, and more widespread language, of graphs. We associate a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4ca6056f47fc90fba8f9a0c5f8fc8bc
http://arxiv.org/abs/1807.06545
http://arxiv.org/abs/1807.06545
Publikováno v:
European Journal of Combinatorics. 50:1-3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66663be2373ffa39d7e44f0dad036bba
https://doi.org/10.1016/j.ejc.2015.05.012
https://doi.org/10.1016/j.ejc.2015.05.012
Autor:
Emeric Gioan, Christophe Paul
Publikováno v:
Discrete Applied Mathematics. 160(6):708-733
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses, namely the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fad135ec3269447fc341c31b62ee6886
Autor:
Emeric Gioan, Michel Las Vergnas
Publikováno v:
EuroComb: European Conference on Combinatorics, Graph Theory and Applications
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.307-311
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.307-311
International audience; The fully optimal basis of a bounded acyclic oriented matroid on a linearly ordered set has been defined and studied by the present authors in a series of papers, dealing with graphs, hyperplane arrangements, and oriented matr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1db6510e32d5a5ef14a4bc906122983
https://doi.org/10.1016/j.endm.2009.07.050
https://doi.org/10.1016/j.endm.2009.07.050
Autor:
Emeric Gioan
Publikováno v:
Annals of Combinatorics
Annals of Combinatorics, Springer Verlag, 2008, 12 (2), pp.171-182. ⟨10.1007/s00026-008-0345-2⟩
Annals of Combinatorics, Springer Verlag, 2008, 12 (2), pp.171-182. ⟨10.1007/s00026-008-0345-2⟩
International audience; We consider that two orientations of a regular matroid are equivalent if one can be obtained from the other by successive reorientations of positive circuits and/or positive cocircuits. We study the inductive deletion-contract
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21c99e6420b7961254d33830be53f813
https://doi.org/10.1007/s00026-008-0345-2
https://doi.org/10.1007/s00026-008-0345-2