The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michele Conforti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  43. The Mixing Set with Divisible Capacities. [Citation Graph (, )][DBLP]


  44. On Lifting Integer Variables in Minimal Inequalities. [Citation Graph (, )][DBLP]


  45. Extended formulations in combinatorial optimization. [Citation Graph (, )][DBLP]


Search in 0.040secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002