| 2025 | ECAI | Relative Drawing Identification Complexity Is Invariant to Modality in Vision-Language Models. | Diogo Freitas, Brigt Hvardstun, Daro Garigliotti, Jan Arne Telle, Csar Ferri, Jos Hernndez-Orallo |
| 2024 | ICML | On a Combinatorial Problem Arising in Machine Teaching. | Joakim Sunde, Brigt Arve Toppe Hvardstun, Jan Kratochvl, Jan Arne Telle |
| 2022 | IJCAI | Non-Cheating Teaching Revisited: A New Probabilistic Machine Teaching Model. | Csar Ferri, Jos Hernndez-Orallo, Jan Arne Telle |
| 2022 | STACS | Classes of Intersection Digraphs with Good Algorithmic Properties. | Lars Jaffke, O-joung Kwon, Jan Arne Telle |
| 2022 | WG | Recognition of Linear and Star Variants of Leaf Powers is in P. | Benjamin Bergougnoux, Svein Hgemo, Jan Arne Telle, Martin Vatshelle |
| 2021 | FCT | On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. | Svein Hgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle |
| 2021 | WG | The Perfect Matching Cut Problem Revisited. | Van Bang Le, Jan Arne Telle |
| 2020 | ECAI | Finite and Confident Teaching in Expectation: Sampling from Infinite Concept Classes. | Jos Hernndez-Orallo, Jan Arne Telle |
| 2020 | MFCS | Hierarchical Clusterings of Unweighted Graphs. | Svein Hgemo, Christophe Paul, Jan Arne Telle |
| 2020 | STACS | Typical Sequences Revisited - Computing Width Parameters of Graphs. | Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle |
| 2020 | WG | Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. | Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle |
| 2019 | WG | Linear MIM-Width of Trees. | Svein Hgemo, Jan Arne Telle, Erlend Raa Vgset |
| 2018 | STACS | A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. | Lars Jaffke, O-joung Kwon, Jan Arne Telle |
| 2017 | WALCOM | A Width Parameter Useful for Chordal and Co-comparability Graphs. | Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strmme, Jan Arne Telle |
| 2014 | MFCS | Computational Complexity of Covering Three-Vertex Multigraphs. | Jan Kratochvl, Jan Arne Telle, Marek Tesar |
| 2014 | SAT | Solving MaxSAT and #SAT on Structured CNF Formulas. | Sigve Hortemo Sther, Jan Arne Telle, Martin Vatshelle |
| 2014 | WG | Between Treewidth and Clique-Width. | Sigve Hortemo Sther, Jan Arne Telle |
| 2013 | WG | Connecting Terminals and 2-Disjoint Connected Subgraphs. | Jan Arne Telle, Yngve Villanger |
| 2012 | ESA | FPT Algorithms for Domination in Biclique-Free Graphs. | Jan Arne Telle, Yngve Villanger |
| 2010 | WG | 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 |
| 2010 | WG | Generalized Graph Clustering: Recognizing ( | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
| 2009 | IWOCA | Feedback Vertex Set on Graphs of Low Cliquewidth. | Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle |
| 2009 | WG | Chordal Digraphs. | Daniel Meister, Jan Arne Telle |
| 2008 | ISAAC | Leaf Powers and Their Properties: Using the Trees. | Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle |
| 2008 | LATIN | On the Complexity of Reconstructing H -free Graphs from Their Star Systems. | Fedor V. Fomin, Jan Kratochvl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle |
| 2007 | STOC | Interval completion with few edges. | Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger |
| 2007 | WG | Characterization and Recognition of Digraphs of Bounded Kelly-width. | Daniel Meister, Jan Arne Telle, Martin Vatshelle |
| 2006 | GD | Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. | David R. Wood, Jan Arne Telle |
| 2006 | LATIN | Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. | Frederic Dorn, Jan Arne Telle |
| 2006 | WG | Generation of Graphs with Bounded Branchwidth. | Christophe Paul, Andrzej Proskurowski, Jan Arne Telle |
| 2005 | ESA | New Tools and Simpler Algorithms for Branchwidth. | Christophe Paul, Jan Arne Telle |
| 2005 | MFCS | Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. | Jir Fiala, Danil Paulusma, Jan Arne Telle |
| 2005 | SODA | Computing minimal triangulations in time O(n | Pinar Heggernes, Jan Arne Telle, Yngve Villanger |
| 2005 | WG | Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. | Jir Fiala, Danil Paulusma, Jan Arne Telle |
| 2004 | WG | Finding k Disjoint Triangles in an Arbitrary Graph. | Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle |
| 2003 | FCT | Graph Searching, Elimination Trees, and a Generalization of Bandwidth. | Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle |
| 2002 | ALENEX | The Treewidth of Java Programs. | Jens Gustedt, Ole A. Mhle, Jan Arne Telle |
| 2002 | WG | Generalized H-Coloring and H-Covering of Trees. | Jir Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle |
| 2000 | ISAAC | Generalized | Petter Kristiansen, Jan Arne Telle |
| 2000 | WG | Graph Coloring on a Coarse Grained Multiprocessor. | Assefaw Hadish Gebremedhin, Isabelle Gurin Lassous, Jens Gustedt, Jan Arne Telle |
| 1999 | COCOON | Multi-coloring Trees. | Magns M. Halldrsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle |
| 1999 | WG | Mod-2 Independence and Domination in Graphs. | Magns M. Halldrsson, Jan Kratochvl, Jan Arne Telle |
| 1998 | ICALP | Independent Sets with Domination Constraints. | Magns M. Halldrsson, Jan Kratochvl, Jan Arne Telle |
| 1998 | SODA | Linear-Time Register Allocation for a Fixed Number of Registers. | Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle |
| 1997 | WG | Complexity of Colored Graph Covers I. Colored Directed Multigraphs. | Jan Kratochvl, Andrzej Proskurowski, Jan Arne Telle |
| 1994 | WG | Complexity of Graph Covering Problems. | Jan Kratochvl, Andrzej Proskurowski, Jan Arne Telle |
| 1993 | WADS | Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. | Jan Arne Telle, Andrzej Proskurowski |
| 1990 | ICPP | 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 |
| 1990 | ICPP | Mapping Divide-and-Conquer Algorithms to Parallel Architectures. | Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle |