| Exploring the role of visualization and engagement in computer science education TL Naps, G Rößling, V Almstrum, W Dann, R Fleischer, C Hundhausen, ... Working group reports from ITiCSE on Innovation and technology in computer …, 2002 | 1058 | 2002 |
| Evaluating the educational impact of visualization T Naps, S Cooper, B Koldehofe, C Leska, G Rößling, W Dann, ... Acm sigcse bulletin 35 (4), 124-136, 2003 | 249 | 2003 |
| On‐line scheduling revisited R Fleischer, M Wahl Journal of Scheduling 3 (6), 343-353, 2000 | 200 | 2000 |
| Order-preserving matching J Kim, P Eades, R Fleischer, SH Hong, CS Iliopoulos, K Park, SJ Puglisi, ... Theoretical Computer Science 525, 68-79, 2014 | 172 | 2014 |
| Episode matching G Das, R Fleischer, L Gasieniec, D Gunopulos, J Kärkkäinen Annual Symposium on Combinatorial Pattern Matching, 12-27, 1997 | 136 | 1997 |
| Low-resolution gait recognition J Zhang, J Pu, C Chen, R Fleischer IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 40 …, 2010 | 116 | 2010 |
| On the Bahncard problem R Fleischer Theoretical Computer Science 268 (1), 161-174, 2001 | 115 | 2001 |
| Tight bounds on maximal and maximum matchings T Biedl, ED Demaine, CA Duncan, R Fleischer, SG Kobourov Discrete Mathematics 285 (1-3), 7-15, 2004 | 110 | 2004 |
| Approximate motion planning and the complexity of the boundary of the union of simple geometric figures H Alt, R Fleischer, M Kaufmann, K Mehlhorn, S Näher, S Schirra, C Uhrig Proceedings of the sixth annual symposium on Computational geometry, 281-289, 1990 | 105 | 1990 |
| Datenstrukturen und Effiziente Algorithmen, Band 1: Sortieren und Suchen K Mehlhorn Teubner, 1986 | 99 | 1986 |
| Exploring an unknown graph efficiently R Fleischer, G Trippen European Symposium on Algorithms, 11-22, 2005 | 98 | 2005 |
| Efficient exact geometric computation made easy C Burnikel, R Fleischer, K Mehlhorn, S Schirra Proceedings of the fifteenth annual symposium on Computational geometry, 341-350, 1999 | 84 | 1999 |
| A strong and easily computable separation bound for arithmetic expressions involving radicals C Burnikel, R Fleischer, K Mehlhorn, S Schirra Algorithmica 27 (1), 87-99, 2000 | 71 | 2000 |
| Algorithm animation for teaching R Fleischer, L Kučera Software Visualization: International Seminar Dagstuhl Castle, Germany, May …, 2002 | 70 | 2002 |
| Online routing in convex subdivisions P Bose, A Brodnik, S Carlsson, ED Demaine, R Fleischer, A López-Ortiz, ... International Symposium on Algorithms and Computation, 47-59, 2000 | 69 | 2000 |
| Online scheduling revisited R Fleischer, M Wahl European Symposium on Algorithms, 202-210, 2000 | 69 | 2000 |
| Online routing in convex subdivisions P Bose, A Brodnik, S Carlsson, ED Demaine, R Fleischer, A López-Ortiz, ... International Journal of Computational Geometry & Applications 12 (04), 283-295, 2002 | 65 | 2002 |
| On simultaneous inner and outer approximation of shapes R Fleischer, K Mehlhorn, G Rote, E Welzl, C Yap Proceedings of the sixth annual symposium on Computational geometry, 216-224, 1990 | 63 | 1990 |
| Competitive online approximation of the optimal search ratio R Fleischer, T Kamphans, R Klein, E Langetepe, G Trippen SIAM Journal on Computing 38 (3), 881-898, 2008 | 60* | 2008 |
| A simple balanced search tree with O (1) worst-case update time R Fleischer International Journal of Foundations of Computer Science 7 (02), 137-149, 1996 | 60 | 1996 |
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
