Editing to a planar graph of given degrees (Q730508): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2016.11.009
@@ Property / DOI: 10.1016/j.jcss.2016.11.009 / 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.jcss.2016.11.009
+Normal rank
@@ Property / OpenAlex ID @@
+W1913638054
@@ Property / OpenAlex ID: W1913638054 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of three edge contraction problems with degree constraints
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+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 @@
+Editing to Eulerian graphs
@@ Property / cites work: Editing to Eulerian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Editing to a Planar Graph of Given Degrees
@@ Property / cites work: Editing to a Planar Graph of Given Degrees / 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 @@
+Explicit Linear Kernels via Dynamic Programming
@@ Property / cites work: Explicit Linear Kernels via Dynamic Programming / 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 @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / 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 @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Graph editing problems with extended regularity constraints
+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 @@
+A Short Proof of the Factor Theorem for Finite Graphs
+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
@@ Property / DOI @@
+.1016/J.JCSS.2016.11.009
@@ Property / DOI: 10.1016/J.JCSS.2016.11.009 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:730508