Hugo A. Akitaya

Cited by

	All	Since 2019
Citations	381	339
h-index	10	10
i10-index	11	10

100

20152016201720182019202020212022202320241 2 15 16 28 43 49 49 98 68

Public access

View all

26 articles

1 article

available

not available

Based on funding mandates

Co-authors

Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
Csaba D. TothCalifornia State University NorthridgeVerified email at csun.edu
Matias KormanSiemens EDAVerified email at mentor.com
Jason S. KuLecturer, Massachusetts Institute of TechnologyVerified email at mit.edu
Adam HesterbergHarvard SEASVerified email at seas.harvard.edu
Jayson LynchMITVerified email at mit.edu
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts UniversityVerified email at tufts.edu
Irene ParadaUPCVerified email at upc.edu
Maarten LöfflerComputer Science, Utrecht UniversityVerified email at cs.uu.nl
Maike BuchinRuhr-Universität BochumVerified email at rub.de
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyVerified email at jaist.ac.jp
Thomas C. HullAssociate Professor of Mathematics, Franklin & Marshall CollegeVerified email at fandm.edu
Tomohiro TachiProfessor, University of TokyoVerified email at idea.c.u-tokyo.ac.jp
Martin DemaineMITVerified email at mit.edu
Kenneth CheungNASA Ames Research CenterVerified email at nasa.gov
André van RenssenUniversity of SydneyVerified email at sydney.edu.au
Andrew GoncziPhD Candidate, Tufts UniversityVerified email at tufts.edu
Irina KostitsynaNASA Ames Research CenterVerified email at tue.nl
Matthew JonesPhD Student, Khoury CollegeVerified email at northeastern.edu
Yoshihiro KanamoriUniversity of TsukubaVerified email at cs.tsukuba.ac.jp

Hugo A. Akitaya

Assistant Professor of Computer Science, University of Massachusetts Lowell

Verified email at uml.edu - Homepage

computational geometry discrete geometry graph drawing algorithms origami


Title Sort by citations Sort by year Sort by 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	37	2021
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	35	2016
Recognizing weak embeddings of graphs HA Akitaya, R Fulek, CD Tóth ACM Transactions on Algorithms (TALG) 15 (4), 1-27, 2019	23	2019
Rigid foldability is NP-hard H Akitaya, ED Demaine, T Horiyama, TC Hull, JS Ku, T Tachi arXiv preprint arXiv:1812.01160, 2018	23	2018
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	22	2021
Recognizing weakly simple polygons HA Akitaya, G Aloupis, J Erickson, CD Tóth Discrete & Computational Geometry 58, 785-821, 2017	21	2017
Simple folding is really hard HA Akitaya, ED Demaine, JS Ku Journal of Information Processing 25, 580-589, 2017	21	2017
Distance measures for embedded graphs HA Akitaya, M Buchin, B Kilgus, S Sijben, C Wenk Computational Geometry 95, 101743, 2021	18	2021
Characterizing universal reconfigurability of modular pivoting robots HA Akitaya, ED Demaine, A Gonczi, DH Hendrickson, A Hesterberg, ... arXiv preprint arXiv:2012.07556, 2020	13	2020
Reconfiguration of connected graph partitions HA Akitaya, MD Jones, M Korman, O Korten, C Meierfrankenfeld, ... Journal of Graph Theory 102 (1), 35-66, 2023	12	2023
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	10	2021
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	9	2022
Multi-colored spanning graphs HA Akitaya, M Löffler, CD Tóth International Symposium on Graph Drawing and Network Visualization, 81-93, 2016	9	2016
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	9	2013
How to fit a tree in a box HA Akitaya, M Löffler, I Parada Graphs and Combinatorics 38 (5), 155, 2022	8	2022
On the spanning and routing ratios of the directed Θ6-graph HA Akitaya, A Biniaz, P Bose Computational Geometry 105, 101881, 2022	7	2022
Freeze tag awakening in 2d is NP-hard Z Abel, HA Akitaya, J Yu 27th Fall Workshop on Computational Geometry, 105-107, 2017	7	2017
Upward partitioned book embeddings HA Akitaya, ED Demaine, A Hesterberg, QC Liu International Symposium on Graph Drawing and Network Visualization, 210-223, 2017	7	2017
Multi-colored spanning graphs HA Akitaya, M Löffler, CD Tóth Theoretical Computer Science 833, 11-25, 2020	6	2020
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	6	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors