default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsabella Lari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]Elena Fernández
, Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari:
Connected graph partitioning with aggregated and non-aggregated gap objective functions. Networks 82(4): 551-570 (2023)- 2022
- [i3]Giorgio Ausiello, Lorenzo Balzotti, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs. CoRR abs/2204.10568 (2022) - 2021
- [j22]Maurizio Bruglieri, Roberto Cordone, Isabella Lari, Federica Ricca, Andrea Scozzari:
On finding connected balanced partitions of trees. Discret. Appl. Math. 299: 1-16 (2021) - 2020
- [i2]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max-flow vitality in undirected unweighted planar graphs. CoRR abs/2011.02375 (2020)
2010 – 2019
- 2019
- [j21]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max flow vitality in general and st-planar graphs. Networks 74(1): 70-78 (2019) - 2018
- [j20]Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari:
Uniform and most uniform partitions of trees. Discret. Optim. 30: 96-107 (2018) - 2017
- [i1]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max flow vitality in general and planar graphs. CoRR abs/1710.01965 (2017) - 2016
- [j19]Piero Barone, Isabella Lari:
On a class of parameters estimators in linear models dominating the least squares one. Digit. Signal Process. 54: 27-34 (2016) - [j18]Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari:
Algorithms for uniform centered partitions of trees. Electron. Notes Discret. Math. 55: 37-40 (2016) - [j17]Isabella Lari, Federica Ricca, Justo Puerto, Andrea Scozzari:
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria. Networks 67(1): 69-81 (2016) - 2014
- [j16]Isabella Lari, Friedrich Pukelsheim, Federica Ricca:
Mathematical modeling of electoral systems: analysis, evaluation, optimization. In memory of Bruno Simeone (1945-2010). Ann. Oper. Res. 215(1): 1-14 (2014) - [j15]Isabella Lari, Federica Ricca, Andrea Scozzari:
Bidimensional allocation of seats via zero-one matrices with given line sums. Ann. Oper. Res. 215(1): 165-181 (2014) - [j14]Bruno Simeone, Gilbert Nouno, M. Mezzadri, Isabella Lari:
A Boolean theory of signatures for tonal scales. Discret. Appl. Math. 165: 283-294 (2014) - [c6]Endre Boros, Isabella Lari:
Cones of Nonnegative Quadratic Pseudo-Boolean Functions. ISAIM 2014 - 2011
- [j13]Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker:
Locating median paths on connected outerplanar graphs. Networks 57(3): 294-307 (2011)
2000 – 2009
- 2009
- [j12]Isabella Lari, Maurizio Maravalle, Bruno Simeone:
Computing sharp bounds for hard clustering problems on trees. Discret. Appl. Math. 157(5): 991-1008 (2009) - [j11]Nicola Apollonio, Ronald I. Becker, Isabella Lari, Federica Ricca, Bruno Simeone:
Bicolored graph partitioning, or: gerrymandering at its worst. Discret. Appl. Math. 157(17): 3601-3614 (2009) - 2008
- [j10]Isabella Lari, Federica Ricca, Andrea Scozzari:
Comparing different metaheuristic approaches for the median path problem with bounded length. Eur. J. Oper. Res. 190(3): 587-597 (2008) - [j9]Bahman Kalantari, Isabella Lari, Federica Ricca, Bruno Simeone:
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. Math. Program. 112(2): 371-401 (2008) - [j8]Nicola Apollonio, Isabella Lari, Federica Ricca, Bruno Simeone, Justo Puerto:
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs. Networks 51(1): 78-89 (2008) - [c5]Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker:
Locating Median Paths on Connected Outerplanar Graphs. CTW 2008: 186-188 - 2007
- [j7]Ronald I. Becker, Isabella Lari, Andrea Scozzari, Giovanni Storchi:
The location of median paths on grid graphs. Ann. Oper. Res. 150(1): 65-78 (2007) - [j6]Ronald I. Becker, Isabella Lari, Andrea Scozzari:
Algorithms for central-median paths with bounded length on trees. Eur. J. Oper. Res. 179(3): 1208-1220 (2007) - 2004
- [j5]Endre Boros, Isabella Lari, Bruno Simeone:
Block linear majorants in quadratic 0-1 optimization. Discret. Appl. Math. 145(1): 52-71 (2004) - 2002
- [j4]Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari, Giovanni Storchi:
Finding the l-core of a tree. Discret. Appl. Math. 118(1-2): 25-42 (2002) - [j3]Ronald I. Becker, Isabella Lari, Giovanni Storchi, Andrea Scozzari:
Efficient algorithms for finding the (k, l)-core of tree networks. Networks 40(4): 208-215 (2002) - [c4]Isabella Lari, Federica Ricca, Andrea Scozzari:
The Forest Wrapping Problem on Outerplanar Graphs. WG 2002: 345-354 - 2001
- [j2]Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone:
A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders. Theory Comput. Syst. 34(4): 353-374 (2001) - [c3]Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari:
The Cent-dian Path Problem on Tree Networks. ISAAC 2001: 743-755
1990 – 1999
- 1998
- [j1]Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone:
Max-min partitioning of grid graphs into connected components. Networks 32(2): 115-125 (1998) - 1992
- [c2]Alessandro Ciancimino, Isabella Lari, Claudio Valant:
Process/Product Integrated Planning in a Manufacturing System: A Linear Programming Model. PROLAMAT 1992: 311-319 - 1990
- [c1]Alessandro Ciancimino, Isabella Lari, Fernando Nicolò, Mario Lucertini:
Skill Planning in a Manufacturing Plant: a Short Term Flow Network Model. Modelling the Innovation 1990: 271-282
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-10-30 21:36 CET 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:
