Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
A. Akitaya, Hugo
99  Ergebnisse:
Personensuche X
?
1

The Minimum Moving Spanning Tree Problem:

Akitaya, Hugo A. ; Biniaz, Ahmad ; Bose, Prosenjit...
Journal of Graph Algorithms and Applications.  27 (2023)  1 - p. 1-18 , 2023
Link: https://doi.org/10.7155/..
 
?
2

Ununfoldable polyhedra with 6 vertices or 6 faces:

Akitaya, Hugo A. ; Demaine, Erik D. ; Eppstein, David..
Computational Geometry.  103 (2022)  - p. 101857 , 2022
Link: https://doi.org/10.1016/..
 
?
3

Circumscribing Polygons and Polygonizations for Disjoint Li..:

Akitaya, Hugo A. ; Korman, Matias ; Korten, Oliver...
Discrete & Computational Geometry.  68 (2022)  1 - p. 218-254 , 2022
Link: https://doi.org/10.1007/..
 
?
4

Reconfiguration of connected graph partitions:

Akitaya, Hugo A. ; Jones, Matthew D. ; Korman, Matias...
Journal of Graph Theory.  102 (2022)  1 - p. 35-66 , 2022
Link: https://doi.org/10.1002/..
 
?
5

On the spanning and routing ratios of the directed Θ6-graph:

Akitaya, Hugo A. ; Biniaz, Ahmad ; Bose, Prosenjit
Computational Geometry.  105-106 (2022)  - p. 101881 , 2022
Link: https://doi.org/10.1016/..
 
?
6

Reconfiguration of connected graph partitions via recombina..:

Akitaya, Hugo A. ; Korman, Matias ; Korten, Oliver..
Theoretical Computer Science.  923 (2022)  - p. 13-26 , 2022
Link: https://doi.org/10.1016/..
 
?
7

How to Fit a Tree in a Box:

Akitaya, Hugo A. ; Löffler, Maarten ; Parada, Irene
Graphs and Combinatorics.  38 (2022)  5 - p. , 2022
Link: https://doi.org/10.1007/..
 
?
8

Negative Instance for the Edge Patrolling Beacon Problem:

, In: Discrete and Computational Geometry, Graphs, and Games; Lecture Notes in Computer Science,
Abel, Zachary ; Akitaya, Hugo A. ; Demaine, Erik D.... - p. 28-35 , 2021
Link: https://doi.org/10.1007/..
 
?
9

On the Spanning and Routing Ratios of the Directed $$\varTh..:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Akitaya, Hugo A. ; Biniaz, Ahmad ; Bose, Prosenjit - p. 1-14 , 2021
Link: https://doi.org/10.1007/..
 
?
10

Reconfiguration of Connected Graph Partitions via Recombina..:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,
A. Akitaya, Hugo ; Korman, Matias ; Korten, Oliver.. - p. 61-74 , 2021
Link: https://doi.org/10.1007/..
 
?
11

Toward Unfolding Doubly Covered n-Stars:

, In: Discrete and Computational Geometry, Graphs, and Games; Lecture Notes in Computer Science,
Akitaya, Hugo A. ; Ballinger, Brad ; Damian, Mirela... - p. 122-135 , 2021
Link: https://doi.org/10.1007/..
 
?
12

Folding polyominoes with holes into a cube:

Aichholzer, Oswin ; Akitaya, Hugo A. ; Cheung, Kenneth C....
Computational Geometry.  93 (2021)  - p. 101700 , 2021
Link: https://doi.org/10.1016/..
 
?
13

Universal Reconfiguration of Facet-Connected Modular Robots..:

Akitaya, Hugo A. ; Arkin, Esther M. ; Damian, Mirela...
Algorithmica.  83 (2021)  5 - p. 1316-1351 , 2021
Link: https://doi.org/10.1007/..
 
?
14

Snipperclips: Cutting tools into desired polygons using the..:

Abel, Zachary ; Akitaya, Hugo ; Chiu, Man-Kwun...
Computational Geometry.  98 (2021)  - p. 101784 , 2021
Link: https://doi.org/10.1016/..
 
?
15

Distance measures for embedded graphs:

Akitaya, Hugo A. ; Buchin, Maike ; Kilgus, Bernhard..
Computational Geometry.  95 (2021)  - p. 101743 , 2021
Link: https://doi.org/10.1016/..
 
1-15