| Output-sensitive algorithms for computing nearest-neighbour decision boundaries D Bremner, E Demaine, J Erickson, J Iacono, S Langerman, P Morin, ... Discrete & Computational Geometry 33, 593-604, 2005 | 269 | 2005 |
| Results of the first international contest on evolutionary optimisation (1st ICEO) H Bersini, M Dorigo, S Langerman, G Seront, L Gambardella Proceedings of IEEE International Conference on Evolutionary Computation …, 1996 | 171 | 1996 |
| Facility location problems in the plane based on reverse nearest neighbor queries S Cabello, JM Díaz-Báñez, S Langerman, C Seara, I Ventura European Journal of Operational Research 202 (1), 99-106, 2010 | 98 | 2010 |
| Covering things with things S Langerman, P Morin Discrete & Computational Geometry 33, 717-729, 2005 | 79 | 2005 |
| Optimization in arrangements S Langerman, W Steiger Annual Symposium on Theoretical Aspects of Computer Science, 50-61, 2003 | 66 | 2003 |
| Necklaces, Convolutions, and X+Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... Algorithmica 69 (2), 294-314, 2014 | 64 | 2014 |
| Space–time trade-offs for stack-based algorithms L Barba, M Korman, S Langerman, K Sadakane, RI Silveira Algorithmica 72, 1097-1129, 2015 | 63 | 2015 |
| Retroactive data structures ED Demaine, J Iacono, S Langerman ACM Transactions on Algorithms (TALG) 3 (2), 13-es, 2007 | 62 | 2007 |
| Algorithms for computing geometric measures of melodic similarity G Aloupis, T Fevens, S Langerman, T Matsui, A Mesa, Y Nunez, ... Computer Music Journal, 67-76, 2006 | 61 | 2006 |
| Necklaces, Convolutions, and X + Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... European Symposium on Algorithms, 160-171, 2006 | 60 | 2006 |
| Algorithms for bivariate medians and a Fermat–Torricelli problem for lines G Aloupis, S Langerman, M Soss, G Toussaint Computational Geometry 26 (1), 69-79, 2003 | 59 | 2003 |
| Dynamic optimality for skip lists and B-trees P Bose, K Douïeb, S Langerman Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 58 | 2008 |
| The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ... Algorithmica 59, 129-144, 2011 | 55 | 2011 |
| Output-sensitive algorithms for Tukey depth and related problems D Bremner, D Chen, J Iacono, S Langerman, P Morin Statistics and Computing 18, 259-266, 2008 | 53 | 2008 |
| Online graph exploration algorithms for cycles and trees by multiple searchers Y Higashikawa, N Katoh, S Langerman, S Tanigawa Journal of Combinatorial Optimization 28, 480-495, 2014 | 49 | 2014 |
| Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D PK Agarwal, R Klein, C Knauer, S Langerman, P Morin, M Sharir, M Soss Discrete & Computational Geometry 39 (1-3), 17-37, 2008 | 48 | 2008 |
| Proximity graphs: E, δ, Δ, χ and ω P Bose, V Dujmović, F Hurtado, J Iacono, S Langerman, H Meijer, ... International Journal of Computational Geometry & Applications 22 (05), 439-469, 2012 | 46 | 2012 |
| Cache-oblivious dynamic dictionaries with update/query tradeoffs GS Brodal, ED Demaine, JT Fineman, J Iacono, S Langerman, JI Munro Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 46 | 2010 |
| Linear reconfiguration of cube-style modular robots G Aloupis, S Collette, M Damian, ED Demaine, R Flatland, S Langerman, ... Computational Geometry 42 (6-7), 652-663, 2009 | 46 | 2009 |
| Dynamic graph coloring L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ... Algorithmica 81, 1319-1341, 2019 | 45 | 2019 |
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
