Jan Arne Telle

According to our database, Jan Arne Telle authored at least 115 papers between 1990 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

MAP- and MLE-Based Teaching.

Hans Ulrich Simon, Jan Arne Telle

J. Mach. Learn. Res., 2024

Can adversarial attacks by large language models be attributed?

Manuel Cebrián, Jan Arne Telle

CoRR, 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

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

Proceedings of the Explainable Artificial Intelligence, 2024

Optimal Robust Simplifications for Explaining Time Series Classifications.

Jan Arne Telle, Cèsar Ferri, Brigt Arve Toppe Håvardstun

Proceedings of the Workshop on Explainable AI for Time Series and Data Streams (TempXAI 2024) co-located with The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2024), 2024

An Interactive Tool for Interpretability of Time Series Classification.

Brigt Arve Toppe Håvardstun, Cèsar Ferri, Jan Arne Telle

Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track and Demo Track, 2024

On a Combinatorial Problem Arising in Machine Teaching.

Joakim Sunde, Brigt Arve Toppe Håvardstun, Jan Kratochvíl, Jan Arne Telle

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Typical Sequences Revisited - Computing Width Parameters of Graphs.

Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle

Theory Comput. Syst., February, 2023

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

Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

2022

The perfect matching cut problem revisited.

Van Bang Le, Jan Arne Telle

Theor. Comput. Sci., 2022

Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width.

Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle

Algorithmica, 2022

Recognition of Linear and Star Variants of Leaf Powers is in P.

Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Classes of Intersection Digraphs with Good Algorithmic Properties.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Non-Cheating Teaching Revisited: A New Probabilistic Machine Teaching Model.

Cèsar Ferri, José Hernández-Orallo, Jan Arne Telle

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

On Alternative Models for Leaf Powers.

Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle

CoRR, 2021

Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation.

Bart M. P. Jansen, Jan Arne Telle

Algorithmica, 2021

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

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

Mim-Width I. Induced path problems.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

Discret. Appl. Math., 2020

Mim-Width II. The Feedback Vertex Set Problem.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

Algorithmica, 2020

Hierarchical Clusterings of Unweighted Graphs.

Svein Høgemo, Christophe Paul, Jan Arne Telle

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Finite and Confident Teaching in Expectation: Sampling from Infinite Concept Classes.

José Hernández-Orallo, Jan Arne Telle

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019

FPT algorithms for domination in sparse graphs and beyond.

Jan Arne Telle, Yngve Villanger

Theor. Comput. Sci., 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

The teaching size: computable teachers and learners for universal languages.

Jan Arne Telle, José Hernández-Orallo, Cèsar Ferri

Mach. Learn., 2019

Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs.

Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle

CoRR, 2019

Linear MIM-Width of Trees.

Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

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

Finite Biased Teaching with Infinite Concept Classes.

José Hernández-Orallo, Jan Arne Telle

CoRR, 2018

A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

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

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

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

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 note on the complexity of Feedback Vertex Set parameterized by mim-width.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

CoRR, 2017

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

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016

Computational complexity of covering three-vertex multigraphs.

Jan Kratochvíl, Jan Arne Telle, Marek Tesar

Theor. Comput. Sci., 2016

Sim-width and induced minors.

Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle

CoRR, 2016

Between Treewidth and Clique-Width.

Sigve Hortemo Sæther, Jan Arne Telle

Algorithmica, 2016

On Satisfiability Problems with a Linear Structure.

Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

Solving #SAT and MAXSAT by Dynamic Programming.

Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle

J. Artif. Intell. Res., 2015

Preface.

Jaroslav Nesetril, Oriol Serra, Jan Arne Telle

Electron. Notes Discret. Math., 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

The graph formulation of the union-closed sets conjecture.

Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle

Eur. J. Comb., 2015

2014

Solving MaxSAT and #SAT on Structured CNF Formulas.

Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

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

The 18th International Symposium on Fundamentals of Computation Theory.

Olaf Owe, Martin Steffen, Jan Arne Telle

Inf. Comput., 2013

Feedback vertex set on graphs of low clique-width.

Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle

Eur. J. Comb., 2013

Connecting Terminals and 2-Disjoint Connected Subgraphs.

Jan Arne Telle, Yngve Villanger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Upper Bounds on Boolean-Width with Applications to Exact Algorithms.

Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

Chordal digraphs.

Daniel Meister, Jan Arne Telle

Theor. Comput. Sci., 2012

FPT Algorithms for Domination in Biclique-Free Graphs.

Jan Arne Telle, Yngve Villanger

Proceedings of the Algorithms - ESA 2012, 2012

Mike Fellows: Weaving the Web of Mathematics and Adventure.

Jan Arne Telle

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011

Boolean-width of graphs.

Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle

Theor. Comput. Sci., 2011

On the complexity of reconstructing <i>H</i>-free graphs from their Star Systems.

Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle

J. Graph Theory, 2011

Finding Good Decompositions for Dynamic Programming on Dense Graphs.

Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

2010

Recognizing digraphs of Kelly-width 2.

Daniel Meister, Jan Arne Telle, Martin Vatshelle

Discret. Appl. Math., 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

Generalized Graph Clustering: Recognizing (<i>p</i>, <i>q</i>)-Cluster Graphs.

Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

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

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009

Interval Completion Is Fixed Parameter Tractable.

Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle

SIAM J. Comput., 2009

Edge-maximal graphs of branchwidth k: The k-branches.

Christophe Paul, Jan Arne Telle

