Jan Arne Telle

	2009
62		Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA 2009: 113-124
61		Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions CoRR abs/0903.4796: (2009)
60		Christophe Paul, Jan Arne Telle: Branchwidth of chordal graphs. Discrete Applied Mathematics 157(12): 2718-2725 (2009)
59		Frederic Dorn, Jan Arne Telle: Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. Discrete Applied Mathematics 157(12): 2737-2746 (2009)
58		Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle: Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38(5): 2007-2020 (2009)
	2008
57		Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle: Leaf Powers and Their Properties: Using the Trees. ISAAC 2008: 402-413
56		Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle: On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN 2008: 194-205
55		Christian Sloper, Jan Arne Telle: An Overview of Techniques for Designing Parameterized Algorithms. Comput. J. 51(1): 122-136 (2008)
54		Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29(4): 850-880 (2008)
	2007
53		Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger: Interval completion with few edges. STOC 2007: 374-381
52		Daniel Meister, Jan Arne Telle, Martin Vatshelle: Characterization and Recognition of Digraphs of Bounded Kelly-width. WG 2007: 270-279
	2006
51		David R. Wood, Jan Arne Telle: Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. Graph Drawing 2006: 150-161
50		Christian Sloper, Jan Arne Telle: Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. IWPEC 2006: 251-263
49		Frederic Dorn, Jan Arne Telle: Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. LATIN 2006: 386-397
48		Christophe Paul, Andrzej Proskurowski, Jan Arne Telle: Generation of Graphs with Bounded Branchwidth. WG 2006: 205-216
47		Assefaw Hadish Gebremedhin, Mohamed Essaïdi, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle: PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms. Nord. J. Comput. 13(4): 215-239 (2006)
	2005
46		Christophe Paul, Jan Arne Telle: New Tools and Simpler Algorithms for Branchwidth. ESA 2005: 379-390
45		Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS 2005: 340-351
44		Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing minimal triangulations in time O(nalpha log n) = o(n2.376). SODA 2005: 907-916
43		Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG 2005: 115-126
42		Jan Arne Telle: Tree-decompositions of small pathwidth. Discrete Applied Mathematics 145(2): 210-218 (2005)
41		Christophe Paul, Jan Arne Telle: Edge-maximal graphs of branchwidth k. Electronic Notes in Discrete Mathematics 22: 363-368 (2005)
40		Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). SIAM J. Discrete Math. 19(4): 900-913 (2005)
	2004
39		Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle: Finding k Disjoint Triangles in an Arbitrary Graph. WG 2004: 235-244
38		Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica 41(2): 73-87 (2004)
37		Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle: Iterated colorings of graphs. Discrete Mathematics 278(1-3): 81-108 (2004)
36		Hans L. Bodlaender, Jan Arne Telle: Space-Efficient Construction Variants of Dynamic Programming. Nord. J. Comput. 11(4): 374-385 (2004)
	2003
35		Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT 2003: 73-85
34		Jens Gustedt, Jan Arne Telle: A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. ICTCS 2003: 125-136
33		Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle: Graph coloring on coarse grained multicomputers. Discrete Applied Mathematics 131(1): 179-198 (2003)
32		Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle: Multicoloring trees. Inf. Comput. 180(2): 113-129 (2003)
31		Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle: Generalized H-coloring and H-covering of Trees. Nord. J. Comput. 10(3): 206-223 (2003)
	2002
30		Jens Gustedt, Ole A. Mæhle, Jan Arne Telle: The Treewidth of Java Programs. ALENEX 2002: 86-97
29		Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle: PRO: A Model for Parallel Resource-Optimal Computation. HPCS 2002: 106-113
28		Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle: Generalized H-Coloring and H-Covering of Trees. WG 2002: 198-210
	2001
27		Jan Arne Telle: Tree-decompositions of small pathwidth. Electronic Notes in Discrete Mathematics 10: 277-280 (2001)
26		Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle: A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. 250(1-2): 125-141 (2001)
	2000
25		Petter Kristiansen, Jan Arne Telle: Generalized H-Coloring of Graphs. ISAAC 2000: 456-466
24		Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle: Graph Coloring on a Coarse Grained Multiprocessor. WG 2000: 184-195
23		Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski: Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27(3): 382-394 (2000)
22		Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Independent Sets with Domination Constraints. Discrete Applied Mathematics 99(1-3): 39-54 (2000)
21		Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Mod-2 Independence and Domination in Graphs. Int. J. Found. Comput. Sci. 11(3): 355-363 (2000)
	1999
20		Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle: Multi-coloring Trees. COCOON 1999: 271-280
19		Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Mod-2 Independence and Domination in Graphs. WG 1999: 101-109
18		Andrzej Proskurowski, Jan Arne Telle: Classes of graphs with restricted interval models. Discrete Mathematics & Theoretical Computer Science 3(4): 167-176 (1999)
	1998
