Pages that link to "Item:Q3058688"

The following pages link to On the Kernelization Complexity of Colorful Motifs (Q3058688):

Displaying 23 items.

• Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
• Parameterized algorithms for the module motif problem (Q342716) (← links)
• Finding approximate and constrained motifs in graphs (Q390871) (← links)
• Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
• Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
• Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
• Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
• Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
• Finding and counting vertex-colored subtrees (Q1949738) (← links)
• Partial information network queries (Q2018546) (← links)
• On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
• Algorithms for topology-free and alignment network queries (Q2250538) (← links)
• Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
• Some results on more flexible versions of Graph Motif (Q2354588) (← links)
• The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
• Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
• Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
• On Structural Parameterizations of Graph Motif and Chromatic Number (Q2971640) (← links)
• Finding Approximate and Constrained Motifs in Graphs (Q3011870) (← links)
• On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
• Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396) (← links)
• Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
• Polynomial Turing compressions for some graph problems parameterized by modular-width (Q6591463) (← links)