Hugo Alves Akitaya

Hugo Alves Akitaya
hugo (underscore) akitaya (at) uml (dot) edu

I am currently an Assistant Professor at the University of Massachusetts Lowell in the Computer Science Department. Previously, I was a postdoctoral scholar at Carleton University advised by Prosenjit Bose, and before at Tufts University advised by Diane Souvaine. I completed my Ph.D. in Computer Science at Tufts University, M.Eng. at Tsukuba University and B.Eng. at the University of Brasília. Here is my CV not up to date =(
Last Updated Oct 1st 2021.

Teaching

COMP 5030 (Algorithms), Fall 2021.
COMP 5800 (Computational Geometry), Spring 2021.
Tufts University Comp 160 (Algorithms), Fall 2018.

Research

My main research interests are computational geometry and algorithms. I am specially interested in problems involving reconfiguration and folding.

My co-authors are: Zachary Abel, Greg Aloupis, Cordelia Avery, Nadia Benbernou, Joseph Bergeron, Kenny Cheung, Erik Demaine, Martin Demaine, Jeff Erickson, Yukio Fukui, Radoslav Fulek, Adam Hesterberg, Takashi Horiyama, Tom Hull, Ferran Hurtado, Rajasekhar Inkulu, Matthew D. Jones, Yoshihiro Kanamori, Carla Koike, Justin Kopinsky, Jason Ku, Quanquan C. Liu, Maarten Löffler, Jayson Lynch, Jun Mitani, Joseph S. B. Mitchel, Torrie L. Nichols, Irene Parada, Anika Rounds, Gregory A. Sandoval, Diane Souvaine, David Stalfa, Tomohiro Tachi, Csaba Tóth, Ryuhei Uehara, Charles R. Winston, Jingjin Yu.

Publications

How to Fit a Tree in a Box.
- Hugo A. Akitaya, Maarten Löffler, and Irene Parada.
- To appear in Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018).

Maximum Area Axis-Aligned Square Packings.
- Hugo A. Akitaya, Matthew D. Jones, David Stalfa and Csaba D. Tóth.
- To appear in Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science.
- A full version can be found on arXiv.

Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs.
- Hugo A. Akitaya, R. Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth and Charles R. Winston.
- Paper at the FWCG 2016.
- In Proceedings of WALCOM 2017.
- The journal version was published in the special issue of Theoretical Computer Science (Jun 2018).
- A full version can be found on arXiv.

Perfect Polygons.
- Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Joseph S. B. Mitchel and David Stalfa.
- Paper at FWCG 2017.

Freeze Tag Awakening in 2D is NP-hard.
- Zachary Abel, Hugo A. Akitaya and Jingjin Yu.
- Paper at FWCG 2017.

Recognizing Weak Embeddings of Graphs.
- Hugo A. Akitaya, Radoslav Fulek and Csaba D. Tóth.
- In Proceedings of SODA 2018.
- A full version can be found on arXiv.

Upward Partitioned Book Embeddings.
- Hugo Akitaya, Erik Demaine, Adam Hesterberg and Quanquan Liu.
- In Proceedings of GD 2017.
- A full version can be found on arXiv.

Flattening Polygonal Linkages via Uniform Angular Motion.
- Hugo Akitaya, Matthew D. Jones, Gregory A. Sandoval, Diane L. Souvaine, David Stalfa, Csaba D. Tóth.
- Poster at GD 2017.

Infinite All-Layers Simple Foldability.
- Hugo Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky and Jason S. Ku.
- Paper at JCDCG³ 2016.

Recognizing Weakly Simple Polygons.
- Hugo Akitaya, Greg Aloupis, Jeff Erickson, and Csaba D. Tóth.
- Paper at SoCG 2016.
- The journal version was published in the special issue of DCG (Aug 2017).
- A full version can be found on arXiv.

Simple Folding is Really Hard.
- Hugo Akitaya, Erik D. Demaine and Jason S. Ku.
- Paper at JCDCG³ 2016.
- The journal version was published in the special issue of IPSJ JIP (Aug 2017).

Pachinko.
- Hugo Akitaya, Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason Ku and Jayson Lynch.
- The journal version was published in a special issue of CGTA (Jul 2017).
- A full version can be found on arXiv.

Freeze Tag Awakening in Euclidean Spaces.
- Hugo Akitaya and Jingjin Yu.
- Paper at the FWCG 2016.

Reconstruction of Weakly Simple Polygons from their Edges.
- Hugo Akitaya and Csaba Toth.
- In Proceedings of ISAAC 2016.
- A full version can be found on arXiv.

Multi-Colored Spanning Graphs.
- Hugo Akitaya, Maarten Löffler and Csaba Tóth.
- In Proceedings of GD 2016.
- A full version can be found on arXiv.

Trash Compaction.
- Hugo Akitaya, Greg Aloupis, Maarten Löffler, and Anika Rounds.
- Paper in EuroCG 2016.

Box Pleating is Hard.
- Hugo Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, and Ryuhei Uehara.
- In Proceedings of JCDCG² 2015.

Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity.
- Hugo Akitaya, Jonathan Castello, Yauheniya Lahoda, Anika Rounds and Csaba D. Tóth.
- Poster at Graph Drawing and Network Visualization 2015.
- Paper at the Fall Workshop on Computational Geometry 2015.

Unfolding Simple Folds from Crease Patterns.
- Hugo Akitaya, Jun Mitani, Yoshihiro Kanamori, and Yukio Fukui.
- Book chapter at Origami⁶: II. Technology, Art, Education.

Simple Folding is Strongly NP-Complete.
- Hugo Akitaya, Erik D. Demaine and Jason S. Ku.
- Paper at the Fall Workshop on Computational Geometry 2014.

Folding Sequences from Crease Patterns of Flat-Foldable Origami.
- Hugo Akitaya, Jun Mitani, Yoshihiro Kanamori and Yukio Fukui.
- Poster at ACM SIGGRAPH 2013.
- Paper at JSST 2013.

Honors and Awards

Recipient of the Loevner Fellowship for the 2016-2017 academic year.

Recipient of LASPAU-adminitrated scholarship (Science without Borders) 2014-2018.

Outstanding Presentation Award at International Conference on Simulation Technology (JSST2013), Tokyo Japan.

ACM Student Research Competition, 1st Place at SIGGRAPH 2013, Anaheim CA.

MEXT scholarship awarded by the Japanese Government. (2011-2014)

Outstanding Student Award by University of Brasília. (2011)

Non-Research

I also like to fold origami.