Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Korman, Matias
250  Ergebnisse:
Personensuche X
?
1

Graphs with large total angular resolution:

Aichholzer, Oswin ; Korman, Matias ; Okamoto, Yoshio...
Theoretical Computer Science.  943 (2023)  - p. 73-88 , 2023
Link: https://doi.org/10.1016/..
 
?
2

Kinetic Geodesic Voronoi Diagrams in a Simple Polygon:

Korman, Matias ; van Renssen, André ; Roeloffzen, Marcel.
SIAM Journal on Discrete Mathematics.  37 (2023)  4 - p. 2276-2311 , 2023
Link: https://doi.org/10.1137/..
 
?
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

Distance Bounds for High Dimensional Consistent Digital Ray..:

Chiu, Man-Kwun ; Korman, Matias ; Suderland, Martin.
Discrete & Computational Geometry.  68 (2022)  3 - p. 902-944 , 2022
Link: https://doi.org/10.1007/..
 
?
6

Efficient segment folding is hard:

Horiyama, Takashi ; Klute, Fabian ; Korman, Matias...
Computational Geometry.  104 (2022)  - p. 101860 , 2022
Link: https://doi.org/10.1016/..
 
?
7

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/..
 
?
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

Rectilinear link diameter and radius in a rectilinear polyg..:

Arseneva, Elena ; Chiu, Man-Kwun ; Korman, Matias...
Computational Geometry.  92 (2021)  - p. 101685 , 2021
Link: https://doi.org/10.1016/..
 
?
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

Robot Development and Path Planning for Indoor Ultraviolet ..:

, In: 2021 IEEE International Conference on Robotics and Automation (ICRA),
Conroy, Jonathan ; Thierauf, Christopher ; Rule, Parker... - p. 7795-7801 , 2021
Link: https://doi.org/10.1109/..
 
?
12

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/..
 
?
13

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/..
 
?
14

Constrained routing between non-visible vertices:

Bose, Prosenjit ; Korman, Matias ; van Renssen, André.
Theoretical Computer Science.  861 (2021)  - p. 144-154 , 2021
Link: https://doi.org/10.1016/..
 
?
15

Routing in Histograms:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Chiu, Man-Kwun ; Cleve, Jonas ; Klost, Katharina... - p. 43-54 , 2020
Link: https://doi.org/10.1007/..
 
1-15