Pages that link to "Item:Q383833"
From MaRDI portal
The following pages link to Fundamentals of parameterized complexity (Q383833):
Displaying 50 items.
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- Single peaked domains with tree-shaped spectra (Q2021339) (← links)
- Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Metric dimension parameterized by treewidth (Q2041987) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Optimal tree decompositions revisited: a simpler linear-time FPT algorithm (Q2056889) (← links)
- A faster parameterized algorithm for temporal matching (Q2059876) (← links)
- The complexity of finding temporal separators under waiting time constraints (Q2059911) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- The complexity of mixed-connectivity (Q2070706) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- A polynomial kernel for diamond-free editing (Q2072105) (← links)
- Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations (Q2077398) (← links)
- Refined parameterizations for computing colored cuts in edge-colored graphs (Q2082563) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
- Colored cut games (Q2087453) (← links)
- Structural parameterizations of Tracking Paths problem (Q2089072) (← links)
- MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms (Q2089669) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Eternal vertex cover on bipartite graphs (Q2097214) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- Complexity and algorithms for MUL-tree pruning (Q2115868) (← links)
- An FPT algorithm for matching cut and d-cut (Q2115892) (← links)
- On the impact of treewidth in the computational complexity of freezing dynamics (Q2117789) (← links)
- Parameter analysis for guarding terrains (Q2118384) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
