On the parameterized complexity of the repetition free longest common subsequence problem (Q413298): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q15
@@ Property / Mathematics Subject Classification ID: 68Q15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R05
@@ Property / Mathematics Subject Classification ID: 68R05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+D20
@@ Property / Mathematics Subject Classification ID: 92D20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6030966
@@ Property / zbMATH DE Number: 6030966 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithms
@@ Property / zbMATH Keywords: algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial problems
@@ Property / zbMATH Keywords: combinatorial problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+repetition free longest common subsequence
@@ Property / zbMATH Keywords: repetition free longest common subsequence / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+longest common subsequence
@@ Property / zbMATH Keywords: longest common subsequence / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2011.12.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2055835487
@@ Property / OpenAlex ID: W2055835487 / rank @@
+Normal rank
@@ Property / cites work @@
+Repetition-free longest common subsequence
@@ Property / cites work: Repetition-free longest common subsequence / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel Bounds for Disjoint Cycles and Disjoint Paths
+Normal rank
@@ Property / cites work @@
+Variants of constrained longest common subsequence
+Normal rank
@@ Property / cites work @@
+A simple algorithm for the constrained sequence problems
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Finding and Counting Vertex-Colored Subtrees
@@ Property / cites work: Finding and Counting Vertex-Colored Subtrees / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
+Normal rank
@@ Property / cites work @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+Limits and Applications of Group Algebras for Parameterized Problems
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:413298