The following pages link to Isabella Lari (Q510916):
Displaying 12 items.
- (Q216330) (redirect page) (← links)
- Algorithms for uniform centered partitions of trees (Q510918) (← links)
- Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
- Bidimensional allocation of seats via zero-one matrices with given line sums (Q744674) (← links)
- Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
- Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
- Bicolored graph partitioning, or: gerrymandering at its worst (Q967425) (← links)
- Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria (Q4638584) (← links)
- Efficient algorithms for finding the (k,l)-core of tree networks (Q4798193) (← links)
- Max flow vitality in general and <i>st</i>‐planar graphs (Q5226589) (← links)
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
