Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882): Difference between revisions

@@ label / en / label / en @@
+Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs
+Normal rank
@@ Property / cites work @@
+Kernel(s) for problems with no kernel
@@ Property / cites work: Kernel(s) for problems with no kernel / rank @@
+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 @@
+Approximating Longest Cycles in Graphs with Bounded Degrees
+Normal rank
@@ Property / cites work @@
+The circumference of a graph with no \(K_{3,t}\)-minor. II
+Normal rank
@@ Property / cites work @@
+Minimum bisection is fixed parameter tractable
@@ Property / cites work: Minimum bisection is fixed parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear connectivity forces large complete bipartite minors: an alternative approach
+Normal rank
@@ Property / cites work @@
+Kernelization using structural parameters on sparse graph classes
+Normal rank
@@ Property / cites work @@
+Parameterized certificate dispersal and its variants
+Normal rank
@@ Property / cites work @@
+Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
+Normal rank
@@ Property / cites work @@
+A completeness theory for polynomial (Turing) kernelization
+Normal rank
@@ Property / cites work @@
+Finding Highly Connected Subgraphs
@@ Property / cites work: Finding Highly Connected Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Turing kernelization for finding long paths and cycles in restricted graph classes
+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 @@
+Turing kernelization for finding long paths in graph classes excluding a topological minor
+Normal rank
@@ Property / cites work @@
+Q5275384
@@ Property / cites work: Q5275384 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XVII: Taming a vortex
@@ Property / cites work: Graph minors. XVII: Taming a vortex / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized computational complexity of finding small-diameter subgraphs
+Normal rank
@@ Property / cites work @@
+A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs
+Normal rank
@@ Property / full work available at URL @@
+https://drops.dagstuhl.de/opus/volltexte/2018/8557/pdf/LIPIcs-IPEC-2017-23.pdf/
+Normal rank
@@ Property / OpenAlex ID @@
+W2964190780
@@ Property / OpenAlex ID: W2964190780 / rank @@
+Normal rank
@@ Property / title @@
+Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (English)
+Normal rank