Pages that link to "Item:Q3060716"
From MaRDI portal
The following pages link to Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament (Q3060716):
Displaying 31 items.
- Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index) (Q258462) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Exploring the median of permutations problem (Q1711664) (← links)
- Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Space reduction constraints for the median of permutations problem (Q2181257) (← links)
- Automedian sets of permutations: direct sum and shuffle (Q2220835) (← links)
- A quadratic vertex kernel for feedback arc set in bipartite tournaments (Q2258074) (← 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)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- Medians of Permutations: Building Constraints (Q2795953) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (Q5090975) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- (Q5092387) (← links)
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← links)
