Ranking chain sum orders
From MaRDI portal
Publication:290525
DOI10.1016/j.tcs.2016.05.026zbMath1342.68141OpenAlexW2404327337MaRDI QIDQ290525
Andreas Gleißner, Franz-Josef Brandenburg
Publication date: 1 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.026
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
- Computing distances between partial rankings
- On the complexity of crossings in permutations
- Fixed-parameter algorithms for Kemeny rankings
- Metric methods for analyzing partially ranked data
- Voting schemes for which it can be difficult to tell who won the election
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- On the hardness of maximum rank aggregation problems
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES
- Determining Possible and Necessary Winners Given Partial Orders
- Simple and Efficient Bilayer Cross Counting
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
- When are elections with few candidates hard to manipulate?
- The Complexity of the Partial Order Dimension Problem
- Comparing Top k Lists
- A complete axiomatisation for the inclusion of series-parallel partial orders
- Ranking Tournaments
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
- Partial orders of dimension 2
- Comparing Partial Rankings
This page was built for publication: Ranking chain sum orders
