Jan Arne Telle

Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle: Feedback vertex set on graphs of low clique-width. Eur. J. Comb. 34(3): 666-679 (2013)

Jan Arne Telle, Yngve Villanger: Connecting Terminals and 2-Disjoint Connected Subgraphs. CoRR abs/1301.2506 (2013)

Daniel Meister, Jan Arne Telle: Chordal digraphs. Theor. Comput. Sci. 463: 73-83 (2012)

Jan Arne Telle: Mike Fellows: Weaving the Web of Mathematics and Adventure. The Multivariate Algorithmic Revolution and Beyond 2012: 74-79

Jan Arne Telle, Yngve Villanger: FPT Algorithms for Domination in Biclique-Free Graphs. ESA 2012: 802-812

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. Journal of Graph Theory 68(2): 113-124 (2011)

Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: Boolean-width of graphs. Theor. Comput. Sci. 412(39): 5187-5204 (2011)

Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle: Finding Good Decompositions for Dynamic Programming on Dense Graphs. IPEC 2011: 219-231

Olaf Owe, Martin Steffen, Jan Arne Telle (Eds.): Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings. Lecture Notes in Computer Science 6914, Springer 2011, isbn 978-3-642-22952-7

Daniel Meister, Jan Arne Telle, Martin Vatshelle: Recognizing digraphs of Kelly-width 2. Discrete Applied Mathematics 158(7): 741-746 (2010)

Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics 158(7): 809-819 (2010)

Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle: On the Boolean-Width of a Graph: Structure and Applications. WG 2010: 159-170

Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle: Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. WG 2010: 171-183

Christophe Paul, Jan Arne Telle: Branchwidth of chordal graphs. Discrete Applied Mathematics 157(12): 2718-2725 (2009)

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)

Christophe Paul, Jan Arne Telle: Edge-maximal graphs of branchwidth k: The k-branches. Discrete Mathematics 309(6): 1467-1475 (2009)

Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle: Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38(5): 2007-2020 (2009)

Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA 2009: 113-124

Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: Boolean-Width of Graphs. IWPEC 2009: 61-74

Daniel Meister, Jan Arne Telle: Chordal Digraphs. WG 2009: 273-284

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)

Christian Sloper, Jan Arne Telle: An Overview of Techniques for Designing Parameterized Algorithms. Comput. J. 51(1): 122-136 (2008)

Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29(4): 850-880 (2008)

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

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

Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger: Interval completion with few edges. STOC 2007: 374-381

Daniel Meister, Jan Arne Telle, Martin Vatshelle: Characterization and Recognition of Digraphs of Bounded Kelly-width. WG 2007: 270-279

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)

David R. Wood, Jan Arne Telle: Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. Graph Drawing 2006: 150-161

Christian Sloper, Jan Arne Telle: Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. IWPEC 2006: 251-263

Frederic Dorn, Jan Arne Telle: Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. LATIN 2006: 386-397

Christophe Paul, Andrzej Proskurowski, Jan Arne Telle: Generation of Graphs with Bounded Branchwidth. WG 2006: 205-216

Jan Arne Telle: Tree-decompositions of small pathwidth. Discrete Applied Mathematics 145(2): 210-218 (2005)

Christophe Paul, Jan Arne Telle: Edge-maximal graphs of branchwidth k. Electronic Notes in Discrete Mathematics 22: 363-368 (2005)

Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing Minimal Triangulations in Time O(n^alpha log n) = o(n ^2.376). SIAM J. Discrete Math. 19(4): 900-913 (2005)

Christophe Paul, Jan Arne Telle: New Tools and Simpler Algorithms for Branchwidth. ESA 2005: 379-390

Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS 2005: 340-351

Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing minimal triangulations in time O(n^alpha log n) = o(n^2.376). SODA 2005: 907-916

Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG 2005: 115-126

Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica 41(2): 73-87 (2004)

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)

Hans L. Bodlaender, Jan Arne Telle: Space-Efficient Construction Variants of Dynamic Programming. Nord. J. Comput. 11(4): 374-385 (2004)

Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle: Finding k Disjoint Triangles in an Arbitrary Graph. WG 2004: 235-244

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)

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)

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)

Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT 2003: 73-85

Jens Gustedt, Jan Arne Telle: A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. ICTCS 2003: 125-136

Jens Gustedt, Ole A. Mæhle, Jan Arne Telle: The Treewidth of Java Programs. ALENEX 2002: 86-97

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle: PRO: A Model for Parallel Resource-Optimal Computation. HPCS 2002: 106-113

Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle: Generalized H-Coloring and H-Covering of Trees. WG 2002: 198-210

Jan Arne Telle: Tree-decompositions of small pathwidth. Electronic Notes in Discrete Mathematics 10: 277-280 (2001)

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)

Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski: Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27(3): 382-394 (2000)

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)

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)

Petter Kristiansen, Jan Arne Telle: Generalized H-Coloring of Graphs. ISAAC 2000: 456-466

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle: Graph Coloring on a Coarse Grained Multiprocessor. WG 2000: 184-195

Andrzej Proskurowski, Jan Arne Telle: Classes of graphs with restricted interval models. Discrete Mathematics & Theoretical Computer Science 3(4): 167-176 (1999)

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle: Multi-coloring Trees. COCOON 1999: 271-280

Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Mod-2 Independence and Domination in Graphs. WG 1999: 101-109

Pinar Heggernes, Jan Arne Telle: Partitioning Graphs into Generalized Dominating Sets. Nord. J. Comput. 5(2): 128-142 (1998)

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: On the Complexity of Graph Covering Problems. Nord. J. Comput. 5(3): 173-195 (1998)

Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Independent Sets with Domination Constraints. ICALP 1998: 176-187

Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle: Linear-Time Register Allocation for a Fixed Number of Registers. SODA 1998: 574-583

Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle: Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT 1998: 222-233

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Covering Regular Graphs. J. Comb. Theory, Ser. B 71(1): 1-16 (1997)

Jan Arne Telle, Andrzej Proskurowski: Algorithms for Vertex Partitioning Problems on Partial k-Trees. SIAM J. Discrete Math. 10(4): 529-550 (1997)

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG 1997: 242-257

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)

Monika Rauch Henzinger, Jan Arne Telle: Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. SWAT 1996: 16-27

Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle: Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. SWAT 1996: 173-184

Jan Arne Telle: Complexity of Domination-Type Problems in Graphs. Nord. J. Comput. 1(1): 157-171 (1994)

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Graph Covering Problems. WG 1994: 93-105

Jan Arne Telle, Andrzej Proskurowski: Efficient Sets in Partial k-Trees. Discrete Applied Mathematics 44(1-3): 109-117 (1993)

Jan Arne Telle, Andrzej Proskurowski: Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. WADS 1993: 610-621

Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Bill Nitzberg, Jan Arne Telle, Xiaoxiong Zhong: OREGAMI: Tools for mapping parallel computations to parallel architectures. International Journal of Parallel Programming 20(3): 237-270 (1991)

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

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