OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures. - Virginia Mary Lo; Sanjay V. Rajopadhye; Samik Gupta; David Keldsen; Moataz A. Mohamed; Jan Arne Telle (ICPP (2), 1990)

Mapping Divide-and-Conquer Algorithms to Parallel Architectures. - Virginia Mary Lo; Sanjay V. Rajopadhye; Samik Gupta; David Keldsen; Moataz A. Mohamed; Jan Arne Telle (ICPP (3), 1990)

OREGAMI: Tools for mapping parallel computations to parallel architectures. - Virginia Mary Lo; Sanjay V. Rajopadhye; Samik Gupta; David Keldsen; Moataz A. Mohamed; Bill Nitzberg; Jan Arne Telle; Xiaoxiong Zhong (Int. J. Parallel Program., 1991)

Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. - Jan Arne Telle; Andrzej Proskurowski (WADS, 1993)

Efficient Sets in Partial k-Trees. - Jan Arne Telle; Andrzej Proskurowski (Discret. Appl. Math., 1993)

Complexity of Domination-Type Problems in Graphs. - Jan Arne Telle (Nord. J. Comput., 1994)

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

Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. - Monika Rauch Henzinger; Jan Arne Telle (SWAT, 1996)

Parallel Divide and Conquer on Meshes. - Virginia Mary Lo; Sanjay V. Rajopadhye; Jan Arne Telle; Xiaoxiong Zhong (IEEE Trans. Parallel Distributed Syst., 1996)

Complexity of Colored Graph Covers I. Colored Directed Multigraphs. - Jan Kratochvíl; Andrzej Proskurowski; Jan Arne Telle (WG, 1997)

Covering Regular Graphs. - Jan Kratochvíl; Andrzej Proskurowski; Jan Arne Telle (J. Comb. Theory B, 1997)

Algorithms for Vertex Partitioning Problems on Partial k-Trees. - Jan Arne Telle; Andrzej Proskurowski (SIAM J. Discret. Math., 1997)

Linear-Time Register Allocation for a Fixed Number of Registers. - Hans L. Bodlaender; Jens Gustedt; Jan Arne Telle (SODA, 1998)

Partitioning Graphs into Generalized Dominating Sets. - Pinar Heggernes; Jan Arne Telle (Nord. J. Comput., 1998)

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

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

Classes of graphs with restricted interval models. - Andrzej Proskurowski; Jan Arne Telle (Discret. Math. Theor. Comput. Sci., 1999)

Generalized H-Coloring of Graphs. - Petter Kristiansen; Jan Arne Telle (ISAAC, 2000)

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

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

Independent Sets with Domination Constraints. - Magnús M. Halldórsson; Jan Kratochvíl; Jan Arne Telle (Discret. Appl. Math., 2000)

Mod-2 Independence and Domination in Graphs. - Magnús M. Halldórsson; Jan Kratochvíl; Jan Arne Telle (Int. J. Found. Comput. Sci., 2000)

A practical algorithm for making filled graphs minimal. - Jean R. S. Blair; Pinar Heggernes; Jan Arne Telle (Theor. Comput. Sci., 2001)

The Treewidth of Java Programs. - Jens Gustedt; Ole A. Mæhle; Jan Arne Telle (ALENEX, 2002)

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

A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. - Jens Gustedt; Jan Arne Telle (ICTCS, 2003)

Graph coloring on coarse grained multicomputers. - Assefaw Hadish Gebremedhin; Isabelle Guérin Lassous; Jens Gustedt; Jan Arne Telle (Discret. Appl. Math., 2003)

Multicoloring trees. - Magnús M. Halldórsson; Guy Kortsarz; Andrzej Proskurowski; Ravit Salman; Hadas Shachnai; Jan Arne Telle (Inf. Comput., 2003)

Generalized H-coloring and H-covering of Trees. - Jirí Fiala 001; Pinar Heggernes; Petter Kristiansen; Jan Arne Telle (Nord. J. Comput., 2003)

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

Iterated colorings of graphs. - Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Alice A. McRae; Dee Parks; Jan Arne Telle (Discret. Math., 2004)

