2008 |
46 | EE | Michele Conforti,
Marco Di Summa,
Laurence A. Wolsey:
The Mixing Set with Divisible Capacities.
IPCO 2008: 435-449 |
45 | EE | Michele Conforti,
Laurence A. Wolsey:
Compact formulations as a union of polyhedra.
Math. Program. 114(2): 277-289 (2008) |
2007 |
44 | EE | Michele Conforti,
Bert Gerards,
Giacomo Zambelli:
Mixed-Integer Vertex Covers on Bipartite Graphs.
IPCO 2007: 324-336 |
43 | EE | Michele Conforti,
Marco Di Summa,
Laurence A. Wolsey:
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows.
IPCO 2007: 352-366 |
42 | EE | Michele Conforti,
Bert Gerards:
Packing Odd Circuits.
SIAM J. Discrete Math. 21(2): 273-302 (2007) |
41 | EE | Michele Conforti,
Marco Di Summa,
Laurence A. Wolsey:
The Mixing Set with Flows.
SIAM J. Discrete Math. 21(2): 396-407 (2007) |
2006 |
40 | EE | Michele Conforti,
Gérard Cornuéjols,
Giacomo Zambelli:
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements.
Combinatorica 26(5): 533-558 (2006) |
39 | EE | Michele Conforti,
Gérard Cornuéjols,
Kristina Vuskovic:
Balanced matrices.
Discrete Mathematics 306(19-20): 2411-2437 (2006) |
38 | EE | Michele Conforti,
Giacomo Zambelli:
Recognizing Balanceable Matrices.
Math. Program. 105(2-3): 161-179 (2006) |
37 | EE | Michele Conforti,
Gérard Cornuéjols,
Xinming Liu,
Kristina Vuskovic,
Giacomo Zambelli:
Odd Hole Recognition in Graphs of Bounded Clique Size.
SIAM J. Discrete Math. 20(1): 42-48 (2006) |
2005 |
36 | EE | Livio Colussi,
Michele Conforti,
Giacomo Zambelli:
Disjoint paths in arborescences.
Discrete Mathematics 292(1-3): 187-191 (2005) |
2004 |
35 | EE | Michele Conforti,
Anna Galluccio,
Guido Proietti:
Edge-Connectivity Augmentation and Network Matrices.
WG 2004: 355-364 |
34 | EE | Michele Conforti,
Gérard Cornuéjols,
Kristina Vuskovic:
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins.
Discrete Applied Mathematics 141(1-3): 41-91 (2004) |
33 | EE | Michele Conforti,
Giovanni Rinaldi,
Laurence A. Wolsey:
On the cut polyhedron.
Discrete Mathematics 277(1-3): 279-285 (2004) |
32 | EE | Michele Conforti,
Gérard Cornuéjols,
Kristina Vuskovic:
Square-free perfect graphs.
J. Comb. Theory, Ser. B 90(2): 257-307 (2004) |
2003 |
31 | EE | Michele Conforti,
Gérard Cornuéjols:
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs.
J. Comb. Theory, Ser. B 87(2): 300-330 (2003) |
30 | EE | Michele Conforti,
Refael Hassin,
R. Ravi:
Reconstructing edge-disjoint paths.
Oper. Res. Lett. 31(3): 273-276 (2003) |
2002 |
29 | EE | Michele Conforti,
Gérard Cornuéjols,
Grigor Gasparyan,
Kristina Vuskovic:
Perfect Graphs, Partitionable Graphs and Cutsets.
Combinatorica 22(1): 19-33 (2002) |
2001 |
28 | EE | Michele Conforti,
Romeo Rizzi:
Shortest paths in conservative graphs.
Discrete Mathematics 226(1-3): 143-153 (2001) |
27 | EE | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Balanced 0-1 Matrices I. Decomposition.
J. Comb. Theory, Ser. B 81(2): 243-274 (2001) |
26 | EE | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Balanced 0-1 Matrices II. Recognition Algorithm.
J. Comb. Theory, Ser. B 81(2): 275-306 (2001) |
2000 |
25 | EE | Michele Conforti,
Bert Gerards,
Ajai Kapoor:
A Theorem of Truemper.
Combinatorica 20(1): 15-26 (2000) |
24 | | Lorenzo Brunetta,
Michele Conforti,
Matteo Fischetti:
A polyhedral approach to an integer multicommodity flow problem.
Discrete Applied Mathematics 101(1-3): 13-36 (2000) |
1999 |
23 | EE | Michele Conforti,
Gérard Cornuéjols,
Kristina Vuskovic:
Balanced cycles and holes in bipartite graphs.
Discrete Mathematics 199(1-3): 27-33 (1999) |
22 | EE | Michele Conforti,
Gérard Cornuéjols,
M. R. Rao:
Decomposition of Balanced Matrices.
J. Comb. Theory, Ser. B 77(2): 292-406 (1999) |
1998 |
21 | EE | Michele Conforti,
Ajai Kapoor:
A Theorem of Truemper.
IPCO 1998: 53-68 |
1997 |
20 | EE | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Finding an Even Hole in a Graph.
FOCS 1997: 480-485 |
19 | | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Universally Signable Graphs.
Combinatorica 17(1): 67-77 (1997) |
18 | | Lorenzo Brunetta,
Michele Conforti,
Giovanni Rinaldi:
A branch-and-cut algorithm for the equicut problem.
Math. Program. 77: 243-263 (1997) |
1996 |
17 | | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Perfect Matchings in Balanced Hypergraphs.
Combinatorica 16(3): 325-329 (1996) |
1995 |
16 | | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
A Mickey-Mouse Decomposition Theorem.
IPCO 1995: 321-328 |
15 | EE | Michele Conforti,
Gérard Cornuéjols,
M. R. Rao:
Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs.
Discrete Applied Mathematics 62(1-3): 103-117 (1995) |
14 | EE | Michele Conforti,
Gérard Cornuéjols:
A Class of Logic Problems Solvable by Linear Programming.
J. ACM 42(5): 1107-1113 (1995) |
13 | | Michele Conforti,
Gérard Cornuéjols:
Balanced 0, +-1-matrixces, bicoloring and total dual integrality.
Math. Program. 71: 249-258 (1995) |
1994 |
12 | | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Recognizing Balanced 0, ± Matrices.
SODA 1994: 103-111 |
1993 |
11 | | Michele Conforti,
M. R. Rao:
Testing balancedness and perfection of linear matrices.
Math. Program. 61: 1-18 (1993) |
1992 |
10 | | Michele Conforti,
Gérard Cornuéjols:
A Class of Logic Problems Solvable by Linear Programming
FOCS 1992: 670-675 |
9 | EE | Michele Conforti,
M. R. Rao:
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets.
Discrete Mathematics 104(1): 23-47 (1992) |
8 | EE | Michele Conforti,
M. R. Rao:
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations.
Discrete Mathematics 110(1-3): 81-118 (1992) |
7 | | Michele Conforti,
M. R. Rao:
Structural properties and decomposition of linear balanced matrices.
Math. Program. 55: 129-168 (1992) |
6 | | Michele Conforti,
M. R. Rao:
Properties of balanced and perfect matrices.
Math. Program. 55: 35-47 (1992) |
1991 |
5 | | Michele Conforti,
M. R. Rao,
Antonio Sassano:
The equipartition polytope. I: Formulations, dimension and basic facets.
Math. Program. 49: 49-70 (1991) |
4 | | Michele Conforti,
M. R. Rao,
Antonio Sassano:
The equipartition polytope. II: Valid inequalities and facets.
Math. Program. 49: 71-90 (1991) |
1990 |
3 | | Michele Conforti,
Gérard Cornuéjols:
A Decomposition Theorem for Balanced Matrices.
IPCO 1990: 147-169 |
1987 |
2 | EE | Francisco Barahona,
Michele Conforti:
A construction for binary matroids.
Discrete Mathematics 66(3): 213-218 (1987) |
1986 |
1 | EE | Michele Conforti,
Derek G. Corneil,
Ali Ridha Mahjoub:
Ki-covers I: Complexity and polytopes.
Discrete Mathematics 58(2): 121-142 (1986) |