hkhjkhkjhkjhjkhkjh

Vitenskapelig artikkel

• Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne (2023). Classes of intersection digraphs with good algorithmic properties. (ekstern lenke)
• Bergougnoux, Benjamin; Høgemo, Svein; Telle, Jan Arne et al. (2022). Recognition of Linear and Star Variants of Leaf Powers is in P. (ekstern lenke)
• Le, Van Bang; Telle, Jan Arne (2022). The perfect matching cut problem revisited. (ekstern lenke)
• Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne (2022). Classes of Intersection Digraphs with Good Algorithmic Properties. (ekstern lenke)
• Bergougnoux, Benjamin; Papadopoulos, Charis; Telle, Jan Arne (2022). Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. (ekstern lenke)
• Bodlaender, Hans L.; Jaffke, Lars; Telle, Jan Arne (2021). Typical Sequences Revisited -- Computing Width Parameters of Graphs. (ekstern lenke)
• Høgemo, Svein; Bergougnoux, Benjamin; Brandes, Ulrik et al. (2021). On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. (ekstern lenke)
• Le, Van Bang ; Telle, Jan Arne (2021). The Perfect Matching Cut Problem Revisited. (ekstern lenke)
• Bodlaender, Hans L.; Jaffke, Lars; Telle, Jan Arne (2020). Typical Sequences Revisited - Computing Width Parameters of Graphs. (ekstern lenke)
• Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne (2020). Mim-Width II. The Feedback Vertex Set Problem. (ekstern lenke)
• Høgemo, Svein; Paul, Christophe; Telle, Jan Arne (2020). Hierarchical clusterings of unweighted graphs. (ekstern lenke)
• Jaffke, Lars; Kwon, O-Joung; Strømme, Torstein J. F. et al. (2019). Generalized distance domination problems and their complexity on graphs of bounded mim-width. (ekstern lenke)
• Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne (2019). Mim-Width I. Induced Path Problems. (ekstern lenke)
• Høgemo, Svein; Telle, Jan Arne; Vågset, Erlend Raa (2019). Linear MIM-Width of Trees. (ekstern lenke)
• Jaffke, Lars; Kwon, O-Joung; Strømme, Torstein J. F. et al. (2019). Mim-Width III. Graph powers and generalized distance domination problems. (ekstern lenke)
• Telle, Jan Arne; Hernández-Orallo, José; Ferri, Cesar (2019). The teaching size: computable teachers and learners for universal languages. (ekstern lenke)
• Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne (2018). Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. (ekstern lenke)
• Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne (2018). A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. (ekstern lenke)
• Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne (2018). Maximum matching width: New characterizations and a fast algorithm for dominating set. (ekstern lenke)
• Telle, Jan Arne; Villanger, Yngve (2018). FPT algorithms for domination in sparse graphs and beyond. (ekstern lenke)
• Kang, Dong Yeap; Kwon, O-Joung; Strømme, Torstein J. et al. (2017). A width parameter useful for chordal and co-comparability graphs. (ekstern lenke)
• Kang, Dong Yeap; Kwon, O-Joung; Strømme, Torstein J. et al. (2017). A width parameter useful for chordal and co-comparability graphs. (ekstern lenke)
• Jaffke, Lars; Bodlaender, Hans L.; Heggernes, Pinar et al. (2017). Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. (ekstern lenke)
• Gaspers, Serge; Papadimitriou, C.; Sæther, Sigve Hortemo et al. (2016). On satisfiability problems with a linear structure. (ekstern lenke)
• Telle, Jan Arne; Kratochvil, Jan; tesar, marek (2016). Computational complexity of covering three-vertex multigraphs. (ekstern lenke)
• Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin (2015). Solving #SAT and MaxSAT by dynamic programming. (ekstern lenke)
• Sæther, Sigve Hortemo; Telle, Jan Arne (2015). Between treewidth and clique-width. (ekstern lenke)
• Telle, Jan Arne; Sæther, Sigve Hortemo; jeong, jisu (2015). Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. (ekstern lenke)
• Bodlaender, Hans; Heggernes, Pinar; Telle, Jan Arne (2015). Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. (ekstern lenke)
• Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne (2015). Maximum matching width: New characterizations and a fast algorithm for dominating set. (ekstern lenke)
• Bruhn, Henning; Charbit, Pierre; Schaudt, Oliver et al. (2014). The graph formulation of the union-closed sets conjecture. (ekstern lenke)
• Kratochvil, Jan; Telle, Jan Arne; Tesař, Marek (2014). Computational complexity of covering three-vertex multigraphs. (ekstern lenke)
• Telle, Jan Arne; Sæther, Sigve Hortemo (2014). Between treewidth and clique-width. (ekstern lenke)
• Telle, Jan Arne; Vatshelle, Martin; Sæther, Sigve Hortemo (2014). Solving MAXSAT and #SAT on structured CNF formulas. (ekstern lenke)
• Rabinovich, Yuri; Telle, Jan Arne; Vatshelle, Martin (2013). Upper bounds on boolean-width with applications to exact algorithms. (ekstern lenke)
• Telle, Jan Arne; Villanger, Yngve (2013). Connecting Terminals and 2-Disjoint Connected Subgraphs. (ekstern lenke)
• Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin (2013). Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. (ekstern lenke)
• Telle, Jan Arne; Suchy, Ondra; Bui-Xuan, Binh-Minh et al. (2013). Feedback vertex set on graphs of low cliquewidth. (ekstern lenke)
• Telle, Jan Arne; Vatshelle, Martin; Hvidevold, Eivind et al. (2012). Finding good decompositions for dynamic programming on dense graphs. (ekstern lenke)
• Telle, Jan Arne; Villanger, Yngve (2012). FPT algorithms for domination in biclique-free graphs. (ekstern lenke)
• Telle, Jan Arne (2012). Mike Fellows: Weaving the web of mathematics and adventure. (ekstern lenke)
• Meister, Daniel; Telle, Jan Arne (2012). Chordal digraphs. (ekstern lenke)
• Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin (2011). Boolean-width of graphs. (ekstern lenke)
• Fomin, Fedor; Kratochvil, Jan; Lokshtanov, Daniel et al. (2011). On the Complexity of Reconstructing H-Free Graphs from Their Star Systems. (ekstern lenke)
• Adler, Isolde Marianne; Bui-Xuan, Binh-Minh; Telle, Jan Arne et al. (2010). On the boolean-width of a graph: structure and applications. (ekstern lenke)
• Heggernes, Pinar; Lokshtanov, Daniel; Nederlof, Jesper et al. (2010). Generalized graph clustering: recognizing (p,q)-cluster graphs. (ekstern lenke)
• Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin (2010). H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. (ekstern lenke)
• Meister, Daniel; Telle, Jan Arne; Vatshelle, Martin (2010). Recognizing digraphs of Kelly-width 2. (ekstern lenke)
• Villanger, Yngve; Heggernes, Pinar; Paul, Christophe et al. (2009). Interval completion is fixed parameter tractable. (ekstern lenke)
• Paul, Christophe; Telle, Jan Arne (2009). Edge-maximal graphs of branchwidth k: The k-branches. (ekstern lenke)
• Paul, Christophe; Telle, Jan Arne (2009). Branchwidth of chordal graphs. (ekstern lenke)
• Dorn, Frederic ; Telle, Jan Arne (2009). Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. (ekstern lenke)
• Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin (2009). Boolean-width of graphs. (ekstern lenke)
• Meister, Daniel; Telle, Jan Arne (2009). Chordal digraphs. (ekstern lenke)
• Telle, Jan Arne; Bui-Xuan, Binh-Minh; Vatshelle, Martin (2009). Feedback Vertex Set on Graphs of low Cliquewidth. (ekstern lenke)
• Sloper, Christian; Telle, Jan Arne (2008). An overview of techniques for designing parameterized algorithms. (ekstern lenke)
• Fiala, Jiří; Paulusma, Daniel; Telle, Jan Arne (2008). Locally constrained graph homomorphisms and equitable partitions. (ekstern lenke)
• Fellows, Michael R.; Meister, Daniel; Rosamond, Frances A. et al. (2008). Leaf Powers and Their Properties: Using the Trees. (ekstern lenke)
• Fomin, Fedor; Kratochvil, Jan; Lokshtanov, Daniel et al. (2008). On the complexity of reconstructing H-free graphs from their Star Systems. (ekstern lenke)
• Telle, Jan Arne; Meister, Daniel; Vatshelle, Martin (2007). Characterization and recognition of graphs of bounded Kelly-width. (ekstern lenke)
• Wood, David; Telle, Jan Arne (2007). Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. (ekstern lenke)
• Telle, Jan Arne; Wood, David (2007). Planar decompositions and the crossing number of graphs with an excluded minor. (ekstern lenke)
• Wood, David; Telle, Jan Arne (2006). Planar decompositions and the crossing number of graphs with an excluded minor. (ekstern lenke)
• Sloper, Christian; Telle, Jan Arne (2006). Towards a taxonomy of techniques for designing parameterized algorithms. (ekstern lenke)
• Gebremedhin, Assefaw Hadish Hadish; Gustedt, Jens; Essaïdi, Mohamed et al. (2006). PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms. (ekstern lenke)
• Telle, Jan Arne; Proskurowski, Andrzej; Paul, Christophe (2006). Generating graphs of bounded branchwidth. (ekstern lenke)
• Dorn, Frederic Bernard; Telle, Jan Arne (2006). Two birds with one stone: the best of branchwidth and treewidth with one algorithm. (ekstern lenke)
• Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve (2006). Computing Minimal Triangulations in Time O(nα log n) = o(n2.376). (ekstern lenke)
• Telle, Jan Arne (2005). Tree-decompositions of small pathwidth. (ekstern lenke)
• Telle, Jan Arne; Fiala, Jiri; Paulusma, Daniel (2005). Matrix and graph orders derived from locally constrained graph homomorphisms. (ekstern lenke)
• Telle, Jan Arne; Paul, Christophe (2005). Edge-maximal graphs of branchwidth k. (ekstern lenke)
• Paul, Christophe; Telle, Jan Arne (2005). New tools and simpler algorithms for branchwidth. (ekstern lenke)
• Fiala, Jiri; Paulusma, Daniel; Telle, Jan Arne (2005). Algorithms for comparability of matrices in partial orders imposed by graph homomorphisms. (ekstern lenke)
• Fellows, Michael; Heggernes, Pinar; Rosamond, Frances et al. (2004). Finding k disjoint triangles in an arbitrary graph. (ekstern lenke)
• Fomin, Fedor; Heggernes, Pinar; Telle, Jan Arne (2004). Graph searching, elimination trees, and a generalization of bandwidth. (ekstern lenke)
• Bodlaender, Hans; Telle, Jan Arne (2004). Space-efficient construction variants of dynamic programming. (ekstern lenke)
• Hedetniemi, Sandra M.; Hedetniemi, Stephen T.; McRae, Alice A. et al. (2004). Iterated colorings of graphs. (ekstern lenke)
• Gustedt, J; Telle, Jan Arne (2004). A work-optimal coarse-grained PRAM algorithm for lexicographically first maximal independent set. (ekstern lenke)
• Gebremedhin, Assefaw Hadish; Guerrin-Lassous, Isabelle; Gustedt, Jens et al. (2003). Graph coloring on a coarse grained multiprocessor. (ekstern lenke)
• Halldorsson, M; Korsatz, G; Proskurowski, A et al. (2003). Multi-coloring Trees. (ekstern lenke)
• Fiala, Jiri; Heggernes, Pinar; Kristiansen, Petter et al. (2003). Generalized H-coloring and H-covering of Trees. (ekstern lenke)
• Blair, Jean; Heggernes, Pinar; Telle, Jan Arne (2001). A Practical Algorithm for Making Filled Graphs Minimal. (ekstern lenke)
• Telle, Jan Arne; Proskurowski, A (1999). Classes of graphs with restricted interval models. (ekstern lenke)
• Heggernes, Pinar; Telle, Jan Arne (1998). Partitioning graphs into generalized dominating sets. (ekstern lenke)
• Kratochvil, J.; Proskurowski, Andrzej; Telle, Jan Arne (1998). Complexity of graph covering problems. (ekstern lenke)
• Kratochvil, J.; Proskurowski, Andrzej; Telle, Jan Arne (1997). Covering regular graphs. (ekstern lenke)
• Telle, Jan Arne; Proskurowski, Andrzej (1997). Algorithms for vertex partitioning problems on partial k-trees. (ekstern lenke)
• Telle, Jan Arne (1996). A linear time algorithm to find a graph with prescribed degrees of adjacent vertices. (ekstern lenke)
• Telle, Jan Arne; Lo, V.; Zhong, X. (1996). Parallel divide-and-conquer on meshes. (ekstern lenke)
• Telle, Jan Arne (1994). Complexity of Domination-type Problems in Graphs. (ekstern lenke)

