| Publication | Date of Publication | Type |
|---|
Approximation algorithms for the freeze tag problem inside polygons Transactions on Combinatorics | 2026-02-10 | Paper |
\(m\)-watchmen's routes in minbar and generalized minbar polygons Computational Geometry | 2026-01-22 | Paper |
A linear-time approximation algorithm for the minimum-length geometric embedding of trees Optimization | 2025-05-16 | Paper |
Hamiltonian (s, t)-paths in solid supergrid graphs Computational and Applied Mathematics | 2024-04-30 | Paper |
The longest path problem in odd-sized O-shaped grid graphs International Journal of Foundations of Computer Science | 2024-04-24 | Paper |
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes Optimization Methods & Software | 2023-07-24 | Paper |
The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2023-05-08 | Paper |
Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time Applied Mathematics and Computation | 2022-09-21 | Paper |
Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs Discrete Optimization | 2020-02-24 | Paper |
Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs Optimization Methods & Software | 2019-06-12 | Paper |
Separating bichromatic point sets by minimal triangles with a fixed angle International Journal of Foundations of Computer Science | 2017-09-08 | Paper |
A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole Theoretical Computer Science | 2017-08-24 | Paper |
Entanglement of photon-added nonlinear coherent states via a beam splitter Reports on Mathematical Physics | 2017-06-30 | Paper |
Optimal point-set embedding of wheel graphs and a sub-class of 3-trees Japan Journal of Industrial and Applied Mathematics | 2017-05-29 | Paper |
An O(n^2) algorithm for the limited-capacity many-to-many point matching in one dimension Algorithmica | 2016-10-21 | Paper |
Planar embedding of trees on point sets without the general position assumption Turkish Journal of Mathematics | 2016-07-07 | Paper |
An approximation algorithm for the longest path problem in solid grid graphs Optimization Methods & Software | 2016-06-29 | Paper |
A limited memory quasi-Newton trust-region method for box constrained optimization Journal of Computational and Applied Mathematics | 2016-04-18 | Paper |
An approximation algorithm for the longest cycle problem in solid grid graphs Discrete Applied Mathematics | 2016-04-07 | Paper |
Hamiltonian paths in L-shaped grid graphs Theoretical Computer Science | 2016-02-26 | Paper |
Constrained point set embedding of a balanced binary tree International Journal of Foundations of Computer Science | 2015-07-06 | Paper |
An \(O(1)\)-approximation algorithm for the 2-dimensional geometric freeze-tag problem Information Processing Letters | 2015-05-21 | Paper |
| Unit-length embedding of cycles and paths on grid graphs | 2014-10-09 | Paper |
A PTAS for geometric 2-FTP Information Processing Letters | 2014-08-28 | Paper |
Hamiltonian paths in some classes of grid graphs Journal of Applied Mathematics | 2012-08-06 | Paper |
A linear-time algorithm for the longest path problem in rectangular grid graphs Discrete Applied Mathematics | 2012-03-19 | Paper |
Planar straight-line point-set embedding of trees with partial embeddings Information Processing Letters | 2012-03-12 | Paper |
Minimum height path partitioning of trees Scientia Iranica. Transactions D: Computer Science & Engineering, Electrical Engineering | 2011-07-25 | Paper |
Drawing complete binary trees inside rectilinear polygons International Journal of Computer Mathematics | 2011-01-20 | Paper |
Approximation Algorithms for Edge-Covering Problem Communications in Computer and Information Science | 2009-05-20 | Paper |
| Drawing free trees inside simple polygons using polygon skeleton | 2006-06-23 | Paper |
How to draw free trees inside bounded rectilinear polygons International Journal of Computer Mathematics | 2005-02-28 | Paper |