The following pages link to (Q3549734):
Displayed 11 items.
- Algorithms for the edge-width of an embedded graph (Q419374) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Computing the shortest essential cycle (Q603870) (← links)
- Practical graph isomorphism. II. (Q2437295) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- Isomorphisms of maps on the sphere (Q4998745) (← links)
- Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable (Q6075759) (← links)
- Isomorphism Testing Parameterized by Genus and Beyond (Q6188514) (← links)