Pages that link to "Item:Q4033754"

The following pages link to On Linear Time Minor Tests with Depth-First Search (Q4033754):

Displaying 43 items.

• Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
• Parameterized and approximation algorithms for finding two disjoint matchings (Q300238) (← links)
• Subexponential parameterized algorithms (Q458457) (← links)
• A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
• Finding monotone paths in edge-ordered graphs (Q602679) (← links)
• A new algorithm for finding trees with many leaves (Q652536) (← links)
• An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
• Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
• Nonempty intersection of longest paths in series-parallel graphs (Q729758) (← links)
• Algorithms for long paths in graphs (Q884457) (← links)
• Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
• Algorithm for two disjoint long paths in 2-connected graphs (Q986559) (← links)
• Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
• A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
• On interval routing schemes and treewidth (Q1383155) (← links)
• Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
• On the complexity of rainbow coloring problems (Q1647834) (← links)
• Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
• Two edge-disjoint paths with length constraints (Q2330117) (← links)
• On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
• Narrow sieves for parameterized paths and packings (Q2396725) (← links)
• Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
• Safe Sets in Graphs: Graph Classes and Structural Parameters (Q2958317) (← links)
• Finding Two Edge-Disjoint Paths with Length Constraints (Q3181047) (← links)
• Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
• Mineurs d'arbres avec racines (Q4858839) (← links)
• A new algorithm for minimum spanning tree using depth-first-search in an undirected graph (Q4876371) (← links)
• Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
• A sublinear tester for outerplanarity (and other forbidden minors) with one-sided error (Q5002727) (← links)
• (Q5075790) (← links)
• Going Far from Degeneracy (Q5130907) (← links)
• Spotting Trees with Few Leaves (Q5346548) (← links)
• Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (Q5458557) (← links)
• The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
• A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)
• Detours in directed graphs (Q6113279) (← links)
• Methods for determining cycles of a specific length in undirected graphs with edge weights (Q6181338) (← links)
• Approximating long cycle above Dirac's guarantee (Q6586667) (← links)