Effective computation of immersion obstructions for unions of graph classes (Q395009): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Effective Computation of Immersion Obstructions for Unions of Graph Classes
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6065667
@@ Property / title @@
+Effective Computation of Immersion Obstructions for Unions of Graph Classes (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05130
@@ Property / zbMATH Open document ID: 1357.05130 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-31155-0_15
@@ Property / DOI: 10.1007/978-3-642-31155-0_15 / rank @@
+Normal rank
@@ Property / published in @@
+Algorithm Theory – SWAT 2012
@@ Property / published in: Algorithm Theory – SWAT 2012 / rank @@
+Normal rank
@@ Property / publication date @@
+August 2012Timestamp +2012-08-14T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2012-08-14T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 14 August 2012 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6065667
@@ Property / zbMATH DE Number: 6065667 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1949768901
@@ Property / OpenAlex ID: W1949768901 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2791393500
@@ Property / OpenAlex ID: W2791393500 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5636
@@ Property / arXiv ID: 1207.5636 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579375
@@ Property / cites work: Q3579375 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast FAST
@@ Property / cites work: Fast FAST / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing graphs of small carving-width
@@ Property / cites work: Characterizing graphs of small carving-width / rank @@
+Normal rank
@@ Property / cites work @@
+Rankings of Graphs
@@ Property / cites work: Rankings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+On computing graph minor obstruction sets
@@ Property / cites work: On computing graph minor obstruction sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4520519
@@ Property / cites work: Q4520519 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Parameterized circuit complexity and the \(W\) hierarchy
+Normal rank
@@ Property / cites work @@
+Forbidden graphs for tree-depth
@@ Property / cites work: Forbidden graphs for tree-depth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4052071
@@ Property / cites work: Q4052071 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonconstructive tools for proving polynomial-time decidability
+Normal rank
@@ Property / cites work @@
+On search, decision, and the efficiency of polynomial-time algorithms
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3773882
@@ Property / cites work: Q3773882 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective computation of immersion obstructions for unions of graph classes
+Normal rank
@@ Property / cites work @@
+Finding topological subgraphs is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+A shorter proof of the graph minor algorithm
@@ Property / cites work: A shorter proof of the graph minor algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+The size of an intertwine
@@ Property / cites work: The size of an intertwine / rank @@
+Normal rank
@@ Property / cites work @@
+Q4729754
@@ Property / cites work: Q4729754 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XXII. Irrelevant vertices in linkage problems
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XXI. graphs with unique linkages
@@ Property / cites work: Graph minors. XXI. graphs with unique linkages / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors XXIII. Nash-Williams' immersion conjecture
+Normal rank
@@ Property / cites work @@
+The structure of graphs not admitting a fixed immersion
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:395009

Latest revision as of 06:37, 7 July 2024

scientific article; zbMATH DE number 6065667

Effective Computation of Immersion Obstructions for Unions of Graph Classes

Language	Label	Description	Also known as
English	Effective computation of immersion obstructions for unions of graph classes	scientific article; zbMATH DE number 6065667	Effective Computation of Immersion Obstructions for Unions of Graph Classes