Space-Efficient Construction Variants of Dynamic Programming. - Hans L. Bodlaender; Jan Arne Telle (Nord. J. Comput., 2004)

New Tools and Simpler Algorithms for Branchwidth. - Christophe Paul; Jan Arne Telle (ESA, 2005)

Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. - Jirí Fiala 001; Daniël Paulusma; Jan Arne Telle (MFCS, 2005)

Computing minimal triangulations in time O(nalpha log n) = o(n2.376). - Pinar Heggernes; Jan Arne Telle; Yngve Villanger (SODA, 2005)

Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. - Jirí Fiala 001; Daniël Paulusma; Jan Arne Telle (WG, 2005)

Graph Searching, Elimination Trees, and a Generalization of Bandwidth. - Fedor V. Fomin; Pinar Heggernes; Jan Arne Telle (Algorithmica, 2005)

Tree-decompositions of small pathwidth. - Jan Arne Telle (Discret. Appl. Math., 2005)

Edge-maximal graphs of branchwidth k. - Christophe Paul; Jan Arne Telle (Electron. Notes Discret. Math., 2005)

Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). - Pinar Heggernes; Jan Arne Telle; Yngve Villanger (SIAM J. Discret. Math., 2005)

Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. - David R. Wood; Jan Arne Telle (GD, 2006)

Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. - Christian Sloper; Jan Arne Telle (IWPEC, 2006)

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

Generation of Graphs with Bounded Branchwidth. - Christophe Paul; Andrzej Proskurowski; Jan Arne Telle (WG, 2006)

PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms. - Assefaw Hadish Gebremedhin; Mohamed Essaïdi; Isabelle Guérin Lassous; Jens Gustedt; Jan Arne Telle (Nord. J. Comput., 2006)

Interval completion with few edges. - Pinar Heggernes; Christophe Paul; Jan Arne Telle; Yngve Villanger (STOC, 2007)

Characterization and Recognition of Digraphs of Bounded Kelly-width. - Daniel Meister 001; Jan Arne Telle; Martin Vatshelle (WG, 2007)

Leaf Powers and Their Properties: Using the Trees. - Michael R. Fellows; Daniel Meister 001; Frances A. Rosamond; R. Sritharan; Jan Arne Telle (ISAAC, 2008)

On the Complexity of Reconstructing H -free Graphs from Their Star Systems. - Fedor V. Fomin; Jan Kratochvíl; Daniel Lokshtanov; Federico Mancini 001; Jan Arne Telle (LATIN, 2008)

An Overview of Techniques for Designing Parameterized Algorithms. - Christian Sloper; Jan Arne Telle (Comput. J., 2008)

Locally constrained graph homomorphisms and equitable partitions. - Jirí Fiala 001; Daniël Paulusma; Jan Arne Telle (Eur. J. Comb., 2008)

Feedback Vertex Set on Graphs of Low Cliquewidth. - Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle (IWOCA, 2009)

Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions - Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle (CoRR, 2009)

Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. - Frederic Dorn; Jan Arne Telle (Discret. Appl. Math., 2009)

Branchwidth of chordal graphs. - Christophe Paul; Jan Arne Telle (Discret. Appl. Math., 2009)

Edge-maximal graphs of branchwidth k: The k-branches. - Christophe Paul; Jan Arne Telle (Discret. Math., 2009)

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

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

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

H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. - Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle (Discret. Appl. Math., 2010)

Recognizing digraphs of Kelly-width 2. - Daniel Meister 001; Jan Arne Telle; Martin Vatshelle (Discret. Appl. Math., 2010)

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

On the complexity of reconstructing H-free graphs from their Star Systems. - Fedor V. Fomin; Jan Kratochvíl; Daniel Lokshtanov; Federico Mancini 001; Jan Arne Telle (J. Graph Theory, 2011)

Boolean-width of graphs. - Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle (Theor. Comput. Sci., 2011)

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

FPT Algorithms for Domination in Biclique-Free Graphs. - Jan Arne Telle; Yngve Villanger (ESA, 2012)

