3 citations · 3 across the 2 of their papers we have counts for
5 papers
Resolutions of Convex Geometries
Domenico Cantone, Jean-Paul Doignon, Alfio Giarlotta +1
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for con…
Finding a Maximum-Weight Convex Set in a Chordal Graph
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal grap…
Extended Formulations for Order Polytopes through Network Flows
Clintin P. Davis-Stober, Jean-Paul Doignon, Samuel Fiorini +2
Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free random utility models and associated random preference models. For such models,…
Weighted graphs defining facets: a connection between stable set and linear ordering polytopes
Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret
A graph is alpha-critical if its stability number increases whenever an edge is removed from its edge set. The class of alpha-critical graphs has several nice structural properties…
Note: Axiomatic Derivation of the Doppler Factor and Related Relativistic Laws
Jean-Claude Falmagne, Jean-Paul Doignon
The formula for the relativistic Doppler effect is investigated in the context of two compelling invariance axioms. The axioms are expressed in terms of an abstract operation gener…