| On the diameter of lattice polytopes A Del Pia, C Michini Discrete & Computational Geometry 55, 681-687, 2016 | 34 | 2016 |
| Totally unimodular congestion games A Del Pia, M Ferris, C Michini Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 31 | 2017 |
| A concept lattice-based kernel for SVM text classification C Carpineto, C Michini, R Nicolussi Formal Concept Analysis: 7th International Conference, ICFCA 2009 Darmstadt …, 2009 | 26 | 2009 |
| Shattering inequalities for learning optimal decision trees JJ Boutilier, C Michini, Z Zhou International Conference on Integration of Constraint Programming …, 2022 | 17 | 2022 |
| Scenario aggregation using binary decision diagrams for stochastic programs with endogenous uncertainty UU Haus, C Michini, M Laumanns arXiv preprint arXiv:1701.04055, 2017 | 11 | 2017 |
| How tight is the corner relaxation? Insights gained from the stable set problem G Cornuéjols, C Michini, G Nannicini Discrete Optimization 9 (2), 109-121, 2012 | 11 | 2012 |
| The price of anarchy in series-parallel network congestion games B Hao, C Michini Mathematical Programming 203 (1), 499-529, 2024 | 9 | 2024 |
| Short simplex paths in lattice polytopes A Del Pia, C Michini Discrete & Computational Geometry, 1-22, 2022 | 9 | 2022 |
| Tight cycle relaxations for the cut polytope C Michini SIAM Journal on Discrete Mathematics 34 (4), 2021 | 8* | 2021 |
| The Hirsch Conjecture for the fractional stable set polytope C Michini, A Sassano Mathematical Programming 147 (1), 309-330, 2014 | 8 | 2014 |
| Compact representations of all members of an independence system UU Haus, C Michini Annals of Mathematics and Artificial Intelligence 79 (1), 145-162, 2017 | 7 | 2017 |
| On the strength of the cycle relaxation for the boolean quadric polytope C Michini Optimization Online preprint 2016/06 5483, 2016 | 6 | 2016 |
| Optimal multivariate decision trees J Boutilier, C Michini, Z Zhou Constraints 28 (4), 549-577, 2023 | 5 | 2023 |
| Representations of All Solutions of Boolean Programming Problems. UU Haus, C Michini ISAIM, 2014 | 5 | 2014 |
| Inefficiency of pure nash equilibria in series-parallel network congestion games B Hao, C Michini International Conference on Web and Internet Economics, 3-20, 2022 | 4 | 2022 |
| The stable set problem: some structural properties and relaxations C Michini 4OR 11 (2), 199-200, 2013 | 3 | 2013 |
| Inefficiency of pure Nash equilibria in network congestion games: the impact of symmetry and network structure B Hao, C Michini ACM Transactions on Economics and Computation 12 (3), 1-30, 2024 | 2 | 2024 |
| Price of anarchy in paving matroid congestion games B Hao, C Michini International Symposium on Algorithmic Game Theory, 353-370, 2024 | 1 | 2024 |
| A Set-Covering Approach to Customized Coverage Instrumentation C Michini, P Ohmann, B Liblit, J Linderoth INFORMS Journal on Computing 36 (1), 21-38, 2024 | 1 | 2024 |
| Facility location and restoration games S Iloglu, LA Albert, C Michini Computers & Operations Research, 106896, 2024 | | 2024 |
Alberto Del PiaWisconsin Institute for Discovery & Department of Industrial and Systems Engineering, UW-MadisonVerified email at wisc.edu