Chordal digraphs. - Daniel Meister 001; Jan Arne Telle (Theor. Comput. Sci., 2012)

Upper Bounds on Boolean-Width with Applications to Exact Algorithms. - Yuri Rabinovich; Jan Arne Telle; Martin Vatshelle (IPEC, 2013)

Connecting Terminals and 2-Disjoint Connected Subgraphs. - Jan Arne Telle; Yngve Villanger (WG, 2013)

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

The 18th International Symposium on Fundamentals of Computation Theory. - Olaf Owe; Martin Steffen; Jan Arne Telle (Inf. Comput., 2013)

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. - Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle (Theor. Comput. Sci., 2013)

Solving MaxSAT and #SAT on Structured CNF Formulas. - Sigve Hortemo Sæther; Jan Arne Telle; Martin Vatshelle (SAT, 2014)

The graph formulation of the union-closed sets conjecture. - Henning Bruhn; Pierre Charbit; Oliver Schaudt; Jan Arne Telle (Eur. J. Comb., 2015)

Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. - Hans L. Bodlaender; Pinar Heggernes; Jan Arne Telle (Electron. Notes Discret. Math., 2015)

Preface. - Jaroslav Nesetril; Oriol Serra; Jan Arne Telle (Electron. Notes Discret. Math., 2015)

Solving #SAT and MAXSAT by Dynamic Programming. - Sigve Hortemo Sæther; Jan Arne Telle; Martin Vatshelle (J. Artif. Intell. Res., 2015)

On Satisfiability Problems with a Linear Structure. - Serge Gaspers; Christos H. Papadimitriou; Sigve Hortemo Sæther; Jan Arne Telle (IPEC, 2016)

Between Treewidth and Clique-Width. - Sigve Hortemo Sæther; Jan Arne Telle (Algorithmica, 2016)

Sim-width and induced minors. - Dong Yeap Kang; O-joung Kwon; Torstein J. F. Strømme; Jan Arne Telle (CoRR, 2016)

Computational complexity of covering three-vertex multigraphs. - Jan Kratochvíl; Jan Arne Telle; Marek Tesar 001 (Theor. Comput. Sci., 2016)

Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (IPEC, 2017)

A note on the complexity of Feedback Vertex Set parameterized by mim-width. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (CoRR, 2017)

Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. - Lars Jaffke; Hans L. Bodlaender; Pinar Heggernes; Jan Arne Telle (Eur. J. Comb., 2017)

A width parameter useful for chordal and co-comparability graphs. - Dong Yeap Kang; O-joung Kwon; Torstein J. F. Strømme; Jan Arne Telle (Theor. Comput. Sci., 2017)

Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. - Lars Jaffke; O-joung Kwon; Torstein J. F. Strømme; Jan Arne Telle (IPEC, 2018)

A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (STACS, 2018)

Finite Biased Teaching with Infinite Concept Classes. - José Hernández-Orallo; Jan Arne Telle (CoRR, 2018)

Maximum matching width: New characterizations and a fast algorithm for dominating set. - Jisu Jeong; Sigve Hortemo Sæther; Jan Arne Telle (Discret. Appl. Math., 2018)

Linear MIM-Width of Trees. - Svein Høgemo; Jan Arne Telle; Erlend Raa Vågset (WG, 2019)

Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. - Hans L. Bodlaender; Lars Jaffke; Jan Arne Telle (CoRR, 2019)

The teaching size: computable teachers and learners for universal languages. - Jan Arne Telle; José Hernández-Orallo; Cèsar Ferri (Mach. Learn., 2019)

Mim-width III. Graph powers and generalized distance domination problems. - Lars Jaffke; O-joung Kwon; Torstein J. F. Strømme; Jan Arne Telle (Theor. Comput. Sci., 2019)

FPT algorithms for domination in sparse graphs and beyond. - Jan Arne Telle; Yngve Villanger (Theor. Comput. Sci., 2019)

Finite and Confident Teaching in Expectation: Sampling from Infinite Concept Classes. - José Hernández-Orallo; Jan Arne Telle (ECAI, 2020)

