Fast FAST
From MaRDI portal
Recommendations
Cited in
(48)- Problems on finite automata and the exponential time hypothesis
- Cluster editing: kernelization based on edge cuts
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- Blazing fast OT for three-round UC OT extension
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems
- A quadratic vertex kernel for feedback arc set in bipartite tournaments
- Fixed-parameter tractability results for feedback set problems in tournaments
- On width measures and topological problems on semi-complete digraphs
- Tractability of König edge deletion problems
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments
- Quicker than Quickhull
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Exploring the subexponential complexity of completion problems
- Studies in Computational Aspects of Voting
- What's next? Future directions in parameterized complexity
- Ranking and drawing in subexponential time
- Cluster editing: kernelization based on edge cuts
- Approximation schemes for the betweenness problem in tournaments and related ranking problems
- Tournaments and Semicomplete Digraphs
- Locally Semicomplete Digraphs and Generalizations
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Kernel and fast algorithm for dense triplet inconsistency
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Confronting intractability via parameters
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
- Coverability and sub-exponential parameterized algorithms in planar graphs
- Speed is more powerful than clairvoyance
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
- Packing Arc-Disjoint Cycles in Tournaments
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- Editing to Connected F-Degree Graph
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- Slightly superexponential parameterized problems
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
- A survey of parameterized algorithms and the complexity of edge modification
- Kernels for feedback arc set in tournaments
- A phase transition in Arrow's theorem with three alternatives
- Quantum algorithms for one-sided crossing minimization
- Approximate selection with unreliable comparisons in sublinear time
- Quantum algorithms for one-sided crossing minimization
- Polynomial kernel for immersion hitting in tournaments
- Cluster editing with locally bounded modifications
- Exploiting dense structures in parameterized complexity
- Width notions for ordering-related problems
- Dynamic parameterized feedback problems in tournaments
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
This page was built for publication: Fast FAST
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638023)
