The following pages link to Bruno Simeone (Q431807):
Displaying 50 items.
- (Q216332) (redirect page) (← links)
- Certificates of optimality: the third way to biproportional apportionment (Q431808) (← links)
- Maximum weight archipelago subgraph problem (Q490157) (← links)
- The give-up problem for blocked regional lists with multi-winners (Q554492) (← links)
- Political districting: From classical models to recent approaches (Q657583) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
- Degree sequences of matrogenic graphs (Q797597) (← links)
- A feasible directions method for computing Bayes E-optimal block designs (Q804197) (← links)
- General theoretical results on rectilinear embeddability of graphs (Q809088) (← links)
- A pseudo-Boolean consensus approach to nonlinear 0-1 optimization (Q955309) (← links)
- Bicolored graph partitioning, or: gerrymandering at its worst (Q967425) (← links)
- Peter Ladislaw Hammer (December 23, 1936 to December 27, 2006) (Q997059) (← links)
- Computing sharp bounds for hard clustering problems on trees (Q1028427) (← links)
- An asymptotically exact polynomial algorithm for equipartition problems (Q1076607) (← links)
- Unimodular functions (Q1079493) (← links)
- Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
- On the complexity of the maximum satisfiability problem for Horn formulas (Q1099168) (← links)
- Adamant digraphs (Q1104933) (← links)
- A switching algorithm for the solution of quadratic Boolean equations (Q1153123) (← links)
- The splittance of a graph (Q1167741) (← links)
- Theoretical results on at most 1-bend embeddability of graphs (Q1210238) (← links)
- Clustering heuristics for set covering (Q1309879) (← links)
- An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (Q1327236) (← links)
- Polynomial algorithms for nested univariate clustering (Q1348116) (← links)
- On-line 2-satisfiability (Q1356216) (← links)
- A graph partition problem (Q1367109) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- Clustering on trees (Q1392041) (← links)
- Path equipartition in the Chebyshev norm (Q1569949) (← links)
- Maximum split clustering under connectivity constraints (Q1762820) (← links)
- Most uniform path partitioning and its use in image processing (Q1803677) (← links)
- On a 2-dimensional equipartition problem (Q1806658) (← links)
- On the supermodular knapsack problem (Q1824552) (← links)
- A shifting algorithm for continuous tree partitioning (Q1850820) (← links)
- The maximum box problem and its application to data analysis (Q1856362) (← links)
- Pareto-optimal patterns in logical analysis of data (Q1885813) (← links)
- Saturated systems of homogeneous boxes and the logical analysis of numerical data (Q1885814) (← links)
- Error minimization methods in biproportional apportionment (Q1939088) (← links)
- Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging (Q2343069) (← links)
- Weighted Voronoi region algorithms for political districting (Q2389781) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- A Boolean theory of signatures for tonal scales (Q2448914) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654) (← links)
- Local search algorithms for political districting (Q2482812) (← links)
- Espaliers: A generalization of dendrograms (Q2563538) (← links)
- Recognition of a class of unimodular functions (Q2638932) (← links)
- Peter L. Hammer (1936-2006) (Q2644371) (← links)
- (Q2741531) (← links)
