Follow
Hugo A. Akitaya
Hugo A. Akitaya
Assistant Professor of Computer Science, University of Massachusetts Lowell
Verified email at uml.edu - Homepage
Title
Cited by
Cited by
Year
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
HA Akitaya, EM Arkin, M Damian, ED Demaine, V Dujmović, R Flatland, ...
Algorithmica 83, 1316-1351, 2021
412021
Box pleating is hard
HA Akitaya, KC Cheung, ED Demaine, T Horiyama, TC Hull, JS Ku, ...
Discrete and Computational Geometry and Graphs: 18th Japan Conference …, 2016
352016
Recognizing weak embeddings of graphs
HA Akitaya, R Fulek, CD Tóth
ACM Transactions on Algorithms (TALG) 15 (4), 1-27, 2019
232019
Rigid foldability is NP-hard
H Akitaya, ED Demaine, T Horiyama, TC Hull, JS Ku, T Tachi
arXiv preprint arXiv:1812.01160, 2018
232018
Robot development and path planning for indoor ultraviolet light disinfection
J Conroy, C Thierauf, P Rule, E Krause, H Akitaya, A Gonczi, M Korman, ...
2021 IEEE International Conference on Robotics and Automation (ICRA), 7795-7801, 2021
222021
Recognizing weakly simple polygons
HA Akitaya, G Aloupis, J Erickson, CD Tóth
Discrete & Computational Geometry 58, 785-821, 2017
212017
Simple folding is really hard
HA Akitaya, ED Demaine, JS Ku
Journal of Information Processing 25, 580-589, 2017
212017
Distance measures for embedded graphs
HA Akitaya, M Buchin, B Kilgus, S Sijben, C Wenk
Computational Geometry 95, 101743, 2021
192021
Characterizing universal reconfigurability of modular pivoting robots
HA Akitaya, ED Demaine, A Gonczi, DH Hendrickson, A Hesterberg, ...
arXiv preprint arXiv:2012.07556, 2020
162020
Reconfiguration of connected graph partitions
HA Akitaya, MD Jones, M Korman, O Korten, C Meierfrankenfeld, ...
Journal of Graph Theory 102 (1), 35-66, 2023
122023
Compacting squares: Input-sensitive in-place reconfiguration of sliding squares
HA Akitaya, ED Demaine, M Korman, I Kostitsyna, I Parada, W Sonke, ...
arXiv preprint arXiv:2105.07997, 2021
122021
How to fit a tree in a box
HA Akitaya, M Löffler, I Parada
Graphs and Combinatorics 38 (5), 155, 2022
92022
Reconfiguration of connected graph partitions via recombination
HA Akitaya, M Korman, O Korten, DL Souvaine, CD Tóth
Theoretical Computer Science 923, 13-26, 2022
92022
Multi-colored spanning graphs
HA Akitaya, M Löffler, CD Tóth
International Symposium on Graph Drawing and Network Visualization, 81-93, 2016
92016
Generating folding sequences from crease patterns of flat-foldable origami
HA Akitaya, J Mitani, Y Kanamori, Y Fukui
ACM SIGGRAPH 2013 Posters, 1-1, 2013
92013
On the spanning and routing ratios of the directed Θ6-graph
HA Akitaya, A Biniaz, P Bose
Computational Geometry 105, 101881, 2022
72022
The k-Fréchet distance: How to walk your dog while teleporting
H Alves Akitaya, M Buchin, L Ryvkin, J Urhausen
30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019
72019
Freeze tag awakening in 2d is NP-hard
Z Abel, HA Akitaya, J Yu
27th Fall Workshop on Computational Geometry, 105-107, 2017
72017
Upward partitioned book embeddings
HA Akitaya, ED Demaine, A Hesterberg, QC Liu
International Symposium on Graph Drawing and Network Visualization, 210-223, 2017
72017
Multi-colored spanning graphs
HA Akitaya, M Löffler, CD Tóth
Theoretical Computer Science 833, 11-25, 2020
62020
The system can't perform the operation now. Try again later.
Articles 1–20