Vitenskapelig Kapittel/Artikkel/Konferanseartikkel

• Håvardstun, Brigt Arve Toppe; Ferri, Cesar; Hernández-Orallo, José et al. (2023). XAI with Machine Teaching When Humans Are (Not) Informed About the Irrelevant Features. (ekstern lenke)
• Hernández-Orallo, José; Telle, Jan Arne (2020). Finite and Confident Teaching in Expectation: Sampling from Infinite Concept Classes. (ekstern lenke)
• Bergougnoux, Benjamin; Papadopoulos, Charis; Telle, Jan Arne (2020). Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. (ekstern lenke)
• Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne et al. (2007). Interval completion with few edges. (ekstern lenke)
• Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve (2005). Computing Minimal Triangulations in Time O(nα log n) = o(n2.376). (ekstern lenke)

Fagartikkel

• Ferri, Cesar; Hernández-Orallo, José; Telle, Jan Arne (2022). Non-Cheating Teaching Revisited: A New Probabilistic Machine Teaching Model. (ekstern lenke)

Leder

• Jansen, Bart M.P.; Telle, Jan Arne (2021). Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation.. (ekstern lenke)
• Nesetril, Jaroslav; Serra, Oriol; Telle, Jan Arne (2015). Preface. (ekstern lenke)
• Owe, Olaf; Steffen, Martin; Telle, Jan Arne (2013). The 18th International Symposium on Fundamentals of Computation Theory. (ekstern lenke)