Hierarchical Clusterings of Unweighted Graphs. - Svein Høgemo; Christophe Paul; Jan Arne Telle (MFCS, 2020)

Mim-Width II. The Feedback Vertex Set Problem. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (Algorithmica, 2020)

Mim-Width I. Induced path problems. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (Discret. Appl. Math., 2020)

On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. - Svein Høgemo; Benjamin Bergougnoux; Ulrik Brandes; Christophe Paul; Jan Arne Telle (FCT, 2021)

Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation. - Bart M. P. Jansen; Jan Arne Telle (Algorithmica, 2021)

On Alternative Models for Leaf Powers. - Benjamin Bergougnoux; Svein Høgemo; Jan Arne Telle; Martin Vatshelle (CoRR, 2021)

Non-Cheating Teaching Revisited: A New Probabilistic Machine Teaching Model. - Cèsar Ferri; José Hernández-Orallo; Jan Arne Telle (IJCAI, 2022)

Recognition of Linear and Star Variants of Leaf Powers is in P. - Benjamin Bergougnoux; Svein Høgemo; Jan Arne Telle; Martin Vatshelle (WG, 2022)

Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. - Benjamin Bergougnoux; Charis Papadopoulos; Jan Arne Telle (Algorithmica, 2022)

The perfect matching cut problem revisited. - Van Bang Le; Jan Arne Telle (Theor. Comput. Sci., 2022)

XAI with Machine Teaching When Humans Are (Not) Informed About the Irrelevant Features. - Brigt Arve Toppe Håvardstun; Cèsar Ferri; José Hernández-Orallo; Pekka Parviainen; Jan Arne Telle (ECML/PKDD (3), 2023)

Typical Sequences Revisited - Computing Width Parameters of Graphs. - Hans L. Bodlaender; Lars Jaffke; Jan Arne Telle (Theory Comput. Syst., 2023)

On a Combinatorial Problem Arising in Machine Teaching. - Joakim Sunde; Brigt Arve Toppe Håvardstun; Jan Kratochvíl; Jan Arne Telle (ICML, 2024)

An Interactive Tool for Interpretability of Time Series Classification. - Brigt Arve Toppe Håvardstun; Cèsar Ferri; Jan Arne Telle (ECML/PKDD (8), 2024)

Optimal Robust Simplifications for Explaining Time Series Classifications. - Jan Arne Telle; Cèsar Ferri; Brigt Arve Toppe Håvardstun (TempXAI@PKDD/ECML, 2024)

XAI for Time Series Classification: Evaluating the Benefits of Model Inspection for End-Users. - Brigt Arve Toppe Håvardstun; Cèsar Ferri; Kristian Flikka; Jan Arne Telle (xAI (3), 2024)

When Redundancy Matters: Machine Teaching of Representations. - Cèsar Ferri; Darío Garigliotti; Brigt Arve Toppe Håvardstun; José Hernández-Orallo; Jan Arne Telle (CoRR, 2024)

Can adversarial attacks by large language models be attributed? - Manuel Cebrián; Jan Arne Telle (CoRR, 2024)

Classes of intersection digraphs with good algorithmic properties. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (J. Graph Theory, 2024)

MAP- and MLE-Based Teaching. - Hans Ulrich Simon; Jan Arne Telle (J. Mach. Learn. Res., 2024)

The Hierarchy of Saturating Matching Numbers. - Hans Ulrich Simon; Jan Arne Telle (CoRR, 2025)

Evaluating Simplification Algorithms for Interpretability of Time Series Classification. - Félix Martí Pérez; Brigt Arve Toppe Håvardstun; Cèsar Ferri; Carlos Monserrat; Jan Arne Telle (CoRR, 2025)

Relative Drawing Identification Complexity is Invariant to Modality in Vision-Language Models. - Diogo Freitas; Brigt Arve Toppe Håvardstun; Cèsar Ferri; Darío Garigliotti; Jan Arne Telle; José Hernández-Orallo (CoRR, 2025)