scientific article; zbMATH DE number 5485441
From MaRDI portal
Publication:3549601
Cited in
(79)- Fixed-parameter algorithms for Kemeny rankings
- Rank aggregation: new bounds for MCx
- Exploring the median of permutations problem
- Beyond rankings: comparing directed acyclic graphs
- On the approximability of Dodgson and Young elections
- Monocular extraction of 2.1D sketch using constrained convex optimization
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Preference-based learning to rank
- On the hardness of maximum rank aggregation problems
- Using intransitive triads to determine final species richness of competition networks
- Approximate minimum selection with unreliable comparisons
- Space reduction constraints for the median of permutations problem
- Automedian sets of permutations: direct sum and shuffle
- Fixed-parameter tractability results for feedback set problems in tournaments
- Ranking tournaments with no errors. I: Structural description
- On width measures and topological problems on semi-complete digraphs
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Comparison-based interactive collaborative filtering
- Computing kemeny rankings from d-Euclidean preferences
- Medians of Permutations: Building Constraints
- An algorithmic view of voting
- Recurring comparison faults: sorting and finding the minimum
- Ranking and drawing in subexponential time
- Partial kernelization for rank aggregation: theory and experiments
- Cluster editing: kernelization based on edge cuts
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
- Approximation schemes for the betweenness problem in tournaments and related ranking problems
- scientific article; zbMATH DE number 7232797 (Why is no real title available?)
- Comparison-based interactive collaborative filtering
- Fixed-Parameter Algorithms for Kemeny Scores
- Improved parameterized algorithms for the Kemeny aggregation problem
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Kernel and fast algorithm for dense triplet inconsistency
- Experiments with Kemeny ranking: What works when?
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Bayesian network learning via topological order
- The feedback arc set problem with triangle inequality is a vertex cover problem
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
- Preference-based online learning with dueling bandits: a survey
- Proportional approval voting, harmonic \(k\)-median, and negative association
- Robust Learning of Consumer Preferences
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
- Tight localizations of feedback sets
- An exact method for the minimum feedback arc set problem
- Triangle packing in (sparse) tournaments: approximation and kernelization
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
- Socially desirable approximations for dodgson’s voting rule
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
- scientific article; zbMATH DE number 7758347 (Why is no real title available?)
- A new interpretation and derivation of the Swaps index
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al..
- Degreewidth: A New Parameter for Solving Problems on Tournaments
- Parameterized aspects of distinct Kemeny rank aggregation
- Kernels for feedback arc set in tournaments
- A better LP rounding for feedback arc set on tournaments
- Parameterized aspects of distinct Kemeny rank aggregation
- On the minimum number of inversions to make a digraph k-(arc-)strong
- Quantum algorithms for one-sided crossing minimization
- Approximate selection with unreliable comparisons in sublinear time
- Quantum algorithms for one-sided crossing minimization
- Approximate maximum rank aggregation: beyond the worst-case
- Finding small feedback arc sets on large graphs
- On the minimum number of inversions to make a digraph k-(arc-)strong (extended abstract)
- Average parameterization and partial kernelization for computing medians
- Rank aggregation using scoring rules
- Width notions for ordering-related problems
- New algorithms and lower bounds for streaming tournaments
- Dynamic parameterized feedback problems in tournaments
- Hardness of median and center in the Ulam metric
- Polynomial kernels with reachability for weighted d-matroid intersection
- Improved combinatorial approximation algorithms for feedback arc set and rank aggregation problems
- Robust-sorting and applications to Ulam-median
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
- A randomized approximation algorithm for computing bucket orders
- A note on generalized rank aggregation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549601)
