The following pages link to Collette R. Coullard (Q751504):
Displaying 28 items.
- (Q580173) (redirect page) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- On the complexity of recognizing a class of generalized networks (Q1058995) (← links)
- On chains of 3-connected matroids (Q1086571) (← links)
- Finding a small 3-connected minor maintaining a fixed minor and a fixed element (Q1100209) (← links)
- Adjoints of binary matroids (Q1109040) (← links)
- Representations of bicircular matroids (Q1179188) (← links)
- Extensions of Tutte's wheels-and-whirls theorem (Q1204468) (← links)
- Uncovering generalized-network structure in matrices (Q1308737) (← links)
- On renamable Horn and generalized Horn functions (Q1356207) (← links)
- Matching problems in selective assembly operations (Q1383124) (← links)
- Counterexamples to conjectures on 4-connected matroids (Q1821108) (← links)
- An inventory-location model: Formulation, solution algorithm and computational results (Q1872014) (← links)
- Totally unimodular Leontief directed hypergraphs (Q1904049) (← links)
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298) (← links)
- Independence and port oracles for matroids, with an application to computational learning theory (Q1924488) (← links)
- Recognizing a class of bicircular matroids (Q2367405) (← links)
- Decomposition of 3-connected graphs (Q2367440) (← links)
- (Q3128892) (← links)
- DISTANCE VISIBILITY GRAPHS (Q3136225) (← links)
- Capacitated warehouse location model with risk pooling (Q3518725) (← links)
- (Q3822176) (← links)
- (Q4273875) (← links)
- (Q4347282) (← links)
- (Q4840098) (← links)
- Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs (Q5287453) (← links)
- On cycle cones and polyhedra (Q5895283) (← links)
- On cycle cones and polyhedra (Q5896529) (← links)