Vitenskapelig foredrag

• Telle, Jan Arne; Ferri, Cesar; Hernández-Orallo, José (2019). Teaching Explanations by Examples . (ekstern lenke)
• Fomin, Fedor; Heggernes, Pinar; Telle, Jan Arne (2003). Graph searching, elimination trees, and a generalization of bandwidth. (ekstern lenke)
• Gustedt, Jens; Telle, Jan Arne (2003). A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set. (ekstern lenke)
• Telle, Jan Arne; Gebremedhin, Assefaw Hadish; Gustedt, Jens (2002). PRO: A model for Parallel Resource-Optimal computation. (ekstern lenke)
• Telle, Jan Arne; Mæhle, Ole Aleksander; Gustedt, Jens (2002). The treewidth of Java programs. (ekstern lenke)
• Fiala, Jiri; Heggernes, Pinar; Kristiansen, Petter et al. (2002). Generalized H-coloring and H-covering of Trees. (ekstern lenke)
• Aspwall, Bengt; Proskurowski, Andrzej; Telle, Jan Arne (1999). Memory requirements for table computations in partial k-tree algoritms. (ekstern lenke)
• Aspwall, Bengt; Proskurowski, Andrzej; Telle, Jan Arne (1998). Memory requirements for table computations in partial k-tree algoritms. (ekstern lenke)
• Halldórsson, Mágnus; Kratochvil, Jan; Telle, Jan Arne (1998). Independent sets with domination constraints. (ekstern lenke)
• Bodlaender, H.; Gustedt, J.; Telle, Jan Arne (1998). Linear-time rewgister allocation for a fixed number of registers. (ekstern lenke)
• Proskurowski, Andrzej; Telle, Jan Arne (1998). From bandwidth k to pathwidth k. (ekstern lenke)
• Aspvall, Bengt; Proskurowski, Andrzej; Telle, Jan Arne (1997). Memory requirements for table computations in partial k-tree algorithms. (ekstern lenke)
• Kratochvil, Jan; Proskurowski, Andrzej; Telle, Jan Arne (1997). Complexity of colored graph covers I. Colored directed multigraphs. (ekstern lenke)
• Henzinger, M. R.; Telle, Jan Arne (1996). Faster algorithms for the nonemptiness of Streett automata and for communication protocol prunin. (ekstern lenke)
• Blair, Jean; Heggernes, Pinar; Telle, Jan Arne (1996). Making an arbitrary filled graph minimal by removing fill edges. (ekstern lenke)
• Heggernes, Pinar; Telle, Jan Arne (1995). Partitioning Graphs Into Generalized Domination Sets. (ekstern lenke)
• Kratochvil, J.; Proskurowski, A.; Telle, Jan Arne (1994). Complexity of Graph Covering Problems. (ekstern lenke)

