Carla Michini

Orcid: 0000-0002-4717-816X

According to our database1, Carla Michini authored at least 20 papers between 2009 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Facility location and restoration games.
Comput. Oper. Res., 2025

2024
Inefficiency of pure Nash equilibria in network congestion games: the impact of symmetry and network structure.
ACM Trans. Economics and Comput., September, 2024

The price of Anarchy in series-parallel network congestion games.
Math. Program., January, 2024

A Set-Covering Approach to Customized Coverage Instrumentation.
INFORMS J. Comput., 2024

Price of Anarchy in Paving Matroid Congestion Games.
Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

2023
Optimal multivariate decision trees.
Constraints An Int. J., December, 2023

2022
Short Simplex Paths in Lattice Polytopes.
Discret. Comput. Geom., 2022

Inefficiency of Pure Nash Equilibria in Series-Parallel Network Congestion Games.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Shattering Inequalities for Learning Optimal Decision Trees.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

2021
Tight Cycle Relaxations for the Cut Polytope.
SIAM J. Discret. Math., 2021

2017
Scenario Aggregation using Binary Decision Diagrams for Stochastic Programs with Endogenous Uncertainty.
CoRR, 2017

Compact representations of all members of an independence system.
Ann. Math. Artif. Intell., 2017

Totally Unimodular Congestion Games.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
On the Diameter of Lattice Polytopes.
Discret. Comput. Geom., 2016

2014
The Hirsch Conjecture for the fractional stable set polytope.
Math. Program., 2014

Representations of All Solutions of Boolean Programming Problems.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

2013
The stable set problem: some structural properties and relaxations.
4OR, 2013

2012
The stable set problem: some structural properties and relaxations.
PhD thesis, 2012

How tight is the corner relaxation? Insights gained from the stable set problem.
Discret. Optim., 2012

2009
A Concept Lattice-Based Kernel for SVM Text Classification.
Proceedings of the Formal Concept Analysis, 7th International Conference, 2009


  Loading...