| Handbook of theoretical computer science (vol. A) algorithms and complexity J Van Leeuwen Mit Press, 1991 | 1385* | 1991 |
| Maintenance of configurations in the plane MH Overmars, J Van Leeuwen Journal of computer and System Sciences 23 (2), 166-204, 1981 | 672 | 1981 |
| Worst-case analysis of set union algorithms RE Tarjan, J Van Leeuwen Journal of the ACM (JACM) 31 (2), 245-281, 1984 | 637 | 1984 |
| Interval routing J Van Leeuwen, RB Tan The Computer Journal 30 (4), 298-307, 1987 | 355 | 1987 |
| Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193-204, 2004 | 244* | 2004 |
| The complexity ofwirerouting and finding minimum area layouts for arbitrary VLSIcircuits MR Kramer, J Van Leeuwen Adv. Comput. Res 2, 129-146, 1984 | 244 | 1984 |
| Computer science today: recent trends and developments JV Leeuwen, J Hartmanis, G Goos Springer-Verlag, 1995 | 225 | 1995 |
| On the Construction of Huffman Trees. J Van Leeuwen ICALP, 382-410, 1976 | 200 | 1976 |
| Alan Turing: His work and impact SB Cooper, J Van Leeuwen Elsevier, 2013 | 162 | 2013 |
| The Turing machine paradigm in contemporary computing J Van Leeuwen, J Wiedermann Mathematics unlimited—2001 and beyond, 1139-1155, 2001 | 155 | 2001 |
| Maintenance of transitive closures and transitive reductions of graphs JA La Poutré, J Van Leeuwen International Workshop on Graph-Theoretic Concepts in Computer Science, 106-120, 1987 | 149 | 1987 |
| Dynamic multi-dimensional data structures based on quad-and k—d trees MH Overmars, J Van Leeuwen Acta Informatica 17 (3), 267-285, 1982 | 135 | 1982 |
| Worst-case optimal insertion and deletion methods for decomposable searching problems MH Overmars, J Van Leeuwen Information Processing Letters 12 (4), 168-173, 1981 | 133 | 1981 |
| Routing with compact routing tables J van Leeuwen, RB Tan Unknown Publisher, 1983 | 128 | 1983 |
| Diameter increase caused by edge deletion AA Schoone, HL Bodlaender, J Van Leeuwen Journal of Graph Theory 11 (3), 409-427, 1987 | 126 | 1987 |
| Viewpoint research evaluation for computer science B Meyer, C Choppy, J Staunstrup, J Van Leeuwen Communications of the ACM 52 (4), 31-34, 2009 | 117 | 2009 |
| Linear interval routing EM Bakker, J Van Leeuwen, RB Tan Algorithms review 2 (2), 45-61, 1991 | 107 | 1991 |
| The measure problem for rectangular ranges in d-space J van Leeuwen, D Wood Journal of Algorithms 2 (3), 282-300, 1981 | 85 | 1981 |
| Computational complexity of norm-maximization HL Bodlaender, P Gritzmann, V Klee, J Van Leeuwen Combinatorica 10, 203-225, 1990 | 80 | 1990 |
| Prefix routing schemes in dynamic networks EM Bakker, J van Leeuwen, RB Tan Computer Networks and ISDN Systems 26 (4), 403-421, 1993 | 76 | 1993 |
Jiri WiedermannInsitute of Computer Science, Czech Academy of SciencesVerified email at cs.cas.cz