Doktorgradsavhandling

• Sæther, Sigve Hortemo; Telle, Jan Arne (2015). Choice of parameter for DP-based FPT algorithms: four case studies. (ekstern lenke)
• Telle, Jan Arne (1994). Vertex Partitioning Problems: Characterization, Complexity and Algorithms on Partial K-trees. Dr.Scient. avhandling. University of Oregon, CIS-TR-18-94. (ekstern lenke)

Kronikk

• Telle, Jan Arne; Drange, Pål Grønås (2012). Sådde frøene til datarevolusjonen. (ekstern lenke)
• Telle, Jan Arne (2012). Jakten på absolutt visshet. (ekstern lenke)
• Telle, Jan Arne (2012). Nå kan robotene snakke sammen. (ekstern lenke)
• Telle, Jan Arne; Drange, Pål Grønås (2012). Er du venn med en robot?. (ekstern lenke)

Forord

• Owe, Olaf; Telle, Jan Arne; Steffen, Martin (2011). Preface to the Proceedings of the 18th International Symposium in Fundamentals of Computation Theory FCT 2011. (ekstern lenke)

Vitenskapelig antologi/Konferanseserie

• Owe, Olaf; Steffen, Martin; Telle, Jan Arne (2011). Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. (ekstern lenke)

Leserinnlegg