17		Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Independent Sets with Domination Constraints. ICALP 1998: 176-187
16		Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle: Linear-Time Register Allocation for a Fixed Number of Registers. SODA 1998: 574-583
15		Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle: Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT 1998: 222-233
14		Pinar Heggernes, Jan Arne Telle: Partitioning Graphs into Generalized Dominating Sets. Nord. J. Comput. 5(2): 128-142 (1998)
13		Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: On the Complexity of Graph Covering Problems. Nord. J. Comput. 5(3): 173-195 (1998)
	1997
12		Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG 1997: 242-257
11		Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Covering Regular Graphs. J. Comb. Theory, Ser. B 71(1): 1-16 (1997)
10		Jan Arne Telle, Andrzej Proskurowski: Algorithms for Vertex Partitioning Problems on Partial k-Trees. SIAM J. Discrete Math. 10(4): 529-550 (1997)
	1996
9		Monika Rauch Henzinger, Jan Arne Telle: Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. SWAT 1996: 16-27
8		Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle: Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. SWAT 1996: 173-184
7		Virginia Mary Lo, Sanjay V. Rajopadhye, Jan Arne Telle, Xiaoxiong Zhong: Parallel Divide and Conquer on Meshes. IEEE Trans. Parallel Distrib. Syst. 7(10): 1049-1058 (1996)
	1994
6		Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Graph Covering Problems. WG 1994: 93-105
5		Jan Arne Telle: Complexity of Domination-Type Problems in Graphs. Nord. J. Comput. 1(1): 157-171 (1994)
	1993
4		Jan Arne Telle, Andrzej Proskurowski: Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. WADS 1993: 610-621
3		Jan Arne Telle, Andrzej Proskurowski: Efficient Sets in Partial k-Trees. Discrete Applied Mathematics 44(1-3): 109-117 (1993)
	1990
2		Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle: OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures. ICPP (2) 1990: 88-92
1		Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle: Mapping Divide-and-Conquer Algorithms to Parallel Architectures. ICPP (3) 1990: 128-135

Coauthor Index

1	Bengt Aspvall	[15] [23]
2	Jean R. S. Blair	[8] [26]
3	Hans L. Bodlaender	[16] [36]
4	Binh-Minh Bui-Xuan (Bùi Xuân Bình Minh)	[61] [62]
5	Frederic Dorn	[49] [59]
6	Mohamed Essaïdi	[47]
7	Michael R. Fellows (Mike Fellows)	[39] [57]
8	Jirí Fiala	[28] [31] [43] [45] [54]
9	Fedor V. Fomin	[35] [38] [56]
10	Assefaw Hadish Gebremedhin	[24] [29] [33] [47]
11	Samik Gupta	[1] [2]
12	Jens Gustedt	[16] [24] [29] [30] [33] [34] [47]
13	Magnús M. Halldórsson	[17] [19] [20] [21] [22] [32]
14	Sandra Mitchell Hedetniemi (Sandra L. Mitchell)	[37]
15	Stephen T. Hedetniemi	[37]
16	Pinar Heggernes	[8] [14] [26] [28] [31] [35] [38] [39] [40] [44] [53] [58]
17	Monika Rauch Henzinger (Monika Rauch)	[9]
18	David Keldsen	[1] [2]
19	Guy Kortsarz	[20] [32]
20	Jan Kratochvíl	[6] [11] [12] [13] [17] [19] [21] [22] [56]
21	Petter Kristiansen	[25] [28] [31]
22	Isabelle Guérin Lassous	[24] [29] [33] [47]
23	Virginia Mary Lo	[1] [2] [7]
24	Daniel Lokshtanov	[56]
25	Ole A. Mæhle	[30]
26	Federico Mancini	[56]
27	Alice A. McRae	[37]
28	Daniel Meister	[52] [57]
29	Moataz A. Mohamed	[1] [2]
30	Dee Parks	[37]
31	Christophe Paul	[41] [46] [48] [53] [58] [60]
32	Daniël Paulusma	[43] [45] [54]
33	Andrzej Proskurowski	[3] [4] [6] [10] [11] [12] [13] [15] [18] [20] [23] [32] [48]
34	Sanjay V. Rajopadhye	[1] [2] [7]
35	Frances A. Rosamond	[39] [57]
36	Ravit Salman	[20] [32]
37	Hadas Shachnai	[20] [32]
38	Christian Sloper	[39] [50] [55]
39	R. Sritharan	[57]
40	Martin Vatshelle	[52] [61] [62]
41	Yngve Villanger	[40] [44] [53] [58]
42	David R. Wood	[51]
43	Xiaoxiong Zhong	[7]

Colors in the list of coauthors