Pages that link to "Item:Q3057619"
From MaRDI portal
The following pages link to Milling a Graph with Turn Costs: A Parameterized Complexity Perspective (Q3057619):
Displaying 7 items.
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs (Q2115888) (← links)
- 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids (Q2154081) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids (Q6107029) (← links)
- The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs (Q6113877) (← links)