Suivre
Matias Korman
Matias Korman
Siemens EDA
Adresse e-mail validée de mentor.com - Page d'accueil
Titre
Citée par
Citée par
Année
Space–time trade-offs for stack-based algorithms
L Barba, M Korman, S Langerman, K Sadakane, RI Silveira
Algorithmica 72 (4), 1097-1129, 2015
632015
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
422013
Computing the visibility polygon using few variables
L Barba, M Korman, S Langerman, RI Silveira
International Symposium on Algorithms and Computation, 70-79, 2011
422011
Consistent digital rays
J Chun, M Korman, M Nöllenburg, T Tokuyama
Discrete & computational geometry 42 (3), 359-378, 2009
372009
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
332016
Gap-planar graphs
SW Bae, JF Baffier, J Chun, P Eades, K Eickmeyer, L Grilli, SH Hong, ...
Theoretical Computer Science 745, 36-52, 2018
322018
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
302016
Dynamic graph coloring
L Barba, J Cardinal, M Korman, S Langerman, A Renssen, M Roeloffzen, ...
Workshop on Algorithms and Data Structures, 97-108, 2017
282017
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
282011
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
222014
Coloring and guarding arrangements
P Bose, J Cardinal, S Collette, F Hurtado, M Korman, S Langerman, ...
arXiv preprint arXiv:1205.5162, 2012
222012
The geodesic diameter of polygonal domains
S Bae, M Korman, Y Okamoto
Algorithms–ESA 2010, 500-511, 2011
212011
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
202017
Universal reconfiguration of facet-connected modular robots by pivots: the O (1) musketeers
HA Akitaya, EM Arkin, M Damian, ED Demaine, V Dujmović, R Flatland, ...
Algorithmica 83 (5), 1316-1351, 2021
192021
Balanced partitions of 3-colored geometric sets in the plane
S Bereg, F Hurtado, M Kano, M Korman, D Lara, C Seara, RI Silveira, ...
Discrete Applied Mathematics 181, 21-32, 2015
182015
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
152015
Theta-3 is connected
O Aichholzer, SW Bae, L Barba, P Bose, M Korman, A Van Renssen, ...
Computational geometry 47 (9), 910-917, 2014
152014
Colored spanning graphs for set visualization
F Hurtado, M Korman, M van Kreveld, M Löffler, V Sacristán, A Shioura, ...
Computational Geometry 68, 262-276, 2018
142018
Minimizing interference in ad hoc networks with bounded communication radius
M Korman
Information Processing Letters 112 (19), 748-752, 2012
142012
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20