| Algorithms for vertex partitioning problems on partial k-trees JA Telle, A Proskurowski SIAM Journal on Discrete Mathematics 10 (4), 529-550, 1997 | 375 | 1997 |
| Complexity of domination-type problems in graphs JA Telle Nord. J. Comput. 1 (1), 157-171, 1994 | 136 | 1994 |
| Partitioning graphs into generalized dominating sets P Heggernes, JA Telle Nord. J. Comput. 5 (2), 128-142, 1998 | 132 | 1998 |
| Boolean-width of graphs BM Bui-Xuan, JA Telle, M Vatshelle Theoretical computer science 412 (39), 5187-5204, 2011 | 125 | 2011 |
| Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems BM Bui-Xuan, JA Telle, M Vatshelle Theoretical Computer Science 511, 66-76, 2013 | 96 | 2013 |
| Practical algorithms on partial k-trees with an application to domination-like problems JA Telle, A Proskurowski Algorithms and Data Structures: Third Workshop, WADS'93 Montréal, Canada …, 1993 | 94 | 1993 |
| Finding k Disjoint Triangles in an Arbitrary Graph M Fellows, P Heggernes, F Rosamond, C Sloper, JA Telle Graph-Theoretic Concepts in Computer Science: 30th International Workshop …, 2005 | 85 | 2005 |
| A practical algorithm for making filled graphs minimal JRS Blair, P Heggernes, JA Telle Theoretical Computer Science 250 (1-2), 125-141, 2001 | 81 | 2001 |
| OREGAMI: Tools for mapping parallel computations to parallel architectures VM Lo, S Rajopadhye, S Gupta, D Keldsen, MA Mohamed, B Nitzberg, ... International Journal of Parallel Programming 20 (3), 237-270, 1991 | 72 | 1991 |
| Covering regular graphs J Kratochvıl, A Proskurowski, JA Telle Journal of Combinatorial Theory, Series B 71 (1), 1-16, 1997 | 67 | 1997 |
| Faster Algorithms for the Nonemptiness of Streett Automata and forCommunication Protocol Pruning M Henzinger, J Telle Cornell University, 1995 | 67 | 1995 |
| Computing Minimal Triangulations in Time O (nalpha log n)= o (n2. 376) P Heggernes, JA Telle, Y Villanger SIAM Journal on Discrete Mathematics 19 (4), 900-913, 2005 | 64 | 2005 |
| Independent sets with domination constraints MM Halldórsson, J Kratochvıl, JA Telle Discrete Applied Mathematics 99 (1-3), 39-54, 2000 | 64 | 2000 |
| Interval completion is fixed parameter tractable Y Villanger, P Heggernes, C Paul, JA Telle SIAM Journal on Computing 38 (5), 2007-2020, 2009 | 61 | 2009 |
| Linear-time register allocation for a fixed number of registers H Bodlaender, J Gustedt, JA Telle SODA 98, 574-583, 1998 | 61 | 1998 |
| The treewidth of Java programs J Gustedt, OA Mæhle, JA Telle Algorithm Engineering and Experiments: 4th International Workshop, ALENEX …, 2002 | 57 | 2002 |
| Complexity of graph covering problems J Kratochv, A Proskurowski, J Telle Nordic Journal of Computing 5, 173-195, 1998 | 55 | 1998 |
| Multicoloring trees MM Halldórsson, G Kortsarz, A Proskurowski, R Salman, H Shachnai, ... Information and Computation 180 (2), 113-129, 2003 | 51* | 2003 |
| Mapping divide-and-conquer algorithms to parallel architectures University of Oregon. Department of Computer and Information Science, ... | 51 | 1990 |
| Solving# SAT and MAXSAT by dynamic programming SH Sæther, JA Telle, M Vatshelle Journal of Artificial Intelligence Research 54, 59-82, 2015 | 49* | 2015 |
