Pages that link to "Item:Q1011761"
From MaRDI portal
The following pages link to On the complexity of crossings in permutations (Q1011761):
Displaying 14 items.
- Ranking chain sum orders (Q290525) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
- Computing kemeny rankings from \(d\)-Euclidean preferences (Q2695434) (← links)
- COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES (Q2846476) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Privacy in Elections: k-Anonymizing Preference Orders (Q2947888) (← links)
- The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders (Q3004688) (← links)
- Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation (Q4989327) (← links)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)
- On weakly and strongly popular rankings (Q6094721) (← links)
