The following pages link to Alireza Bagheri (Q248940):
Displaying 29 items.
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
- An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension (Q329283) (← links)
- A PTAS for geometric 2-FTP (Q402355) (← links)
- Hamiltonian paths in some classes of grid graphs (Q442933) (← links)
- (Q555533) (redirect page) (← links)
- Minimum height path partitioning of trees (Q555536) (← links)
- Planar straight-line point-set embedding of trees with partial embeddings (Q763547) (← links)
- A linear-time algorithm for the longest path problem in rectangular grid graphs (Q765359) (← links)
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983) (← links)
- An \(O(1)\)-approximation algorithm for the 2-dimensional geometric freeze-tag problem (Q2345867) (← links)
- Entanglement of photon-added nonlinear coherent states via a beam splitter (Q2361280) (← links)
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees (Q2396907) (← 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)
- An approximation algorithm for the longest path problem in solid grid graphs (Q2815541) (← links)
- Drawing complete binary trees inside rectilinear polygons (Q3066961) (← links)
- Approximation Algorithms for Edge-Covering Problem (Q3628568) (← links)
- How to draw free trees inside bounded rectilinear polygons (Q4652864) (← links)
- Constrained Point Set Embedding of a Balanced Binary Tree (Q5261607) (← links)
- Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle (Q5357503) (← links)
- Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
- (Q5474000) (← links)
- Planar embedding of trees on point sets without the general position assumption (Q5740001) (← 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)
- The longest path problem in odd-sized \(O\)-shaped grid graphs (Q6492015) (← links)
- Hamiltonian (s, t)-paths in solid supergrid graphs (Q6495481) (← links)
