| Space–time trade-offs for stack-based algorithms L Barba, M Korman, S Langerman, K Sadakane, RI Silveira Algorithmica 72 (4), 1097-1129, 2015 | 57 | 2015 |
| 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 | 42 | 2013 |
| Computing the visibility polygon using few variables L Barba, M Korman, S Langerman, RI Silveira International Symposium on Algorithms and Computation, 70-79, 2011 | 41 | 2011 |
| Consistent digital rays J Chun, M Korman, M Nöllenburg, T Tokuyama Discrete & computational geometry 42 (3), 359-378, 2009 | 34 | 2009 |
| 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 | 26 | 2016 |
| 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 | 25* | 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 | 24 | 2016 |
| Gap-planar graphs SW Bae, JF Baffier, J Chun, P Eades, K Eickmeyer, L Grilli, SH Hong, ... Theoretical Computer Science 745, 36-52, 2018 | 21 | 2018 |
| Dynamic graph coloring L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ... Workshop on Algorithms and Data Structures, 97-108, 2017 | 21 | 2017 |
| 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 | 21 | 2014 |
| Coloring and guarding arrangements P Bose, J Cardinal, S Collette, F Hurtado, M Korman, S Langerman, ... arXiv preprint arXiv:1205.5162, 2012 | 18 | 2012 |
| The geodesic diameter of polygonal domains S Bae, M Korman, Y Okamoto Algorithms–ESA 2010, 500-511, 2011 | 18 | 2011 |
| 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 | 15 | 2018 |
| 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 | 15 | 2015 |
| 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 | 15 | 2015 |
| 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 | 14 | 2015 |
| 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 | 14 | 2009 |
| 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 | 13 | 2013 |
| 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 | 13 | 2009 |
| 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 | 12 | 2017 |
André van RenssenUniversity of SydneyAdresse e-mail validée de sydney.edu.au
