The following pages link to Computing and Combinatorics (Q5716972):
Displaying 16 items.
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- A local strategy for cleaning expanding cellular domains by simple robots (Q888433) (← links)
- The simple grid polygon exploration problem (Q2025057) (← links)
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983) (← links)
- A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (Q2399614) (← links)
- Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time (Q2673969) (← links)
- Exploring and Triangulating a Region by a Swarm of Robots (Q3088095) (← links)
- Inspecting a Set of Strips Optimally (Q3183473) (← links)
- An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
- Off-line exploration of rectangular cellular environments with a rectangular obstacle (Q5058395) (← links)
- Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
- Hamiltonian paths in \(L\)-shaped grid graphs (Q5964021) (← links)
- The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs (Q6102214) (← links)
- A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes (Q6175567) (← links)
- On-line exploration of rectangular cellular environments with a rectangular hole (Q6195347) (← links)
- Hamiltonian (s, t)-paths in solid supergrid graphs (Q6495481) (← links)
