The following pages link to (Q4393480):
Displaying 50 items.
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- Algorithms for parameterized maximum agreement forest problem on multiple trees (Q744101) (← links)
- An improved kernel size for rotation distance in binary trees (Q763531) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- Simplifying the weft hierarchy (Q820144) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Moving policies in cyclic assembly line scheduling (Q820155) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Refined memorization for vertex cover (Q835007) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← links)
- Parameterized power domination complexity (Q844180) (← links)
- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815) (← links)
- On notions of regularity for data languages (Q846359) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Matroid tree-width (Q852702) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Stochastic local search for the FEATURE SET problem, with applications to microarray data (Q865564) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- Configurations with few crossings in topological graphs (Q876504) (← links)
- Fast local search methods for solving limited memory influence diagrams (Q895537) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- On the parameterized complexity of dynamic problems (Q896122) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Directed elimination games (Q896668) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
- The firefighter problem on graph classes (Q899308) (← links)
- Directed NLC-width (Q906393) (← links)
