The following pages link to Bruno Simeone (Q431807):
Displaying 42 items.
- Network flow methods for electoral systems (Q2892147) (← links)
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment (Q2892156) (← links)
- Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs (Q2935262) (← links)
- (Q3040955) (← links)
- Cardinality constrained path covering problems in grid graphs (Q3156826) (← links)
- (Q3200885) (← links)
- Node-weighted graphs having the König-Egerváry property (Q3222885) (← links)
- (Q3315557) (← links)
- (Q3318541) (← links)
- (Q3322122) (← links)
- Box-threshold graphs (Q3322144) (← links)
- (Q3396612) (← links)
- Roof duality, complementation and persistency in quadratic 0–1 optimization (Q3693267) (← links)
- (Q3758559) (← links)
- Product form parametric representation of the solutions to a quadratic boolean equation (Q3780002) (← links)
- (Q3792723) (← links)
- From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions (Q3820646) (← links)
- (Q3863434) (← links)
- (Q3863436) (← links)
- (Q3865840) (← links)
- (Q3904382) (← links)
- Quadratic knapsack problems (Q3912370) (← links)
- (Q3919075) (← links)
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph (Q3960467) (← links)
- Threshold Sequences (Q3964623) (← links)
- Experimental comparison of 2-satisfiability algorithms (Q3979516) (← links)
- (Q3990423) (← links)
- Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem (Q4019566) (← links)
- (Q4211748) (← links)
- Evaluation and Optimization of Electoral Systems (Q4220552) (← links)
- (Q4294622) (← links)
- (Q4385383) (← links)
- (Q4516030) (← links)
- Max-min partitioning of grid graphs into connected components (Q4540070) (← links)
- Fair dissections of spiders, worms, and caterpillars (Q4712690) (← links)
- A spanning tree heuristic for regional clustering (Q4843881) (← links)
- (Q5289554) (← links)
- (Q5289581) (← links)
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194) (← links)
- Peter Ladislaw Hammer (Q5925274) (← links)
- A polynomial-time algorithm for max-min partitioning of ladders (Q5949573) (← links)
- Combinatorial problems related to origin-destination matrices. (Q5954235) (← links)
