The parameterized complexity of the shared center problem (Q517791): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-012-9730-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2008154175
@@ Property / OpenAlex ID: W2008154175 / rank @@
+Normal rank
@@ Property / cites work @@
+A three-string approach to the closest string problem
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for CLOSEST STRING and related problems
+Normal rank
@@ Property / cites work @@
+Q5717121
@@ Property / cites work: Q5717121 / rank @@
+Normal rank
@@ Property / cites work @@
+More Efficient Algorithms for Closest String and Substring Problems
+Normal rank
@@ Property / cites work @@
+Closest Substring Problems with Small Distances
@@ Property / cites work: Closest Substring Problems with Small Distances / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
+Normal rank
@@ Property / cites work @@
+Q2934651
@@ Property / cites work: Q2934651 / rank @@
+Normal rank