124 results on '"GUENIN, BERTRAND"'
Search Results
2. Dyadic linear programming and extensions
3. Recognizing pinch-graphic matroids
4. Small separations in pinch-graphic matroids
5. Recognizing even-cycle and even-cut matroids
6. Testing idealness in the filter oracle model
7. Total dual dyadicness and dyadic generating sets
8. Total Dual Dyadicness and Dyadic Generating Sets
9. Total Dual Dyadicness and Dyadic Generating Sets
10. Recognizing Even-Cycle and Even-Cut Matroids
11. Packing odd $T$-joins with at most two terminals
12. A Short Proof of Shih’s Isomorphism Theorem on Graphic Subspaces
13. Isomorphism for even cycle matroids - I
14. Packing directed circuits exactly
15. Recognizing Even-Cycle and Even-Cut Matroids
16. The Two-Point Fano and Ideal Binary Clutters
17. The Minimally Non-Ideal Binary Clutters with a Triangle
18. The Two-Point Fano and Ideal Binary Clutters
19. Total dual dyadicness and dyadic generating sets
20. Recognizing pinch-graphic matroids
21. Small separations in pinch-graphic matroids
22. Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids
23. Perfect and Ideal 0, ±1 Matrices
24. A survey on flows in graphs and matroids
25. Stabilizer theorems for even cycle matroids
26. The Cycling Property for the Clutter of Odd st-Walks
27. Testing idealness in the filter oracle model
28. Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
29. The Two-Point Fano and Ideal Binary Clutters
30. Clean Clutters and Dyadic Fractional Packings
31. A Short Proof of Seymour’s Characterization of the Matroids with the Max-Flow Min-Cut Property
32. Integral Polyhedra Related to Even Cycle and Even Cut Matroids
33. Circuit Mengerian Directed Graphs
34. On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
35. The Packing Property
36. A Characterization of Weakly Bipartite Graphs
37. Lehman matrices
38. The Cycling Property for the Clutter of Odd st-Walks
39. Packing directed circuits exactly
40. Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
41. The packing property
42. Perfect and ideal 0, + and - 1 matrices
43. A Short Proof of Seymour’s Characterization of the Matroids with the Max-Flow Min-Cut Property
44. Integral Polyhedra Related to Even Cycle and Even Cut Matroids
45. Circuit Mengerian Directed Graphs
46. A family of switch equivalent graphs
47. A Characterization of Weakly Bipartite Graphs
48. The Packing Property
49. Ideal clutters
50. A Characterization of Weakly Bipartite Graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.