Dynamic programming for graphs on surfaces (Q5501962): Difference between revisions

@@ Property / OpenAlex ID @@
+W1826939887
@@ Property / OpenAlex ID: W1826939887 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Parameterized Algorithms for Minor Containment
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
+Normal rank
@@ Property / cites work @@
+Q3795218
@@ Property / cites work: Q3795218 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+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 @@
+The Bidimensional Theory of Bounded-Genus Graphs
@@ Property / cites work: The Bidimensional Theory of Bounded-Genus Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithms
@@ Property / cites work: Subexponential Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579494
@@ Property / cites work: Q3579494 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471349
@@ Property / cites work: Q4471349 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549563
@@ Property / cites work: Q3549563 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
+Normal rank
@@ Property / cites work @@
+On self duality of pathwidth in polyhedral graph embeddings
+Normal rank
@@ Property / cites work @@
+Computing Vertex Connectivity: New Bounds from Old Techniques
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q5365080
@@ Property / cites work: Q5365080 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365079
@@ Property / cites work: Q5365079 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Graph minors. XII: Distance on a surface
@@ Property / cites work: Graph minors. XII: Distance on a surface / 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 @@
+Asymptotic enumeration of non-crossing partitions on surfaces
+Normal rank
@@ Property / cites work @@
+Dynamic Programming for H-minor-free Graphs
@@ Property / cites work: Dynamic Programming for H-minor-free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+The graph genus problem is NP-complete
@@ Property / cites work: The graph genus problem is NP-complete / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5501962