The following pages link to Fast FAST (Q3638023):
Displaying 41 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← 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)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Confronting intractability via parameters (Q465686) (← 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)
- 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)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- On the threshold of intractability (Q2051847) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- A quadratic vertex kernel for feedback arc set in bipartite tournaments (Q2258074) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← 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)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- (Q4972036) (← 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)
- Editing to Connected F-Degree Graph (Q5232130) (← links)
- (Q5743514) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)