Jan Arne Telle

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 48

Top Venues

CoRR

Theor. Comput. Sci.

IPEC

Publications

Brigt Arve Toppe Håvardstun, Jan Kratochvíl, Joakim Sunde, Jan Arne Telle
On a Combinatorial Problem Arising in Machine Teaching. CoRR (2024)
Cèsar Ferri, Darío Garigliotti, Brigt Arve Toppe Håvardstun, José Hernández-Orallo, Jan Arne Telle
When Redundancy Matters: Machine Teaching of Representations. CoRR (2024)
Brigt Arve Toppe Håvardstun, Cèsar Ferri, José Hernández-Orallo, Pekka Parviainen, Jan Arne Telle
XAI with Machine Teaching When Humans Are (Not) Informed About the Irrelevant Features. ECML/PKDD (3) (2023)
Hans Ulrich Simon, Jan Arne Telle
MAP- and MLE-Based Teaching. CoRR (2023)
Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
Typical Sequences Revisited - Computing Width Parameters of Graphs. Theory Comput. Syst. 67 (1) (2023)
Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
Recognition of Linear and Star Variants of Leaf Powers is in P. WG (2022)
Van Bang Le, Jan Arne Telle
The perfect matching cut problem revisited. Theor. Comput. Sci. 931 (2022)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Classes of Intersection Digraphs with Good Algorithmic Properties. STACS (2022)
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. Algorithmica 84 (5) (2022)
Cèsar Ferri, José Hernández-Orallo, Jan Arne Telle
Non-Cheating Teaching Revisited: A New Probabilistic Machine Teaching Model. IJCAI (2022)
Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters. CoRR (2021)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Classes of intersection digraphs with good algorithmic properties. CoRR (2021)
Bart M. P. Jansen, Jan Arne Telle
Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation. Algorithmica 83 (8) (2021)
Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
On Alternative Models for Leaf Powers. CoRR (2021)
Van Bang Le, Jan Arne Telle
The Perfect Matching Cut Problem Revisited. WG (2021)
Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. FCT (2021)
Van Bang Le, Jan Arne Telle
The Perfect Matching Cut Problem Revisited. CoRR (2021)
José Hernández-Orallo, Jan Arne Telle
Finite and Confident Teaching in Expectation: Sampling from Infinite Concept Classes. ECAI (2020)
Svein Høgemo, Christophe Paul, Jan Arne Telle
Hierarchical Clusterings of Unweighted Graphs. CoRR (2020)
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. WG (2020)
Svein Høgemo, Christophe Paul, Jan Arne Telle
Hierarchical Clusterings of Unweighted Graphs. MFCS (2020)
Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
Typical Sequences Revisited - Computing Width Parameters of Graphs. STACS (2020)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Mim-Width II. The Feedback Vertex Set Problem. Algorithmica 82 (1) (2020)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Mim-Width I. Induced path problems. Discret. Appl. Math. 278 (2020)
Jan Arne Telle, Yngve Villanger
FPT algorithms for domination in sparse graphs and beyond. Theor. Comput. Sci. 770 (2019)
Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. 796 (2019)
Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. CoRR (2019)
Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset
Linear MIM-Width of Trees. WG (2019)
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. CoRR (2019)
Jan Arne Telle, José Hernández-Orallo, Cèsar Ferri
The teaching size: computable teachers and learners for universal languages. Mach. Learn. 108 (8-9) (2019)
Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset
Linear MIM-Width of Trees. CoRR (2019)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. STACS (2018)
Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
Generalized distance domination problems and their complexity on graphs of bounded mim-width. CoRR (2018)
José Hernández-Orallo, Jan Arne Telle
Finite Biased Teaching with Infinite Concept Classes. CoRR (2018)
Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
Maximum matching width: New characterizations and a fast algorithm for dominating set. Discret. Appl. Math. 248 (2018)
Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. IPEC (2018)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. CoRR (2017)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. IPEC (2017)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
A note on the complexity of Feedback Vertex Set parameterized by mim-width. CoRR (2017)
Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle
Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. Eur. J. Comb. 66 (2017)
Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
A width parameter useful for chordal and co-comparability graphs. Theor. Comput. Sci. 704 (2017)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width. CoRR (2017)
Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
A Width Parameter Useful for Chordal and Co-comparability Graphs. WALCOM (2017)
Jan Kratochvíl, Jan Arne Telle, Marek Tesar
Computational complexity of covering three-vertex multigraphs. Theor. Comput. Sci. 609 (2016)
Sigve Hortemo Sæther, Jan Arne Telle
Between Treewidth and Clique-Width. Algorithmica 75 (1) (2016)
Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
Sim-width and induced minors. CoRR (2016)
Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle
On Satisfiability Problems with a Linear Structure. CoRR (2016)
Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle
On Satisfiability Problems with a Linear Structure. IPEC (2016)
Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
Maximum matching width: new characterizations and a fast algorithm for dominating set. CoRR (2015)
Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
Solving #SAT and MAXSAT by Dynamic Programming. J. Artif. Intell. Res. 54 (2015)
Jaroslav Nesetril, Oriol Serra, Jan Arne Telle
Preface. Electron. Notes Discret. Math. 49 (2015)
Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electron. Notes Discret. Math. 49 (2015)
Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. IPEC (2015)
Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle
The graph formulation of the union-closed sets conjecture. Eur. J. Comb. 43 (2015)
Sigve Hortemo Sæther, Jan Arne Telle
Between Treewidth and Clique-width. CoRR (2014)
Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
Solving MaxSAT and #SAT on Structured CNF Formulas. SAT (2014)
Jan Kratochvíl, Jan Arne Telle, Marek Tesar
Computational Complexity of Covering Three-Vertex Multigraphs. MFCS (2) (2014)
Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
Solving MaxSAT and #SAT on structured CNF formulas. CoRR (2014)
Sigve Hortemo Sæther, Jan Arne Telle
Between Treewidth and Clique-Width. WG (2014)
Olaf Owe, Martin Steffen, Jan Arne Telle
The 18th International Symposium on Fundamentals of Computation Theory. Inf. Comput. 231 (2013)
Jan Arne Telle, Yngve Villanger
Connecting Terminals and 2-Disjoint Connected Subgraphs CoRR (2013)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. 511 (2013)
Jan Arne Telle, Yngve Villanger
Connecting Terminals and 2-Disjoint Connected Subgraphs. WG (2013)
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) (2013)
Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle
Upper Bounds on Boolean-Width with Applications to Exact Algorithms. IPEC (2013)
Jan Arne Telle
Mike Fellows: Weaving the Web of Mathematics and Adventure. The Multivariate Algorithmic Revolution and Beyond (2012)
Jan Arne Telle, Yngve Villanger
FPT Algorithms for Domination in Biclique-Free Graphs. ESA (2012)
Daniel Meister, Jan Arne Telle
Chordal digraphs. Theor. Comput. Sci. 463 (2012)
Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
-free graphs from their Star Systems. J. Graph Theory 68 (2) (2011)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Boolean-width of graphs. Theor. Comput. Sci. 412 (39) (2011)
Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle
Finding Good Decompositions for Dynamic Programming on Dense Graphs. IPEC (2011)
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)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discret. Appl. Math. 158 (7) (2010)
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle
)-Cluster Graphs. WG (2010)
Daniel Meister, Jan Arne Telle, Martin Vatshelle
Recognizing digraphs of Kelly-width 2. Discret. Appl. Math. 158 (7) (2010)
Christophe Paul, Jan Arne Telle
Branchwidth of chordal graphs. Discret. Appl. Math. 157 (12) (2009)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions CoRR (2009)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA (2009)
Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle
Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38 (5) (2009)
Christophe Paul, Jan Arne Telle
Edge-maximal graphs of branchwidth k: The k-branches. Discret. Math. 309 (6) (2009)
Frederic Dorn, Jan Arne Telle
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. Discret. Appl. Math. 157 (12) (2009)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Boolean-Width of Graphs. IWPEC (2009)
Daniel Meister, Jan Arne Telle
Chordal Digraphs. WG (2009)
Christian Sloper, Jan Arne Telle
An Overview of Techniques for Designing Parameterized Algorithms. Comput. J. 51 (1) (2008)
Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle
Leaf Powers and Their Properties: Using the Trees. ISAAC (2008)
Jirí Fiala, Daniël Paulusma, Jan Arne Telle
Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29 (4) (2008)
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)
Daniel Meister, Jan Arne Telle, Martin Vatshelle
Characterization and Recognition of Digraphs of Bounded Kelly-width. WG (2007)
Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger
Interval completion with few edges. STOC (2007)
Christophe Paul, Andrzej Proskurowski, Jan Arne Telle
Generation of Graphs with Bounded Branchwidth. WG (2006)
Frederic Dorn, Jan Arne Telle
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. LATIN (2006)
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) (2006)
Christian Sloper, Jan Arne Telle
Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. IWPEC (2006)
David R. Wood, Jan Arne Telle
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. Graph Drawing (2006)
Christophe Paul, Jan Arne Telle
New Tools and Simpler Algorithms for Branchwidth. ESA (2005)
Pinar Heggernes, Jan Arne Telle, Yngve Villanger
). SIAM J. Discret. Math. 19 (4) (2005)
Jan Arne Telle
Tree-decompositions of small pathwidth. Discret. Appl. Math. 145 (2) (2005)
Christophe Paul, Jan Arne Telle
Edge-maximal graphs of branchwidth k. Electron. Notes Discret. Math. 22 (2005)
Pinar Heggernes, Jan Arne Telle, Yngve Villanger
). SODA (2005)
Jirí Fiala, Daniël Paulusma, Jan Arne Telle
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG (2005)

Jan Arne Telle.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jan Arne Telle