Isabella Lari

Orcid: 0000-0002-3207-2493

According to our database1, Isabella Lari authored at least 31 papers between 1990 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Connected graph partitioning with aggregated and non-aggregated gap objective functions.
Networks, December, 2023

2022
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs.
CoRR, 2022

2021
On finding connected balanced partitions of trees.
Discret. Appl. Math., 2021

2020
Max-flow vitality in undirected unweighted planar graphs.
CoRR, 2020

2019
Max flow vitality in general and st-planar graphs.
Networks, 2019

2018
Uniform and most uniform partitions of trees.
Discret. Optim., 2018

2017
Max flow vitality in general and planar graphs.
CoRR, 2017

2016
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria.
Networks, 2016

Algorithms for uniform centered partitions of trees.
Electron. Notes Discret. Math., 2016

On a class of parameters estimators in linear models dominating the least squares one.
Digit. Signal Process., 2016

2014
A Boolean theory of signatures for tonal scales.
Discret. Appl. Math., 2014

Bidimensional allocation of seats via zero-one matrices with given line sums.
Ann. Oper. Res., 2014

Mathematical modeling of electoral systems: analysis, evaluation, optimization. In memory of Bruno Simeone (1945-2010).
Ann. Oper. Res., 2014

Cones of Nonnegative Quadratic Pseudo-Boolean Functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

2011
Locating median paths on connected outerplanar graphs.
Networks, 2011

2009
Computing sharp bounds for hard clustering problems on trees.
Discret. Appl. Math., 2009

Bicolored graph partitioning, or: gerrymandering at its worst.
Discret. Appl. Math., 2009

2008
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs.
Networks, 2008

On the complexity of general matrix scaling and entropy minimization via the RAS algorithm.
Math. Program., 2008

Comparing different metaheuristic approaches for the median path problem with bounded length.
Eur. J. Oper. Res., 2008

2007
Algorithms for central-median paths with bounded length on trees.
Eur. J. Oper. Res., 2007

The location of median paths on grid graphs.
Ann. Oper. Res., 2007

2004
Block linear majorants in quadratic 0-1 optimization.
Discret. Appl. Math., 2004

2002
Efficient algorithms for finding the (k, l)-core of tree networks.
Networks, 2002

Finding the l-core of a tree.
Discret. Appl. Math., 2002

The Forest Wrapping Problem on Outerplanar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001
A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders.
Theory Comput. Syst., 2001

The Cent-dian Path Problem on Tree Networks.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1998
Max-min partitioning of grid graphs into connected components.
Networks, 1998

1992
Process/Product Integrated Planning in a Manufacturing System: A Linear Programming Model.
Proceedings of the Human Aspects in Computer Integrated Manufacturing, 1992

1990
Skill Planning in a Manufacturing Plant: a Short Term Flow Network Model.
Proceedings of the Modelling the Innovation: Communications, 1990


  Loading...