Jan Arne Telle

155 papers A* 6A 10B 36C 1Misc 1Journal 86Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	When Redundancy Matters: Machine Teaching of Representations. Mach. Learn. Cèsar Ferri, Darío Garigliotti, José Hernández-Orallo, Brigt Arve Toppe Håvardstun, Jan Arne Telle
2025	J	`jnl`	Evaluating Simplification Algorithms for Interpretability of Time Series Classification. CoRR Félix Martí Pérez, Brigt Arve Toppe Håvardstun, Cèsar Ferri, Carlos Monserrat, Jan Arne Telle
2025	A	`conf`	Relative Drawing Identification Complexity Is Invariant to Modality in Vision-Language Models. ECAI Diogo Freitas, Brigt Håvardstun, Darío Garigliotti, Jan Arne Telle, Cèsar Ferri, José Hernández-Orallo
2025	J	`jnl`	Relative Drawing Identification Complexity is Invariant to Modality in Vision-Language Models. CoRR Diogo Freitas, Brigt Arve Toppe Håvardstun, Cèsar Ferri, Darío Garigliotti, Jan Arne Telle, José Hernández-Orallo
2025	J	`jnl`	The Hierarchy of Saturating Matching Numbers. CoRR Hans Ulrich Simon, Jan Arne Telle
2024	—	`conf`	An Interactive Tool for Interpretability of Time Series Classification. ECML/PKDD (8) Brigt Arve Toppe Håvardstun, Cèsar Ferri, Jan Arne Telle
2024	J	`jnl`	Can adversarial attacks by large language models be attributed? CoRR Manuel Cebrián, Jan Arne Telle
2024	J	`jnl`	Classes of intersection digraphs with good algorithmic properties. J. Graph Theory Lars Jaffke, O-joung Kwon, Jan Arne Telle
2024	J	`jnl`	MAP- and MLE-Based Teaching. J. Mach. Learn. Res. Hans Ulrich Simon, Jan Arne Telle
2024	A*	`conf`	On a Combinatorial Problem Arising in Machine Teaching. ICML Joakim Sunde, Brigt Arve Toppe Håvardstun, Jan Kratochvíl, Jan Arne Telle
2024	J	`jnl`	On a Combinatorial Problem Arising in Machine Teaching. CoRR Brigt Arve Toppe Håvardstun, Jan Kratochvíl, Joakim Sunde, Jan Arne Telle
2024	—	`conf`	Optimal Robust Simplifications for Explaining Time Series Classifications. TempXAI@PKDD/ECML Jan Arne Telle, Cèsar Ferri, Brigt Arve Toppe Håvardstun
2024	J	`jnl`	When Redundancy Matters: Machine Teaching of Representations. CoRR Cèsar Ferri, Darío Garigliotti, Brigt Arve Toppe Håvardstun, José Hernández-Orallo, Jan Arne Telle
2024	—	`conf`	XAI for Time Series Classification: Evaluating the Benefits of Model Inspection for End-Users. xAI (3) Brigt Arve Toppe Håvardstun, Cèsar Ferri, Kristian Flikka, Jan Arne Telle
2023	J	`jnl`	MAP- and MLE-Based Teaching. CoRR Hans Ulrich Simon, Jan Arne Telle
2023	J	`jnl`	Typical Sequences Revisited - Computing Width Parameters of Graphs. Theory Comput. Syst. Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
2023	—	`conf`	XAI with Machine Teaching When Humans Are (Not) Informed About the Irrelevant Features. ECML/PKDD (3) Brigt Arve Toppe Håvardstun, Cèsar Ferri, José Hernández-Orallo, Pekka Parviainen, Jan Arne Telle
2022	A	`conf`	Classes of Intersection Digraphs with Good Algorithmic Properties. STACS Lars Jaffke, O-joung Kwon, Jan Arne Telle
2022	J	`jnl`	Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. Algorithmica Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
2022	A*	`conf`	Non-Cheating Teaching Revisited: A New Probabilistic Machine Teaching Model. IJCAI Cèsar Ferri, José Hernández-Orallo, Jan Arne Telle
2022	B	`conf`	Recognition of Linear and Star Variants of Leaf Powers is in P. WG Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
2022	J	`jnl`	The perfect matching cut problem revisited. Theor. Comput. Sci. Van Bang Le, Jan Arne Telle
2021	J	`jnl`	Classes of intersection digraphs with good algorithmic properties. CoRR Lars Jaffke, O-joung Kwon, Jan Arne Telle
2021	J	`jnl`	On Alternative Models for Leaf Powers. CoRR Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
2021	B	`conf`	On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. FCT Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
2021	J	`jnl`	On Dasgupta's hierarchical clustering objective and its relation to other graph parameters. CoRR Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
2021	J	`jnl`	Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation. Algorithmica Bart M. P. Jansen, Jan Arne Telle
2021	B	`conf`	The Perfect Matching Cut Problem Revisited. WG Van Bang Le, Jan Arne Telle
2021	J	`jnl`	The Perfect Matching Cut Problem Revisited. CoRR Van Bang Le, Jan Arne Telle
2020	A	`conf`	Finite and Confident Teaching in Expectation: Sampling from Infinite Concept Classes. ECAI José Hernández-Orallo, Jan Arne Telle
2020	B	`conf`	Hierarchical Clusterings of Unweighted Graphs. MFCS Svein Høgemo, Christophe Paul, Jan Arne Telle
2020	J	`jnl`	Hierarchical Clusterings of Unweighted Graphs. CoRR Svein Høgemo, Christophe Paul, Jan Arne Telle
2020	J	`jnl`	Mim-Width I. Induced path problems. Discret. Appl. Math. Lars Jaffke, O-joung Kwon, Jan Arne Telle
2020	J	`jnl`	Mim-Width II. The Feedback Vertex Set Problem. Algorithmica Lars Jaffke, O-joung Kwon, Jan Arne Telle
2020	B	`conf`	Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. WG Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
2020	A	`conf`	Typical Sequences Revisited - Computing Width Parameters of Graphs. STACS Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
2019	B	`ed.`	14th International Symposium on Parameterized and Exact Computation, IPEC 2019, Munich, Germany, September 11-13, 2019 IPEC Bart M. P. Jansen, Jan Arne Telle
2019	J	`jnl`	FPT algorithms for domination in sparse graphs and beyond. Theor. Comput. Sci. Jan Arne Telle, Yngve Villanger
2019	B	`conf`	Linear MIM-Width of Trees. WG Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset
2019	J	`jnl`	Linear MIM-Width of Trees. CoRR Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset
2019	J	`jnl`	Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2019	J	`jnl`	Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. CoRR Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
2019	J	`jnl`	The teaching size: computable teachers and learners for universal languages. Mach. Learn. Jan Arne Telle, José Hernández-Orallo, Cèsar Ferri
2019	J	`jnl`	Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. CoRR Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
2018	A	`conf`	A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. STACS Lars Jaffke, O-joung Kwon, Jan Arne Telle
2018	J	`jnl`	Finite Biased Teaching with Infinite Concept Classes. CoRR José Hernández-Orallo, Jan Arne Telle
2018	B	`conf`	Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. IPEC Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2018	J	`jnl`	Generalized distance domination problems and their complexity on graphs of bounded mim-width. CoRR Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2018	J	`jnl`	Maximum matching width: New characterizations and a fast algorithm for dominating set. Discret. Appl. Math. Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
2017	B	`conf`	A Width Parameter Useful for Chordal and Co-comparability Graphs. WALCOM Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2017	J	`jnl`	A note on the complexity of Feedback Vertex Set parameterized by mim-width. CoRR Lars Jaffke, O-joung Kwon, Jan Arne Telle
2017	J	`jnl`	A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width. CoRR Lars Jaffke, O-joung Kwon, Jan Arne Telle
2017	J	`jnl`	A width parameter useful for chordal and co-comparability graphs. Theor. Comput. Sci. Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2017	J	`jnl`	Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. Eur. J. Comb. Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle
2017	B	`conf`	Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. IPEC Lars Jaffke, O-joung Kwon, Jan Arne Telle
2017	J	`jnl`	Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. CoRR Lars Jaffke, O-joung Kwon, Jan Arne Telle
2016	J	`jnl`	Between Treewidth and Clique-Width. Algorithmica Sigve Hortemo Sæther, Jan Arne Telle
2016	J	`jnl`	Computational complexity of covering three-vertex multigraphs. Theor. Comput. Sci. Jan Kratochvíl, Jan Arne Telle, Marek Tesar
2016	B	`conf`	On Satisfiability Problems with a Linear Structure. IPEC Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle
2016	J	`jnl`	On Satisfiability Problems with a Linear Structure. CoRR Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle
2016	J	`jnl`	Sim-width and induced minors. CoRR Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2015	B	`conf`	Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. IPEC Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
2015	J	`jnl`	Maximum matching width: new characterizations and a fast algorithm for dominating set. CoRR Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
2015	J	`jnl`	Preface. Electron. Notes Discret. Math. Jaroslav Nesetril, Oriol Serra, Jan Arne Telle
2015	J	`jnl`	Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electron. Notes Discret. Math. Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle
2015	J	`jnl`	Solving #SAT and MAXSAT by Dynamic Programming. J. Artif. Intell. Res. Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
2015	J	`jnl`	The graph formulation of the union-closed sets conjecture. Eur. J. Comb. Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle
2014	B	`conf`	Between Treewidth and Clique-Width. WG Sigve Hortemo Sæther, Jan Arne Telle
2014	J	`jnl`	Between Treewidth and Clique-width. CoRR Sigve Hortemo Sæther, Jan Arne Telle
2014	—	`conf`	Computational Complexity of Covering Three-Vertex Multigraphs. MFCS (2) Jan Kratochvíl, Jan Arne Telle, Marek Tesar
2014	A	`conf`	Solving MaxSAT and #SAT on Structured CNF Formulas. SAT Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
2014	J	`jnl`	Solving MaxSAT and #SAT on structured CNF formulas. CoRR Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
2013	J	`jnl`	Connecting Terminals and 2-Disjoint Connected Subgraphs CoRR Jan Arne Telle, Yngve Villanger
2013	B	`conf`	Connecting Terminals and 2-Disjoint Connected Subgraphs. WG Jan Arne Telle, Yngve Villanger
2013	J	`jnl`	Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2013	J	`jnl`	Feedback vertex set on graphs of low clique-width. Eur. J. Comb. Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle
2013	J	`jnl`	The 18th International Symposium on Fundamentals of Computation Theory. Inf. Comput. Olaf Owe, Martin Steffen, Jan Arne Telle
2013	B	`conf`	Upper Bounds on Boolean-Width with Applications to Exact Algorithms. IPEC Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle
2012	J	`jnl`	Chordal digraphs. Theor. Comput. Sci. Daniel Meister, Jan Arne Telle
2012	A	`conf`	FPT Algorithms for Domination in Biclique-Free Graphs. ESA Jan Arne Telle, Yngve Villanger
2012	—	`conf`	Mike Fellows: Weaving the Web of Mathematics and Adventure. The Multivariate Algorithmic Revolution and Beyond Jan Arne Telle
2011	J	`jnl`	Boolean-width of graphs. Theor. Comput. Sci. Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2011	B	`conf`	Finding Good Decompositions for Dynamic Programming on Dense Graphs. IPEC Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle
2011	B	`ed.`	Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings FCT Olaf Owe, Martin Steffen, Jan Arne Telle
2011	J	`jnl`	On the complexity of reconstructing J. Graph Theory Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
2010	B	`conf`	Generalized Graph Clustering: Recognizing ( WG Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle
2010	J	`jnl`	H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discret. Appl. Math. Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2010	B	`conf`	On the Boolean-Width of a Graph: Structure and Applications. WG Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle
2010	J	`jnl`	Recognizing digraphs of Kelly-width 2. Discret. Appl. Math. Daniel Meister, Jan Arne Telle, Martin Vatshelle
2009	—	`conf`	Boolean-Width of Graphs. IWPEC Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2009	J	`jnl`	Branchwidth of chordal graphs. Discret. Appl. Math. Christophe Paul, Jan Arne Telle
2009	B	`conf`	Chordal Digraphs. WG Daniel Meister, Jan Arne Telle
2009	J	`jnl`	Edge-maximal graphs of branchwidth k: The k-branches. Discret. Math. Christophe Paul, Jan Arne Telle
2009	J	`jnl`	Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions CoRR Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2009	C	`conf`	Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2009	J	`jnl`	Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle
2009	J	`jnl`	Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. Discret. Appl. Math. Frederic Dorn, Jan Arne Telle
2008	J	`jnl`	An Overview of Techniques for Designing Parameterized Algorithms. Comput. J. Christian Sloper, Jan Arne Telle
2008	B	`conf`	Leaf Powers and Their Properties: Using the Trees. ISAAC Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle
2008	J	`jnl`	Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. Jirí Fiala, Daniël Paulusma, Jan Arne Telle
2008	B	`conf`	On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
2007	B	`conf`	Characterization and Recognition of Digraphs of Bounded Kelly-width. WG Daniel Meister, Jan Arne Telle, Martin Vatshelle
2007	A*	`conf`	Interval completion with few edges. STOC Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger
2006	B	`conf`	Generation of Graphs with Bounded Branchwidth. WG Christophe Paul, Andrzej Proskurowski, Jan Arne Telle
2006	J	`jnl`	PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms. Nord. J. Comput. Assefaw Hadish Gebremedhin, Mohamed Essaïdi, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
2006	A	`conf`	Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. GD David R. Wood, Jan Arne Telle
2006	—	`conf`	Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. IWPEC Christian Sloper, Jan Arne Telle
2006	B	`conf`	Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. LATIN Frederic Dorn, Jan Arne Telle
2005	B	`conf`	Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG Jirí Fiala, Daniël Paulusma, Jan Arne Telle
2005	J	`jnl`	Computing Minimal Triangulations in Time SIAM J. Discret. Math. Pinar Heggernes, Jan Arne Telle, Yngve Villanger
2005	A*	`conf`	Computing minimal triangulations in time O(n SODA Pinar Heggernes, Jan Arne Telle, Yngve Villanger
2005	J	`jnl`	Edge-maximal graphs of branchwidth k. Electron. Notes Discret. Math. Christophe Paul, Jan Arne Telle
2005	J	`jnl`	Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
2005	B	`conf`	Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS Jirí Fiala, Daniël Paulusma, Jan Arne Telle
2005	A	`conf`	New Tools and Simpler Algorithms for Branchwidth. ESA Christophe Paul, Jan Arne Telle
2005	J	`jnl`	Tree-decompositions of small pathwidth. Discret. Appl. Math. Jan Arne Telle
2004	B	`conf`	Finding k Disjoint Triangles in an Arbitrary Graph. WG Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle
2004	J	`jnl`	Iterated colorings of graphs. Discret. Math. Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle
2004	J	`jnl`	Space-Efficient Construction Variants of Dynamic Programming. Nord. J. Comput. Hans L. Bodlaender, Jan Arne Telle
2003	—	`conf`	A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. ICTCS Jens Gustedt, Jan Arne Telle
2003	J	`jnl`	Generalized H-coloring and H-covering of Trees. Nord. J. Comput. Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
2003	B	`conf`	Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
2003	J	`jnl`	Graph coloring on coarse grained multicomputers. Discret. Appl. Math. Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
2003	J	`jnl`	Multicoloring trees. Inf. Comput. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
2002	B	`conf`	Generalized H-Coloring and H-Covering of Trees. WG Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
2002	—	`conf`	PRO: A Model for Parallel Resource-Optimal Computation. HPCS Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
2002	A	`conf`	The Treewidth of Java Programs. ALENEX Jens Gustedt, Ole A. Mæhle, Jan Arne Telle
2001	J	`jnl`	A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
2001	J	`jnl`	Tree-decompositions of small pathwidth. Electron. Notes Discret. Math. Jan Arne Telle
2000	B	`conf`	Generalized ISAAC Petter Kristiansen, Jan Arne Telle
2000	B	`conf`	Graph Coloring on a Coarse Grained Multiprocessor. WG Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
2000	J	`jnl`	Independent Sets with Domination Constraints. Discret. Appl. Math. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
2000	J	`jnl`	Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski
2000	J	`jnl`	Mod-2 Independence and Domination in Graphs. Int. J. Found. Comput. Sci. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
1999	J	`jnl`	Classes of graphs with restricted interval models. Discret. Math. Theor. Comput. Sci. Andrzej Proskurowski, Jan Arne Telle
1999	B	`conf`	Mod-2 Independence and Domination in Graphs. WG Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
1999	Misc	`conf`	Multi-coloring Trees. COCOON Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
1998	A*	`conf`	Independent Sets with Domination Constraints. ICALP Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
1998	A*	`conf`	Linear-Time Register Allocation for a Fixed Number of Registers. SODA Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle
1998	—	`conf`	Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle
1998	J	`jnl`	On the Complexity of Graph Covering Problems. Nord. J. Comput. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1998	J	`jnl`	Partitioning Graphs into Generalized Dominating Sets. Nord. J. Comput. Pinar Heggernes, Jan Arne Telle
1997	J	`jnl`	Algorithms for Vertex Partitioning Problems on Partial SIAM J. Discret. Math. Jan Arne Telle, Andrzej Proskurowski
1997	B	`conf`	Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1997	J	`jnl`	Covering Regular Graphs. J. Comb. Theory B Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1996	—	`conf`	Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. SWAT Monika Rauch Henzinger, Jan Arne Telle
1996	—	`conf`	Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. SWAT Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
1996	J	`jnl`	Parallel Divide and Conquer on Meshes. IEEE Trans. Parallel Distributed Syst. Virginia Mary Lo, Sanjay V. Rajopadhye, Jan Arne Telle, Xiaoxiong Zhong
1994	J	`jnl`	Complexity of Domination-Type Problems in Graphs. Nord. J. Comput. Jan Arne Telle
1994	B	`conf`	Complexity of Graph Covering Problems. WG Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1993	J	`jnl`	Efficient Sets in Partial Discret. Appl. Math. Jan Arne Telle, Andrzej Proskurowski
1993	B	`conf`	Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. WADS Jan Arne Telle, Andrzej Proskurowski
1991	J	`jnl`	OREGAMI: Tools for mapping parallel computations to parallel architectures. Int. J. Parallel Program. Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Bill Nitzberg, Jan Arne Telle, Xiaoxiong Zhong
1990	—	`conf`	Mapping Divide-and-Conquer Algorithms to Parallel Architectures. ICPP (3) Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle
1990	—	`conf`	OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures. ICPP (2) Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle