Hugo A. Akitaya | DeepAI

AI Chat

Featured Co-authors

Erik D. Demaine
75 publications
David Eppstein
67 publications
Jayson Lynch
42 publications
Maarten Löffler
42 publications
Csaba D. Tóth
36 publications
Sandor P. Fekete
33 publications
Matias Korman
29 publications
Irina Kostitsyna
28 publications
Vida Dujmovic
25 publications
Oswin Aichholzer
25 publications
Anna Lubiw
24 publications

∙ 08/29/2023

When Can You Tile an Integer Rectangle with Integer Squares?

This paper characterizes when an m × n rectangle, where m and n are inte...

0 MIT CompGeom Group, et al. ∙

∙ 07/03/2023

Reconfiguration of Polygonal Subdivisions via Recombination

Motivated by the problem of redistricting, we study area-preserving reco...

0 Hugo A. Akitaya, et al. ∙

∙ 04/19/2023

Reconfiguration of 3D Pivoting Modular Robots

We study a new model of 3-dimensional modular self-reconfigurable robots...

0 Hugo A. Akitaya, et al. ∙

∙ 02/24/2022

Pushing Blocks by Sweeping Lines

We investigate the reconfiguration of n blocks, or "tokens", in the squa...

0 Hugo A. Akitaya, et al. ∙

∙ 03/10/2021

Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves

We study subtrajectory clustering under the Fréchet distance. Given one ...

0 Hugo A. Akitaya, et al. ∙

∙ 12/14/2020

Characterizing Universal Reconfigurability of Modular Pivoting Robots

We give both efficient algorithms and hardness results for reconfiguring...

0 Hugo A. Akitaya, et al. ∙

∙ 11/14/2020

Reconfiguration of Connected Graph Partitions via Recombination

Motivated by applications in gerrymandering detection, we study a reconf...

0 Hugo A. Akitaya, et al. ∙

∙ 06/01/2020

Negative Instance for the Edge Patrolling Beacon Problem

Can an infinite-strength magnetic beacon always “catch” an iron ball, wh...

0 Zachary Abel, et al. ∙

∙ 10/22/2019

Folding Polyominoes with Holes into a Cube

When can a polyomino piece of paper be folded into a unit cube? Prior wo...

0 Oswin Aichholzer, et al. ∙

∙ 10/13/2019

Face flips in origami tessellations

Given a flat-foldable origami crease pattern G=(V,E) (a straight-line dr...

0 Hugo A. Akitaya, et al. ∙

∙ 08/21/2019

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

We present the first universal reconfiguration algorithm for transformin...

0 Hugo A. Akitaya, et al. ∙

∙ 06/19/2019

Rock Climber Distance: Frogs versus Dogs

The classical measure of similarity between two polygonal chains in Eucl...

0 Hugo A. Akitaya, et al. ∙

∙ 03/17/2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments

Given a planar straight-line graph G=(V,E) in R^2, a circumscribing poly...

0 Hugo A. Akitaya, et al. ∙

∙ 03/06/2019

The k-Fréchet distance

We introduce a new distance measure for comparing polygonal chains: the ...

0 Hugo A. Akitaya, et al. ∙

∙ 02/27/2019

Reconfiguration of Connected Graph Partitions

Motivated by recent computational models for redistricting and detection...

0 Hugo A. Akitaya, et al. ∙

∙ 01/24/2019

Infinite All-Layers Simple Foldability

We study the problem of deciding whether a crease pattern can be folded ...

0 Hugo A. Akitaya, et al. ∙

∙ 12/21/2018

Distance Measures for Embedded Graphs

We introduce new distance measures for comparing embedded graphs based o...

0 Hugo A. Akitaya, et al. ∙

∙ 08/31/2018

How to Fit a Tree in a Box

We study compact straight-line embeddings of trees. We show that perfect...

0 Hugo A. Akitaya, et al. ∙

∙ 06/25/2018

Maximum Area Axis-Aligned Square Packings

Given a point set S={s_1,... , s_n} in the unit square U=[0,1]^2, an anc...

0 Hugo A. Akitaya, et al. ∙

∙ 09/26/2017

Recognizing Weak Embeddings of Graphs

We present an efficient algorithm for a problem in the interface between...

0 Hugo A. Akitaya, et al. ∙

∙ 08/22/2017

Upward Partitioned Book Embeddings

We analyze a directed variation of the book embedding problem when the p...

0 Hugo A. Akitaya, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world