Discret. Math., 2009

Branchwidth of chordal graphs.

Christophe Paul, Jan Arne Telle

Discret. Appl. Math., 2009

Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm.

Frederic Dorn, Jan Arne Telle

Discret. Appl. Math., 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

Feedback Vertex Set on Graphs of Low Cliquewidth.

Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Locally constrained graph homomorphisms and equitable partitions.

Jirí Fiala, Daniël Paulusma, Jan Arne Telle

Eur. J. Comb., 2008

An Overview of Techniques for Designing Parameterized Algorithms.

Christian Sloper, Jan Arne Telle

Comput. J., 2008

On the Complexity of Reconstructing H -free Graphs from Their Star Systems.

Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Leaf Powers and Their Properties: Using the Trees.

Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Characterization and Recognition of Digraphs of Bounded Kelly-width.

Daniel Meister, Jan Arne Telle, Martin Vatshelle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Interval completion with few edges.

Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

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

Generation of Graphs with Bounded Branchwidth.

Christophe Paul, Andrzej Proskurowski, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.

Frederic Dorn, Jan Arne Telle

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Towards a Taxonomy of Techniques for Designing Parameterized Algorithms.

Christian Sloper, Jan Arne Telle

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor.

David R. Wood, Jan Arne Telle

Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005

Computing Minimal Triangulations in Time <i>O</i>(<i>n</i>^alpha <i>log n</i>) = <i>o</i>(<i>n</i> ^2.376).

Pinar Heggernes, Jan Arne Telle, Yngve Villanger

SIAM J. Discret. Math., 2005

Edge-maximal graphs of branchwidth k.

Christophe Paul, Jan Arne Telle

Electron. Notes Discret. Math., 2005

Tree-decompositions of small pathwidth.

Jan Arne Telle

Discret. Appl. Math., 2005

Graph Searching, Elimination Trees, and a Generalization of Bandwidth.

Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle

Algorithmica, 2005

Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms.

Jirí Fiala, Daniël Paulusma, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Computing minimal triangulations in time O(n^alpha log n) = o(n^2.376).

Pinar Heggernes, Jan Arne Telle, Yngve Villanger

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms.

Jirí Fiala, Daniël Paulusma, Jan Arne Telle

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

New Tools and Simpler Algorithms for Branchwidth.

Christophe Paul, Jan Arne Telle

Proceedings of the Algorithms, 2005

2004

Space-Efficient Construction Variants of Dynamic Programming.

Hans L. Bodlaender, Jan Arne Telle

Nord. J. Comput., 2004

Iterated colorings of graphs.

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle

Discret. Math., 2004

Finding k Disjoint Triangles in an Arbitrary Graph.

Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003

Generalized H-coloring and H-covering of Trees.

Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle

Nord. J. Comput., 2003

Multicoloring trees.

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle

Inf. Comput., 2003

Graph coloring on coarse grained multicomputers.

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle

Discret. Appl. Math., 2003

A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set.

Jens Gustedt, Jan Arne Telle

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

2002

PRO: A Model for Parallel Resource-Optimal Computation.

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle

Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications, 2002

The Treewidth of Java Programs.

Jens Gustedt, Ole A. Mæhle, Jan Arne Telle

Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001

A practical algorithm for making filled graphs minimal.

Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle

Theor. Comput. Sci., 2001

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

Independent Sets with Domination Constraints.

Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle

Discret. Appl. Math., 2000

Memory Requirements for Table Computations in Partial k-Tree Algorithms.

Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski

Algorithmica, 2000

Graph Coloring on a Coarse Grained Multiprocessor.

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Generalized <i>H</i>-Coloring of Graphs.

Petter Kristiansen, Jan Arne Telle

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

Classes of graphs with restricted interval models.

Andrzej Proskurowski, Jan Arne Telle

Discret. Math. Theor. Comput. Sci., 1999

Multi-coloring Trees.

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

On the Complexity of Graph Covering Problems.

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle

Nord. J. Comput., 1998

Partitioning Graphs into Generalized Dominating Sets.

Pinar Heggernes, Jan Arne Telle

Nord. J. Comput., 1998

Linear-Time Register Allocation for a Fixed Number of Registers.

Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Algorithms for Vertex Partitioning Problems on Partial <i>k</i>-Trees.

Jan Arne Telle, Andrzej Proskurowski

SIAM J. Discret. Math., 1997

Covering Regular Graphs.

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle

J. Comb. Theory B, 1997

Complexity of Colored Graph Covers I. Colored Directed Multigraphs.

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

Parallel Divide and Conquer on Meshes.

Virginia Mary Lo, Sanjay V. Rajopadhye, Jan Arne Telle, Xiaoxiong Zhong

IEEE Trans. Parallel Distributed Syst., 1996

Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.

Monika Rauch Henzinger, Jan Arne Telle

Proceedings of the Algorithm Theory, 1996

Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.

Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle

Proceedings of the Algorithm Theory, 1996

1994

Complexity of Domination-Type Problems in Graphs.

Jan Arne Telle

Nord. J. Comput., 1994

1993

Efficient Sets in Partial <i>k</i>-Trees.

Jan Arne Telle, Andrzej Proskurowski

Discret. Appl. Math., 1993

Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems.

Jan Arne Telle, Andrzej Proskurowski

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1991

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

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

Proceedings of the 1990 International Conference on Parallel Processing, 1990

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

Proceedings of the 1990 International Conference on Parallel Processing, 1990