Bertrand Guenin

Cheolwon Heo

Math. Program., March, 2024

Small separations in pinch-graphic matroids.

[BibT_eX]

[DOI]

Cheolwon Heo

Math. Program., March, 2024

2023

Recognizing even-cycle and even-cut matroids.

[BibT_eX]

[DOI]

Cheolwon Heo

Math. Program., November, 2023

2022

Clean Clutters and Dyadic Fractional Packings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Testing idealness in the filter oracle model.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

Total Dual Dyadicness and Dyadic Generating Sets.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2020

A Short Proof of Shih's Isomorphism Theorem on Graphic Subspaces.

[BibT_eX]

[DOI]

Zouhaier Ferchiou

Comb., 2020

2019

The Two-Point Fano and Ideal Binary Clutters.

[BibT_eX]

[DOI]

Comb., 2019

The Minimally Non-Ideal Binary Clutters with a Triangle.

[BibT_eX]

[DOI]

Comb., 2019

2018

Packing odd <i>T</i>-joins with at most two terminals.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

2016

Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids.

[BibT_eX]

[DOI]

Leanne Stuive

SIAM J. Discret. Math., 2016

Lehman's Theorem and the Directed Steiner Tree Problem.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

Jochen Könemann

Laura Sanità

SIAM J. Discret. Math., 2016

Stabilizer theorems for even cycle matroids.

[BibT_eX]

[DOI]

Irene Pivotto

Paul Wollan

J. Comb. Theory, Ser. B, 2016

Displaying blocking pairs in signed graphs.

[BibT_eX]

[DOI]

Irene Pivotto

Paul Wollan

Eur. J. Comb., 2016

A survey on flows in graphs and matroids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs.

[BibT_eX]

[DOI]

Math. Program., 2015

2014

The Cycling Property for the Clutter of Odd st-Walks.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

Relationships between Pairs of Representations of Signed Binary Matroids.

[BibT_eX]

[DOI]

Irene Pivotto

Paul Wollan

SIAM J. Discret. Math., 2013

Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids.

[BibT_eX]

[DOI]

Leanne Stuive

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2011

Packing directed circuits exactly.

[BibT_eX]

[DOI]

Robin Thomas

Comb., 2011

2009

Lehman matrices.

[BibT_eX]

[DOI]

Levent Tunçel

J. Comb. Theory, Ser. B, 2009

2005

Advances in packing directed joins.

[BibT_eX]

[DOI]

Aaron Michael Williams

Electron. Notes Discret. Math., 2005

2004

A family of switch equivalent graphs.

[BibT_eX]

[DOI]

Dhruv Mubayi

Prasad Tetali

Discret. Math., 2004

2002

Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids.

[BibT_eX]

[DOI]

Math. Oper. Res., 2002

A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2002

Packing Odd Circuits in Eulerian Graphs.

[BibT_eX]

[DOI]

James F. Geelen

J. Comb. Theory, Ser. B, 2002

On dijoins.

[BibT_eX]

[DOI]

Discret. Math., 2002

Ideal clutters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

Circuit Mengerian Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000

The packing property.

[BibT_eX]

[DOI]

François Margot

Math. Program., 2000

A Characterization of Weakly Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

1998

Perfect and Ideal 0, ±1 Matrices.

[BibT_eX]

[DOI]

Math. Oper. Res., 1998

1997

Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units.

[BibT_eX]

[DOI]

Edoardo Amaldi