The following pages link to (Q3549601):
Displaying 50 items.
- Comparison-based interactive collaborative filtering (Q266268) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
- Experiments with Kemeny ranking: What works when? (Q449040) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments (Q534571) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- A randomized approximation algorithm for computing bucket orders (Q976119) (← links)
- A note on generalized rank aggregation (Q989442) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Rank aggregation: new bounds for MCx (Q1630773) (← links)
- Exploring the median of permutations problem (Q1711664) (← links)
- Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- Monocular extraction of 2.1D sketch using constrained convex optimization (Q1799939) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Preference-based learning to rank (Q1959596) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- Using intransitive triads to determine final species richness of competition networks (Q2067185) (← links)
- Approximate minimum selection with unreliable comparisons (Q2072098) (← links)
- Space reduction constraints for the median of permutations problem (Q2181257) (← links)
- Automedian sets of permutations: direct sum and shuffle (Q2220835) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists (Q2379921) (← links)
- Computing kemeny rankings from \(d\)-Euclidean preferences (Q2695434) (← links)
- Medians of Permutations: Building Constraints (Q2795953) (← links)
- An Algorithmic View of Voting (Q2827491) (← links)
- Recurring Comparison Faults: Sorting and Finding the Minimum (Q2947883) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- Partial Kernelization for Rank Aggregation: Theory and Experiments (Q3058689) (← links)
- Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
- (Q3303471) (← links)
- Comparison-Based Interactive Collaborative Filtering (Q3460733) (← links)
- Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)
- Improved Parameterized Algorithms for the Kemeny Aggregation Problem (Q3656872) (← links)
- Simple, Robust and Optimal Ranking from Pairwise Comparisons (Q4558526) (← links)
- (Q4637014) (← links)
- (Q4998871) (← links)
- Proportional Approval Voting, Harmonic k-median, and Negative Association (Q5002696) (← links)
- Robust Learning of Consumer Preferences (Q5080653) (← links)
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (Q5090975) (← links)
- Tight Localizations of Feedback Sets (Q5102049) (← links)
