Matias Korman
Matias Korman
Tufts University
Dirección de correo verificada de dais.is.tohoku.ac.jp - Página principal
TítuloCitado porAño
Space–time trade-offs for stack-based algorithms
L Barba, M Korman, S Langerman, K Sadakane, RI Silveira
Algorithmica 72 (4), 1097-1129, 2015
552015
Memory-constrained algorithms for simple polygons
T Asano, K Buchin, M Buchin, M Korman, W Mulzer, G Rote, A Schulz
Computational Geometry 46 (8), 959-969, 2013
402013
Computing the visibility polygon using few variables
L Barba, M Korman, S Langerman, RI Silveira
International Symposium on Algorithms and Computation, 70-79, 2011
382011
Consistent digital rays
J Chun, M Korman, M Nöllenburg, T Tokuyama
Discrete & computational geometry 42 (3), 359-378, 2009
302009
A linear-time algorithm for the geodesic center of a simple polygon
HK Ahn, L Barba, P Bose, JL De Carufel, M Korman, E Oh
Discrete & computational geometry 56 (4), 836-859, 2016
252016
Reprint of: Memory-constrained algorithms for simple polygons
T Asano, K Buchin, M Buchin, M Korman, W Mulzer, G Rote, A Schulz
Computational Geometry 47 (3), 469-479, 2014
212014
Covering points by disjoint boxes with outliers
HK Ahn, SW Bae, ED Demaine, ML Demaine, SS Kim, M Korman, ...
Computational Geometry 44 (3), 178-190, 2011
21*2011
Hanabi is np-hard, even for cheaters who look at their cards
JF Baffier, MK Chiu, Y Diez, M Korman, V Mitsou, A Van Renssen, ...
arXiv preprint arXiv:1603.01911, 2016
192016
Dynamic graph coloring
L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ...
Workshop on Algorithms and Data Structures, 97-108, 2017
172017
The geodesic diameter of polygonal domains
S Bae, M Korman, Y Okamoto
Algorithms–ESA 2010, 500-511, 2011
172011
Coloring and guarding arrangements
P Bose, J Cardinal, S Collette, F Hurtado, M Korman, S Langerman, ...
arXiv preprint arXiv:1205.5162, 2012
162012
Time–space trade-offs for triangulations and Voronoi diagrams
M Korman, W Mulzer, A Van Renssen, M Roeloffzen, P Seiferth, Y Stein
Computational Geometry 73, 35-45, 2018
152018
Computing the L1 geodesic diameter and center of a simple polygon in linear time
SW Bae, M Korman, Y Okamoto, H Wang
Computational Geometry 48 (6), 495-505, 2015
142015
New results on stabbing segments with a polygon
JM Díaz-Báñez, M Korman, P Pérez-Lantero, A Pilz, C Seara, RI Silveira
Computational geometry 48 (1), 14-29, 2015
142015
Algorithms for computing the maximum weight region decomposable into elementary shapes
J Chun, R Kasai, M Korman, T Tokuyama
International Symposium on Algorithms and Computation, 1166-1174, 2009
142009
Colored spanning graphs for set visualization
F Hurtado, M Korman, M van Kreveld, M Löffler, V Sacristán, RI Silveira, ...
International Symposium on Graph Drawing, 280-291, 2013
132013
All farthest neighbors in the presence of highways and obstacles
SW Bae, M Korman, T Tokuyama
International Workshop on Algorithms and Computation, 71-82, 2009
122009
Computing the geodesic centers of a polygonal domain
SW Bae, M Korman, Y Okamoto
Computational Geometry 77, 3-9, 2019
112019
Packing plane spanning trees and paths in complete geometric graphs
O Aichholzer, T Hackl, M Korman, M Van Kreveld, M Löffler, A Pilz, ...
Information Processing Letters 124, 35-41, 2017
112017
Geodesic order types
O Aichholzer, M Korman, A Pilz, B Vogtenhuber
Algorithmica 70 (1), 112-128, 2014
112014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20