default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarla Michini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Carla Michini
, Peter Ohmann, Ben Liblit, Jeff T. Linderoth:
A Set-Covering Approach to Customized Coverage Instrumentation. INFORMS J. Comput. 36(1): 21-38 (2024)- [j10]Bainian Hao, Carla Michini:
The price of Anarchy in series-parallel network congestion games. Math. Program. 203(1): 499-529 (2024) - [j9]Bainian Hao, Carla Michini:
Inefficiency of pure Nash equilibria in network congestion games: the impact of symmetry and network structure. ACM Trans. Economics and Comput. 12(3): 8:1-8:30 (2024) - [c6]Bainian Hao, Carla Michini:
Price of Anarchy in Paving Matroid Congestion Games. SAGT 2024: 353-370 - 2023
- [j8]Justin J. Boutilier, Carla Michini, Zachary Zhou:
Optimal multivariate decision trees. Constraints An Int. J. 28(4): 549-577 (2023) - 2022
- [j7]Alberto Del Pia, Carla Michini:
Short Simplex Paths in Lattice Polytopes. Discret. Comput. Geom. 67(2): 503-524 (2022) - [c5]Justin J. Boutilier, Carla Michini, Zachary Zhou:
Shattering Inequalities for Learning Optimal Decision Trees. CPAIOR 2022: 74-90 - [c4]Bainian Hao, Carla Michini:
Inefficiency of Pure Nash Equilibria in Series-Parallel Network Congestion Games. WINE 2022: 3-20 - 2021
- [j6]Carla Michini:
Tight Cycle Relaxations for the Cut Polytope. SIAM J. Discret. Math. 35(4): 2908-2921 (2021)
2010 – 2019
- 2019
- [i4]Alberto Del Pia, Carla Michini:
Short simplex paths in lattice polytopes. CoRR abs/1912.05712 (2019) - 2017
- [j5]Utz-Uwe Haus, Carla Michini:
Compact representations of all members of an independence system. Ann. Math. Artif. Intell. 79(1-3): 145-162 (2017) - [c3]Alberto Del Pia, Michael Ferris, Carla Michini:
Totally Unimodular Congestion Games. SODA 2017: 577-588 - [i3]Utz-Uwe Haus, Carla Michini, Marco Laumanns:
Scenario Aggregation using Binary Decision Diagrams for Stochastic Programs with Endogenous Uncertainty. CoRR abs/1701.04055 (2017) - 2016
- [j4]Alberto Del Pia, Carla Michini:
On the Diameter of Lattice Polytopes. Discret. Comput. Geom. 55(3): 681-687 (2016) - 2015
- [i2]Alberto Del Pia, Michael Ferris, Carla Michini:
Totally Unimodular Congestion Games. CoRR abs/1511.02784 (2015) - [i1]Alberto Del Pia, Carla Michini:
On the diameter of lattice polytopes. CoRR abs/1512.07872 (2015) - 2014
- [j3]Carla Michini, Antonio Sassano:
The Hirsch Conjecture for the fractional stable set polytope. Math. Program. 147(1-2): 309-330 (2014) - [c2]Utz-Uwe Haus, Carla Michini:
Representations of All Solutions of Boolean Programming Problems. ISAIM 2014 - 2013
- [j2]Carla Michini:
The stable set problem: some structural properties and relaxations. 4OR 11(2): 199-200 (2013) - 2012
- [b1]Carla Michini:
The stable set problem: some structural properties and relaxations. Sapienza University of Rome, Italy, 2012 - [j1]Gérard Cornuéjols, Carla Michini, Giacomo Nannicini:
How tight is the corner relaxation? Insights gained from the stable set problem. Discret. Optim. 9(2): 109-121 (2012)
2000 – 2009
- 2009
- [c1]Claudio Carpineto, Carla Michini, Raffaele Nicolussi:
A Concept Lattice-Based Kernel for SVM Text Classification. ICFCA 2009: 237-250
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
