| 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 (4), 593-604, 2005 | 225 | 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 | 165 | 1996 |
| Covering things with things S Langerman, P Morin Discrete & Computational Geometry 33 (4), 717-729, 2005 | 66 | 2005 |
| Reverse facility location problems S Cabello, JM Díaz-Báñez, S Langerman, C Seara, I Ventura University of Ljubljana, Inst. of Mathematics, Physics and Mechanics …, 2006 | 63 | 2006 |
| 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 |
| Optimization in arrangements S Langerman, W Steiger Annual Symposium on Theoretical Aspects of Computer Science, 50-61, 2003 | 56 | 2003 |
| Algorithms for computing geometric measures of melodic similarity G Aloupis, T Fevens, S Langerman, T Matsui, A Mesa, Y Nunez, ... Computer Music Journal 30 (3), 67-76, 2006 | 54 | 2006 |
| 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 | 53 | 2010 |
| Retroactive data structures ED Demaine, J Iacono, S Langerman ACM Transactions on Algorithms (TALG) 3 (2), 13-es, 2007 | 52 | 2007 |
| 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 | 51 | 2003 |
| The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ... Algorithmica 59 (2), 129-144, 2011 | 49 | 2011 |
| Necklaces, Convolutions, and X + Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... European Symposium on Algorithms, 160-171, 2006 | 49 | 2006 |
| 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 | 47 | 2008 |
| Output-sensitive algorithms for Tukey depth and related problems D Bremner, D Chen, J Iacono, S Langerman, P Morin Statistics and Computing 18 (3), 259, 2008 | 45 | 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 (2), 480-495, 2014 | 43 | 2014 |
| Necklaces, Convolutions, and X+Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... Algorithmica 69 (2), 294-314, 2014 | 42 | 2014 |
| 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 | 42 | 2010 |
| 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), 17-37, 2008 | 41 | 2008 |
| 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 | 40 | 2009 |
| Computing the maximum detour and spanning ratio of planar paths, trees, and cycles S Langerman, P Morin, M Soss Annual Symposium on Theoretical Aspects of Computer Science, 250-261, 2002 | 35 | 2002 |
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
