Michele Conforti
Orcid: 0000-0002-6267-6941
According to our database1,
Michele Conforti
authored at least 106 papers
between 1984 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
1
1
2
1
2
3
4
3
1
1
3
6
1
3
1
1
5
2
1
3
4
1
3
2
3
4
3
3
2
2
3
1
1
4
2
2
2
5
1
1
1
1
1
1
2
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
2023
Math. Program., March, 2023
2022
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II.
Comb., December, 2022
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles.
Math. Program., 2022
2021
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective.
4OR, 2021
2020
Math. Program., 2020
CoRR, 2020
The stable set problem in graphs with bounded genus and bounded odd cycle packing number.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
2018
2017
Oper. Res. Lett., 2017
2016
2015
Oper. Res. Lett., 2015
2014
2013
SIAM J. Discret. Math., 2013
Proceedings of the Integer Programming and Combinatorial Optimization, 2013
2012
2011
2010
SIAM J. Discret. Math., 2010
Oper. Res. Lett., 2010
Math. Oper. Res., 2010
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010
2009
2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
2007
Math. Oper. Res., 2007
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007
Proceedings of the Integer Programming and Combinatorial Optimization, 2007
2006
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements.
Comb., 2006
2005
2004
Discret. Appl. Math., 2004
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Proceedings of the Sharpest Cut, 2004
2003
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs.
J. Comb. Theory B, 2003
2002
2001
2000
Discret. Appl. Math., 2000
1999
1998
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
1995
Math. Program., 1995
Discret. Appl. Math., 1995
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1994
Math. Oper. Res., 1994
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994
1993
1992
Math. Program., 1992
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations.
Discret. Math., 1992
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets.
Discret. Math., 1992
1991
Math. Program., 1991
1990
A Decomposition Theorem for Balanced Matrices.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990
1989
1988
1987
Networks, 1987
Structural properties and recognition of restricted and strongly unimodular matrices.
Math. Program., 1987
Math. Oper. Res., 1987
J. Graph Theory, 1987
1986
1984
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem.
Discret. Appl. Math., 1984