| Weisfeiler-lehman graph kernels N Shervashidze, P Schweitzer, EJ Leeuwen, K Mehlhorn, KM Borgwardt Journal of Machine Learning Research 12 (Sep), 2539-2561, 2011 | 2565 | 2011 |
| On the complexity of metric dimension J Díaz, O Pottonen, M Serna, EJ Van Leeuwen European Symposium on Algorithms, 419-430, 2012 | 75 | 2012 |
| Approximating geometric coverage problems T Erlebach, EJ van Leeuwen Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 62 | 2008 |
| Approximation algorithms for unit disk graphs EJ van Leeuwen International Workshop on Graph-Theoretic Concepts in Computer Science, 351-361, 2005 | 57 | 2005 |
| PTAS for weighted set cover on unit squares T Erlebach, EJ Van Leeuwen International Workshop on Randomization and Approximation Techniques in …, 2010 | 52 | 2010 |
| Network sparsification for Steiner problems on planar and bounded-genus graphs M Pilipczuk, M Pilipczuk, P Sankowski, EJ van Leeuwen Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on …, 2014 | 47 | 2014 |
| Optimization and approximation on systems of geometric objects EJ van Leeuwen | 45 | 2009 |
| Subexponential-time parameterized algorithm for Steiner tree on planar graphs M Pilipczuk, M Pilipczuk, P Sankowski, EJ van Leeuwen 30th International Symposium on Theoretical Aspects of Computer Science …, 2013 | 42 | 2013 |
| Independence and Efficient Domination on -free Graph D Lokshtanov, M Pilipczuk, EJ van Leeuwen arXiv preprint arXiv:1507.02163, 2015 | 41 | 2015 |
| Faster algorithms on branch and clique decompositions HL Bodlaender, EJ Van Leeuwen, JMM Van Rooij, M Vatshelle International Symposium on Mathematical Foundations of Computer Science, 174-185, 2010 | 37 | 2010 |
| Domination in geometric intersection graphs T Erlebach, EJ Van Leeuwen Latin American Symposium on Theoretical Informatics, 747-758, 2008 | 37 | 2008 |
| Complexity of metric dimension on planar graphs J Díaz, O Pottonen, M Serna, EJ van Leeuwen Journal of Computer and System Sciences 83 (1), 132-158, 2017 | 34 | 2017 |
| Domination when the stars are out D Hermelin, M Mnich, EJ Van Leeuwen, GJ Woeginger International Colloquium on Automata, Languages, and Programming, 462-473, 2011 | 32 | 2011 |
| Parameterized complexity of firefighting revisited M Cygan, FV Fomin, EJ van Leeuwen International Symposium on Parameterized and Exact Computation, 13-26, 2011 | 31 | 2011 |
| Subexponential-Time Algorithms for Maximum Independent Set in -Free and Broom-Free Graphs G Bacsó, D Lokshtanov, D Marx, M Pilipczuk, Z Tuza, EJ Van Leeuwen Algorithmica 81 (2), 421-438, 2019 | 30 | 2019 |
| Parameterized complexity of firefighting C Bazgan, M Chopin, M Cygan, MR Fellows, FV Fomin, EJ van Leeuwen Journal of Computer and System Sciences 80 (7), 1285-1297, 2014 | 30 | 2014 |
| Better approximation schemes for disk graphs EJ van Leeuwen Scandinavian Workshop on Algorithm Theory, 316-327, 2006 | 29 | 2006 |
| Network sparsification for Steiner problems on planar and bounded-genus graphs M Pilipczuk, M Pilipczuk, P Sankowski, EJ Leeuwen ACM Transactions on Algorithms (TALG) 14 (4), 1-73, 2018 | 28 | 2018 |
| The Firefighter problem on graph classes FV Fomin, P Heggernes, EJ van Leeuwen Theoretical Computer Science 613, 38-50, 2016 | 28 | 2016 |
| Reducing a target interval to a few exact queries J Nederlof, EJ van Leeuwen, R van der Zwaan International Symposium on Mathematical Foundations of Computer Science, 718-727, 2012 | 28 | 2012 |
