Michel Las Vergnas

Centre National de la Recherche Scientifique — France

Computer Science · Physical Sciences

20h-index2.4kcitations87works2.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(35), Advanced Combinatorial Mathematics(26), graph theory and CDMA systems(22), Graph theory and applications(12), Advanced Algebra and Logic(10)

Publications87 total

Computing the fully optimal spanning tree of an ordered bipolar directed graph
Discrete Mathematics·2024· 2 citedOpen Access
The active bijection for graphs
Advances in Applied Mathematics·2019· 7 citedOpen Access
Computing the fully optimal spanning tree of an ordered bipolar directed graph
arXiv (Cornell University)·2018Open Access
The Active Bijection 2.a - Decomposition of activities for matroid bases, and Tutte polynomial of a matroid in terms of beta invariants of minors
arXiv (Cornell University)·2018· 4 citedOpen Access
The Active Bijection 2.b - Decomposition of activities for oriented matroids, and general definitions of the active bijection
arXiv (Cornell University)·2018· 7 citedOpen Access
The active bijection for graphs
arXiv (Cornell University)·2018· 3 citedOpen Access
The Tutte polynomial of a morphism of matroids — 5. Derivatives as generating functions of Tutte activities
European Journal of Combinatorics·2013· 21 cited
The Tutte Polynomial of a Morphism of Matroids 6. A Multi-Faceted Counting Formula for Hyperplane Regions and Acyclic Orientations
arXiv (Cornell University)·2012· 6 citedOpen Access
The Tutte Polynomial of a Morphism of Matroids 5. Derivatives as Generating Functions of Tutte Activities
arXiv (Cornell University)·2012Open Access
A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements
Electronic Notes in Discrete Mathematics·2009· 4 cited
The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded region
European Journal of Combinatorics·2009· 10 cited
A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs
Electronic Notes in Discrete Mathematics·2008
The Tutte polynomial of a morphism of matroids 4. Computational complexity
Portugaliae Mathematica·2007· 9 citedOpen Access
Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids
Electronic Notes in Discrete Mathematics·2007· 9 cited
On the evaluation at (j, j 2) of the Tutte polynomial of a ternary matroid
Journal of Algebraic Combinatorics·2006· 8 citedOpen Access
The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes
The Electronic Journal of Combinatorics·2006· 11 citedOpen Access
Activity preserving bijections between spanning trees and orientations in graphs
Discrete Mathematics·2005· 33 cited
The Tutte polynomial of a morphism of matroids
Advances in Applied Mathematics·2003· 17 cited
Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids
Advances in Applied Mathematics·2003· 9 cited
10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope
European Journal of Combinatorics·2001· 11 cited
page 1 of 5Next →

Frequent Co-authors

Emeric Gioan(8), Bernd Sturmfels(4), Anders Björner(4), Günter M. Ziegler(3), Yahya Ould Hamidoune(3), H. Meyniel(3), Robert G. Bland(2), Pierre Duchet(2), Neil White(2), Gwihen Etienne(2), Claude Berge(2), J.C. Fournier(2), David Forge(2), Neil White(1), B. D. Acharya(1), Raul Cordovil(1), Arnaldo Mandel(1), Peter Schuchert(1), Jean‐Claude Bermond(1), François Bry(1)