Jan Arne Telle
Jan Arne Telle
Verifisert e-postadresse på ii.uib.no - Startside
Sitert av
Sitert av
Algorithms for vertex partitioning problems on partial k-trees
JA Telle, A Proskurowski
SIAM Journal on Discrete Mathematics 10 (4), 529-550, 1997
Complexity of domination-type problems in graphs
JA Telle
Nord. J. Comput. 1 (1), 157-171, 1994
Partitioning graphs into generalized dominating sets
P Heggernes, JA Telle
Nord. J. Comput. 5 (2), 128-142, 1998
Practical algorithms on partial k-trees with an application to domination-like problems
JA Telle, A Proskurowski
Workshop on Algorithms and Data Structures, 610-621, 1993
Boolean-width of graphs
BM Bui-Xuan, JA Telle, M Vatshelle
Theoretical Computer Science 412 (39), 5187-5204, 2011
Finding k disjoint triangles in an arbitrary graph
M Fellows, P Heggernes, F Rosamond, C Sloper, JA Telle
International Workshop on Graph-Theoretic Concepts in Computer Science, 235-244, 2004
A practical algorithm for making filled graphs minimal
JRS Blair, P Heggernes, JA Telle
Theoretical Computer Science 250 (1-2), 125-141, 2001
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
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
Covering regular graphs
J Kratochvıl, A Proskurowski, JA Telle
Journal of Combinatorial Theory, Series B 71 (1), 1-16, 1997
Interval completion is fixed parameter tractable
Y Villanger, P Heggernes, C Paul, JA Telle
SIAM Journal on Computing 38 (5), 2007-2020, 2009
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
Faster algorithms for the nonemptiness of Streett automata and for communication protocol pruning
MR Henzinger, JA Telle
Scandinavian Workshop on Algorithm Theory, 16-27, 1996
Independent sets with domination constraints
MM Halldórsson, J Kratochvıl, JA Telle
Discrete Applied Mathematics 99 (1-3), 39-54, 2000
Linear-time register allocation for a fixed number of registers
H Bodlaender, J Gustedt, JA Telle
SODA 98, 574-583, 1998
The treewidth of Java programs
J Gustedt, OA Mæhle, JA Telle
Workshop on Algorithm Engineering and Experimentation, 86-97, 2002
Complexity of graph covering problems
J Kratochv, A Proskurowski, J Telle
Nordic Journal of Computing 5, 173-195, 1998
Mapping divide-and-conquer algorithms to parallel architectures
University of Oregon. Department of Computer and Information Science, ...
Multicoloring trees
MM Halldórsson, G Kortsarz, A Proskurowski, R Salman, H Shachnai, ...
Information and Computation 180 (2), 113-129, 2003
Interval completion with few edges
P Heggernes, C Paul, JA Telle, Y Villanger
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20