2 citations · 3 across the 7 of their papers we have counts for
8 papers
The Local Dyadic Conjecture
Mahtab Alghasi, Bertrand Guenin, Levent Tunçel
A rational with denominator a power of two is said to be dyadic. A long standing conjecture of Paul Seymour predicts that for an ideal clutter, the dual of the set covering problem…
Generalizations of Total Dual Integrality
Bertrand Guenin, Levent Tunçel
We design new tools to study variants of Total Dual Integrality. As an application, we obtain a geometric characterization of Total Dual Integrality for the case where the associat…
Dyadic linear programming and extensions
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin +1
A rational number is dyadic if it has a finite binary representation , where is an integer and is a nonnegative integer. Dyadic rationals are important for numerical…
Testing idealness in the filter oracle model
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin +1
A filter oracle for a clutter consists of a finite set along with an oracle which, given any set , decides in unit time whether or not contains a member of th…
Total dual dyadicness and dyadic generating sets
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin +1
A vector is \emph{dyadic} if each of its entries is a dyadic rational number, i.e. of the form for some integers with . A linear system wi…
Packing odd -joins with at most two terminals
Ahmad Abdi, Bertrand Guenin
Take a graph , an edge subset , and a set of terminals where is even. The triple is called a signed graft. A -join is odd i…
Isomorphism for even cycle matroids - I
Bertrand Guenin, Irene Pivotto, Paul Wollan
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogous problem for even cycle matroids. A representation of an even cycle matroid is…
Packing directed circuits exactly
Bertrand Guenin, Robin Thomas
We give an "excluded minor" and a "structural" characterization of digraphs D that have the property that for every subdigraph H of D, the maximum number of disjoint circuits in H…