Editing to a Planar Graph of Given Degrees (Q3194713): Difference between revisions

@@ Property / OpenAlex ID @@
+W2743518277
@@ Property / OpenAlex ID: W2743518277 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02773
@@ Property / arXiv ID: 1508.02773 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of three edge contraction problems with degree constraints
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+The spanning subgraphs of eulerian graphs
@@ Property / cites work: The spanning subgraphs of eulerian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness results for edge modification problems
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of even/odd subgraph problems
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of Eulerian deletion problems
+Normal rank
@@ Property / cites work @@
+Q2978505
@@ Property / cites work: Q2978505 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743379
@@ Property / cites work: Q5743379 / rank @@
+Normal rank
@@ Property / cites work @@
+Win-Win Kernelization for Degree Sequence Completion Problems
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q2965494
@@ Property / cites work: Q2965494 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear kernel for planar red-blue dominating set
+Normal rank
@@ Property / cites work @@
+Editing to a Connected Graph of Given Degrees
@@ Property / cites work: Editing to a Connected Graph of Given Degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Editing to a graph of given degrees
@@ Property / cites work: Editing to a graph of given degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Editing graphs to satisfy degree constraints: a parameterized approach
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding regular induced subgraphs
+Normal rank
@@ Property / cites work @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding whether a planar graph has a cubic subgraph is NP-complete
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank