Pages that link to "Item:Q3569902"
From MaRDI portal
The following pages link to Faster Parameterized Algorithms for Minor Containment (Q3569902):
Displaying 7 items.
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- Square roots of minor closed graph classes (Q2442205) (← links)
- (Q2857427) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