• Telle, Jan Arne (2007). Om Elster-saken: Bløffmakeri?. (ekstern lenke)

Rapport

• Gebremedhin, Assefaw Hadish; Guerin Lassous, Isabelle; Gustedt, Jens et al. (2001). PRO: a model for Parallel Resource-Optimal computation. (ekstern lenke)
• Hedetniemi, Sandra; Hedetniemi, Stephen; Mcrae, Alice et al. (1997). Iterated Coloring of Graphs. (ekstern lenke)
• Halldórsson, Magnús M.; Kratochvil, Jan; Telle, Jan Arne (1997). Independent sets with Domination Constraints. (ekstern lenke)
• Proskurowski, Andrzej; Telle, Jan Arne (1996). From bandwith k to pathwidth k. (ekstern lenke)
• Blair, Jean R. S.; Heggernes, Pinar; Telle, Jan Arne (1996). Making an arbitrary filled graph minimal by removing fill edges. (ekstern lenke)
• Heggernes, Pinar; Aspvall, Bengt; Telle, Jan Arne (1995). A simple cubic algorithm for computing minimum height elimination trees for interval graphs. (ekstern lenke)
• Heggernes, Pinar; Telle, Jan Arne (1995). Partitioning Graphs Into Generalized Domination Sets. (ekstern lenke)

Populærvitenskapelig foredrag

• Telle, Jan Arne (1994). Vertex Partitioning Problems on Partial k-Trees. (ekstern lenke)

Se en full oversikt over publikasjoner i Cristin