Alternative parameterizations of \textsc{Metric Dimension} (Q2285127): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2962811261
@@ Property / OpenAlex ID: W2962811261 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.10670
@@ Property / arXiv ID: 1804.10670 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving MAX-\(r\)-SAT above a tight lower bound
@@ Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+Partially Polynomial Kernels for Set Cover and Test Cover
+Normal rank
@@ Property / cites work @@
+Metric Dimension of Bounded Tree-length Graphs
@@ Property / cites work: Metric Dimension of Bounded Tree-length Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract)
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
+Normal rank
@@ Property / cites work @@
+Resolvability in graphs and the metric dimension of a graph
+Normal rank
@@ Property / cites work @@
+Q3803160
@@ Property / cites work: Q3803160 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Study of the Test Cover Problem
@@ Property / cites work: Parameterized Study of the Test Cover Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of metric dimension on planar graphs
@@ Property / cites work: Complexity of metric dimension on planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds Through Colors and IDs
@@ Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Metric Dimension Parameterized by Max Leaf Number
@@ Property / cites work: Metric Dimension Parameterized by Max Leaf Number / rank @@
+Normal rank
@@ Property / cites work @@
+The (weighted) metric dimension of graphs: hard and easy cases
+Normal rank
@@ Property / cites work @@
+Computing the metric dimension for chain graphs
@@ Property / cites work: Computing the metric dimension for chain graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results
+Normal rank
@@ Property / cites work @@
+Kernelization
@@ Property / cites work: Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
+Normal rank
@@ Property / cites work @@
+Kernelization using structural parameters on sparse graph classes
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The difference between the metric dimension and the determining number of a graph
+Normal rank
@@ Property / cites work @@
+Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
+Normal rank
@@ Property / cites work @@
+(Non-)existence of polynomial kernels for the test cover problem
+Normal rank
@@ Property / cites work @@
+Q4119237
@@ Property / cites work: Q4119237 / rank @@
+Normal rank
@@ Property / cites work @@
+A completeness theory for polynomial (Turing) kernelization
+Normal rank
@@ Property / cites work @@
+The metric dimension of the lexicographic product of graphs
+Normal rank
@@ Property / cites work @@
+Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
+Normal rank
@@ Property / cites work @@
+Landmarks in graphs
@@ Property / cites work: Landmarks in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4967164
@@ Property / cites work: Q4967164 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization – Preprocessing with a Guarantee
@@ Property / cites work: Kernelization – Preprocessing with a Guarantee / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+Almost 2-SAT is fixed-parameter tractable
@@ Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396557
@@ Property / cites work: Q3396557 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4075485
@@ Property / cites work: Q4075485 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3803159
@@ Property / cites work: Q3803159 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472491
@@ Property / cites work: Q4472491 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial Turing-kernel for weighted independent set in bull-free graphs
+Normal rank
@@ Property / Wikidata QID @@
+Q128456782
@@ Property / Wikidata QID: Q128456782 / rank @@
+Normal rank