| Space–time trade-offs for stack-based algorithms L Barba, M Korman, S Langerman, K Sadakane, RI Silveira Algorithmica 72, 1097-1129, 2015 | 62 | 2015 |
| Gap-planar graphs SW Bae, JF Baffier, J Chun, P Eades, K Eickmeyer, L Grilli, SH Hong, ... Theoretical Computer Science 745, 36-52, 2018 | 48 | 2018 |
| 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, 836-859, 2016 | 44 | 2016 |
| Computing the visibility polygon using few variables L Barba, M Korman, S Langerman, RI Silveira International Symposium on Algorithms and Computation, 70-79, 2011 | 44 | 2011 |
| 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 | 43 | 2013 |
| Consistent digital rays J Chun, M Korman, M Nöllenburg, T Tokuyama Discrete & computational geometry 42 (3), 359-378, 2009 | 39 | 2009 |
| 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, 1316-1351, 2021 | 37 | 2021 |
| 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 | 34 | 2016 |
| Dynamic graph coloring L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ... Workshop on algorithms and data structures, 97-108, 2017 | 32 | 2017 |
| 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 | 31 | 2011 |
| 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 | 26 | 2017 |
| The geodesic diameter of polygonal domains S Bae, M Korman, Y Okamoto Algorithms–ESA 2010, 500-511, 2011 | 26 | 2011 |
| Robot development and path planning for indoor ultraviolet light disinfection J Conroy, C Thierauf, P Rule, E Krause, H Akitaya, A Gonczi, M Korman, ... 2021 IEEE International Conference on Robotics and Automation (ICRA), 7795-7801, 2021 | 22 | 2021 |
| 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 | 22 | 2014 |
| Coloring and guarding arrangements P Bose, J Cardinal, S Collette, F Hurtado, M Korman, S Langerman, ... Discrete Mathematics & Theoretical Computer Science 15 (Combinatorics), 2013 | 22 | 2013 |
| Dynamic graph coloring L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ... Algorithmica 81, 1319-1341, 2019 | 21 | 2019 |
| 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 | 21 | 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 | 20 | 2015 |
| Computing the geodesic centers of a polygonal domain SW Bae, M Korman, Y Okamoto Computational Geometry 77, 3-9, 2019 | 19 | 2019 |
| Theta-3 is connected O Aichholzer, SW Bae, L Barba, P Bose, M Korman, A Van Renssen, ... Computational geometry 47 (9), 910-917, 2014 | 19 | 2014 |
André van RenssenUniversity of Sydney在 sydney.edu.au 的电子邮件经过验证
