Hugo Alves Akitaya

According to our database, Hugo Alves Akitaya authored at least 49 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Reconfiguration of connected graph partitions.

Hugo A. Akitaya, Matthew D. Jones, Matias Korman, Oliver Korten, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann, Csaba D. Tóth

J. Graph Theory, 2023

The Minimum Moving Spanning Tree Problem.

Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid

J. Graph Algorithms Appl., 2023

When Can You Tile an Integer Rectangle with Integer Squares?

MIT CompGeom Group, Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Adam C. Hesterberg, Jayson Lynch

CoRR, 2023

Complexity of Simple Folding of Mixed Orthogonal Crease Patterns.

Hugo A. Akitaya, Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo, Andy Tockman

CoRR, 2023

Reconfiguration of 3D Pivoting Modular Robots.

Hugo A. Akitaya, Frederick Stock

CoRR, 2023

Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves.

Frederik Brüning, Hugo A. Akitaya, Erin W. Chambers, Anne Driemel

Comput. Geom. Topol., 2023

Pushing Blocks by Sweeping Lines.

Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta

Comput. Geom. Topol., 2023

Realizability of Free Spaces of Curves.

Hugo A. Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin, Carola Wenk

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Reconfiguration of Polygonal Subdivisions via Recombination.

Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, Thomas Weighill

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Reconfiguration of connected graph partitions via recombination.

Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth

Theor. Comput. Sci., 2022

How to Fit a Tree in a Box.

Hugo A. Akitaya, Maarten Löffler, Irene Parada

Graphs Comb., 2022

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.

Hugo A. Akitaya, Matias Korman, Oliver Korten, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth

Discret. Comput. Geom., 2022

Ununfoldable polyhedra with 6 vertices or 6 faces.

Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara

Comput. Geom., 2022

On the spanning and routing ratios of the directed Θ₆-graph.

Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose

Comput. Geom., 2022

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares.

Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

Covering a Curve with Subtrajectories.

Hugo A. Akitaya, Frederik Brüning, Erin W. Chambers, Anne Driemel

CoRR, 2021

Distance measures for embedded graphs.

Hugo A. Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben, Carola Wenk

Comput. Geom., 2021

Folding polyominoes with holes into a cube.

Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt

Comput. Geom., 2021

Snipperclips: Cutting tools into desired polygons using themselves.

Zachary Abel, Hugo A. Akitaya, Man-Kwun Chiu, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jayson Lynch, André van Renssen, Marcel Roeloffzen

Comput. Geom., 2021

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.

Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán

Algorithmica, 2021

On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph.

Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Robot Development and Path Planning for Indoor Ultraviolet Light Disinfection.

Jonathan Conroy, Christopher Thierauf, Parker Rule, Evan A. Krause, Hugo Alves Akitaya, Andrei Gonczi, Matias Korman, Matthias Scheutz

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Characterizing Universal Reconfigurability of Modular Pivoting Robots.

Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Folding Points to a Point and Lines to a Line.

Hugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull, Christiane Schmidt

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Multi-colored spanning graphs.

Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth

Theor. Comput. Sci., 2020

Rigid foldability is NP-hard.

Hugo Alves Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi

J. Comput. Geom., 2020

Face flips in origami tessellations.

Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw

J. Comput. Geom., 2020

Infinite All-Layers Simple Foldability.

Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku

Graphs Comb., 2020

The reach of axis-aligned squares in the plane.

Hugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tóth

Discret. Optim., 2020

Escaping a Polygon.

Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jason S. Ku, Jayson Lynch

CoRR, 2020

2048 Without Merging.

Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Csaba D. Tóth

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Minimum weight connectivity augmentation for planar straight-line graphs.

Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston

Theor. Comput. Sci., 2019

Recognizing Weak Embeddings of Graphs.

Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth

ACM Trans. Algorithms, 2019

The k-Fréchet distance.

Hugo A. Akitaya, Maike Buchin, Leonie Ryvkin, Jérôme Urhausen

CoRR, 2019

Reconfiguration of Connected Graph Partitions.

Hugo A. Akitaya, Matthew D. Jones, Matias Korman, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann, Csaba D. Tóth

CoRR, 2019

The k-Fréchet Distance: How to Walk Your Dog While Teleporting.

Hugo Alves Akitaya, Maike Buchin, Leonie Ryvkin, Jérôme Urhausen

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.

Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Rock Climber Distance: Frogs versus Dogs.

Hugo Alves Akitaya, Leonie Ryvkin, Csaba D. Tóth

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Reconstruction of Weakly Simple Polygons from Their Edges.

Hugo A. Akitaya, Csaba D. Tóth

Int. J. Comput. Geom. Appl., 2018

Pachinko.

Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch

Comput. Geom., 2018

Maximum Area Axis-Aligned Square Packings.

Hugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tóth

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Toward Unfolding Doubly Covered n-Stars.

Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Irina Kostitsyna, Jason S. Ku, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Negative Instance for the Edge Patrolling Beacon Problem.

Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

2017

Simple Folding is Really Hard.

Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku

J. Inf. Process., 2017

Recognizing Weakly Simple Polygons.

Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth

Discret. Comput. Geom., 2017

Upward Partitioned Book Embeddings.

Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2015

Box Pleating is Hard.

Hugo Alves Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity.

Hugo Alves Akitaya, Jonathan Castello, Yauheniya Lahoda, Anika Rounds, Csaba D. Tóth

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2013

Generating folding sequences from crease patterns of flat-foldable origami.

Hugo A. Akitaya, Jun Mitani, Yoshihiro Kanamori, Yukio Fukui

Proceedings of the Special Interest Group on Computer Graphics and Interactive Techniques Conference, 2013