default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Arne Telle
Person information
- affiliation: University of Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j57]Hans Ulrich Simon, Jan Arne Telle:
MAP- and MLE-Based Teaching. J. Mach. Learn. Res. 25: 96:1-96:34 (2024)- [c66]Joakim Sunde, Brigt Arve Toppe Håvardstun, Jan Kratochvíl, Jan Arne Telle:
On a Combinatorial Problem Arising in Machine Teaching. ICML 2024 - [c65]Brigt Arve Toppe Håvardstun, Cèsar Ferri
, Jan Arne Telle:
An Interactive Tool for Interpretability of Time Series Classification. ECML/PKDD (8) 2024: 399-403 - [c64]Jan Arne Telle, Cèsar Ferri, Brigt Arve Toppe Håvardstun:
Optimal Robust Simplifications for Explaining Time Series Classifications. TempXAI@PKDD/ECML 2024: 28-43 - [c63]Brigt Arve Toppe Håvardstun, Cèsar Ferri, Kristian Flikka, Jan Arne Telle:
XAI for Time Series Classification: Evaluating the Benefits of Model Inspection for End-Users. xAI (3) 2024: 439-453 - [i23]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 abs/2401.12711 (2024) - [i22]Brigt Arve Toppe Håvardstun, Jan Kratochvíl, Joakim Sunde, Jan Arne Telle:
On a Combinatorial Problem Arising in Machine Teaching. CoRR abs/2402.04907 (2024) - 2023
- [j56]Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle:
Typical Sequences Revisited - Computing Width Parameters of Graphs. Theory Comput. Syst. 67(1): 52-88 (2023) - [c62]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: 378-393 - [i21]Hans Ulrich Simon, Jan Arne Telle:
MAP- and MLE-Based Teaching. CoRR abs/2307.05252 (2023) - 2022
- [j55]Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. Algorithmica 84(5): 1385-1417 (2022) - [j54]Van Bang Le, Jan Arne Telle:
The perfect matching cut problem revisited. Theor. Comput. Sci. 931: 117-130 (2022) - [c61]Cèsar Ferri, José Hernández-Orallo, Jan Arne Telle:
Non-Cheating Teaching Revisited: A New Probabilistic Machine Teaching Model. IJCAI 2022: 2973-2979 - [c60]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Classes of Intersection Digraphs with Good Algorithmic Properties. STACS 2022: 38:1-38:18 - [c59]Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle:
Recognition of Linear and Star Variants of Leaf Powers is in P. WG 2022: 70-83 - 2021
- [j53]Bart M. P. Jansen, Jan Arne Telle:
Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation. Algorithmica 83(8): 2469-2470 (2021) - [c58]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: 287-300 - [c57]Van Bang Le, Jan Arne Telle:
The Perfect Matching Cut Problem Revisited. WG 2021: 182-194 - [i20]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Classes of intersection digraphs with good algorithmic properties. CoRR abs/2105.01413 (2021) - [i19]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 abs/2105.12093 (2021) - [i18]Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle:
On Alternative Models for Leaf Powers. CoRR abs/2105.12407 (2021) - [i17]Van Bang Le, Jan Arne Telle:
The Perfect Matching Cut Problem Revisited. CoRR abs/2107.06399 (2021) - 2020
- [j52]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Mim-Width II. The Feedback Vertex Set Problem. Algorithmica 82(1): 118-145 (2020) - [j51]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Mim-Width I. Induced path problems. Discret. Appl. Math. 278: 153-168 (2020) - [c56]José Hernández-Orallo, Jan Arne Telle:
Finite and Confident Teaching in Expectation: Sampling from Infinite Concept Classes. ECAI 2020: 1182-1189 - [c55]Svein Høgemo, Christophe Paul, Jan Arne Telle:
Hierarchical Clusterings of Unweighted Graphs. MFCS 2020: 47:1-47:13 - [c54]Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle:
Typical Sequences Revisited - Computing Width Parameters of Graphs. STACS 2020: 57:1-57:16 - [c53]Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. WG 2020: 388-400 - [i16]Svein Høgemo, Christophe Paul, Jan Arne Telle:
Hierarchical Clusterings of Unweighted Graphs. CoRR abs/2008.03061 (2020)
2010 – 2019
- 2019
- [j50]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): 1653-1675 (2019) - [j49]Jan Arne Telle, Yngve Villanger:
FPT algorithms for domination in sparse graphs and beyond. Theor. Comput. Sci. 770: 62-68 (2019) - [j48]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: 216-236 (2019) - [c52]Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset:
Linear MIM-Width of Trees. WG 2019: 218-231 - [e2]Bart M. P. Jansen, Jan Arne Telle:
14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany. LIPIcs 148, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-129-0 [contents] - [i15]Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle:
Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. CoRR abs/1905.03643 (2019) - [i14]Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset:
Linear MIM-Width of Trees. CoRR abs/1907.04132 (2019) - [i13]Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. CoRR abs/1910.00887 (2019) - 2018
- [j47]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: 114-124 (2018) - [c51]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: 6:1-6:14 - [c50]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: 42:1-42:14 - [i12]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 abs/1803.03514 (2018) - [i11]José Hernández-Orallo, Jan Arne Telle:
Finite Biased Teaching with Infinite Concept Classes. CoRR abs/1804.07121 (2018) - 2017
- [j46]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: 191-234 (2017) - [j45]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: 1-17 (2017) - [c49]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: 21:1-21:13 - [c48]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: 93-105 - [i10]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 abs/1708.04536 (2017) - [i9]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width. CoRR abs/1710.07148 (2017) - [i8]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
A note on the complexity of Feedback Vertex Set parameterized by mim-width. CoRR abs/1711.05157 (2017) - 2016
- [j44]Sigve Hortemo Sæther, Jan Arne Telle:
Between Treewidth and Clique-Width. Algorithmica 75(1): 218-253 (2016) - [j43]Jan Kratochvíl, Jan Arne Telle, Marek Tesar:
Computational complexity of covering three-vertex multigraphs. Theor. Comput. Sci. 609: 104-117 (2016) - [c47]Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle:
On Satisfiability Problems with a Linear Structure. IPEC 2016: 14:1-14:14 - [i7]Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle:
On Satisfiability Problems with a Linear Structure. CoRR abs/1602.07876 (2016) - [i6]Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
Sim-width and induced minors. CoRR abs/1606.08087 (2016) - 2015
- [j42]Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle:
The graph formulation of the union-closed sets conjecture. Eur. J. Comb. 43: 210-219 (2015) - [j41]Jaroslav Nesetril, Oriol Serra, Jan Arne Telle:
Preface. Electron. Notes Discret. Math. 49: 1-2 (2015) - [j40]Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle:
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electron. Notes Discret. Math. 49: 559-568 (2015) - [j39]Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle:
Solving #SAT and MAXSAT by Dynamic Programming. J. Artif. Intell. Res. 54: 59-82 (2015) - [c46]Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle:
Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. IPEC 2015: 212-223 - [i5]Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle:
Maximum matching width: new characterizations and a fast algorithm for dominating set. CoRR abs/1507.02384 (2015) - 2014
- [c45]Jan Kratochvíl, Jan Arne Telle, Marek Tesar:
Computational Complexity of Covering Three-Vertex Multigraphs. MFCS (2) 2014: 493-504 - [c44]Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle:
Solving MaxSAT and #SAT on Structured CNF Formulas. SAT 2014: 16-31 - [c43]Sigve Hortemo Sæther, Jan Arne Telle:
Between Treewidth and Clique-Width. WG 2014: 396-407 - [i4]Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle:
Solving MaxSAT and #SAT on structured CNF formulas. CoRR abs/1402.6485 (2014) - [i3]Sigve Hortemo Sæther, Jan Arne Telle:
Between Treewidth and Clique-width. CoRR abs/1404.7758 (2014) - 2013
- [j38]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): 666-679 (2013) - [j37]Olaf Owe, Martin Steffen, Jan Arne Telle:
The 18th International Symposium on Fundamentals of Computation Theory. Inf. Comput. 231: 1-2 (2013) - [j36]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: 66-76 (2013) - [c42]Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle:
Upper Bounds on Boolean-Width with Applications to Exact Algorithms. IPEC 2013: 308-320 - [c41]Jan Arne Telle, Yngve Villanger:
Connecting Terminals and 2-Disjoint Connected Subgraphs. WG 2013: 418-428 - [i2]Jan Arne Telle, Yngve Villanger:
Connecting Terminals and 2-Disjoint Connected Subgraphs. CoRR abs/1301.2506 (2013) - 2012
- [j35]Daniel Meister, Jan Arne Telle:
Chordal digraphs. Theor. Comput. Sci. 463: 73-83 (2012) - [c40]Jan Arne Telle:
Mike Fellows: Weaving the Web of Mathematics and Adventure. The Multivariate Algorithmic Revolution and Beyond 2012: 74-79 - [c39]Jan Arne Telle, Yngve Villanger:
FPT Algorithms for Domination in Biclique-Free Graphs. ESA 2012: 802-812 - 2011
- [j34]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. J. Graph Theory 68(2): 113-124 (2011) - [j33]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Boolean-width of graphs. Theor. Comput. Sci. 412(39): 5187-5204 (2011) - [c38]Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle:
Finding Good Decompositions for Dynamic Programming on Dense Graphs. IPEC 2011: 219-231 - [e1]Olaf Owe, Martin Steffen, Jan Arne Telle:
Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings. Lecture Notes in Computer Science 6914, Springer 2011, ISBN 978-3-642-22952-7 [contents] - 2010
- [j32]Daniel Meister, Jan Arne Telle, Martin Vatshelle:
Recognizing digraphs of Kelly-width 2. Discret. Appl. Math. 158(7): 741-746 (2010) - [j31]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): 809-819 (2010) - [c37]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: 159-170 - [c36]Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle:
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. WG 2010: 171-183
2000 – 2009
- 2009
- [j30]Christophe Paul, Jan Arne Telle:
Branchwidth of chordal graphs. Discret. Appl. Math. 157(12): 2718-2725 (2009) - [j29]Frederic Dorn, Jan Arne Telle:
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. Discret. Appl. Math. 157(12): 2737-2746 (2009) - [j28]Christophe Paul, Jan Arne Telle:
Edge-maximal graphs of branchwidth k: The k-branches. Discret. Math. 309(6): 1467-1475 (2009) - [j27]Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle:
Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38(5): 2007-2020 (2009) - [c35]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA 2009: 113-124 - [c34]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Boolean-Width of Graphs. IWPEC 2009: 61-74 - [c33]Daniel Meister, Jan Arne Telle:
Chordal Digraphs. WG 2009: 273-284 - [i1]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions. CoRR abs/0903.4796 (2009) - 2008
- [j26]Christian Sloper, Jan Arne Telle:
An Overview of Techniques for Designing Parameterized Algorithms. Comput. J. 51(1): 122-136 (2008) - [j25]Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29(4): 850-880 (2008) - [c32]Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle:
Leaf Powers and Their Properties: Using the Trees. ISAAC 2008: 402-413 - [c31]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: 194-205 - 2007
- [c30]Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger:
Interval completion with few edges. STOC 2007: 374-381 - [c29]Daniel Meister, Jan Arne Telle, Martin Vatshelle:
Characterization and Recognition of Digraphs of Bounded Kelly-width. WG 2007: 270-279 - 2006
- [j24]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): 215-239 (2006) - [c28]David R. Wood, Jan Arne Telle:
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. GD 2006: 150-161 - [c27]Christian Sloper, Jan Arne Telle:
Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. IWPEC 2006: 251-263 - [c26]Frederic Dorn, Jan Arne Telle:
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. LATIN 2006: 386-397 - [c25]Christophe Paul, Andrzej Proskurowski, Jan Arne Telle:
Generation of Graphs with Bounded Branchwidth. WG 2006: 205-216 - 2005
- [j23]Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle:
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica 41(2): 73-87 (2005) - [j22]Jan Arne Telle:
Tree-decompositions of small pathwidth. Discret. Appl. Math. 145(2): 210-218 (2005) - [j21]Christophe Paul, Jan Arne Telle:
Edge-maximal graphs of branchwidth k. Electron. Notes Discret. Math. 22: 363-368 (2005) - [j20]Pinar Heggernes, Jan Arne Telle, Yngve Villanger:
Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). SIAM J. Discret. Math. 19(4): 900-913 (2005) - [c24]Christophe Paul, Jan Arne Telle:
New Tools and Simpler Algorithms for Branchwidth. ESA 2005: 379-390 - [c23]Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS 2005: 340-351 - [c22]Pinar Heggernes, Jan Arne Telle, Yngve Villanger:
Computing minimal triangulations in time O(nalpha log n) = o(n2.376). SODA 2005: 907-916 - [c21]Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG 2005: 115-126 - 2004
- [j19]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle:
Iterated colorings of graphs. Discret. Math. 278(1-3): 81-108 (2004) - [j18]Hans L. Bodlaender, Jan Arne Telle:
Space-Efficient Construction Variants of Dynamic Programming. Nord. J. Comput. 11(4): 374-385 (2004) - [c20]Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle:
Finding k Disjoint Triangles in an Arbitrary Graph. WG 2004: 235-244 - 2003
- [j17]Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle:
Graph coloring on coarse grained multicomputers. Discret. Appl. Math. 131(1): 179-198 (2003) - [j16]Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
Multicoloring trees. Inf. Comput. 180(2): 113-129 (2003) - [j15]Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle:
Generalized H-coloring and H-covering of Trees. Nord. J. Comput. 10(3): 206-223 (2003) - [c19]Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle:
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT 2003: 73-85 - [c18]Jens Gustedt, Jan Arne Telle:
A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. ICTCS 2003: 125-136 - 2002
- [c17]Jens Gustedt, Ole A. Mæhle, Jan Arne Telle:
The Treewidth of Java Programs. ALENEX 2002: 86-97 - [c16]Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle:
PRO: A Model for Parallel Resource-Optimal Computation. HPCS 2002: 106-113 - [c15]Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle:
Generalized H-Coloring and H-Covering of Trees. WG 2002: 198-210 - 2001
- [j14]Jan Arne Telle:
Tree-decompositions of small pathwidth. Electron. Notes Discret. Math. 10: 277-280 (2001) - [j13]Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle:
A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. 250(1-2): 125-141 (2001) - 2000
- [j12]Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski:
Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27(3): 382-394 (2000) - [j11]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Independent Sets with Domination Constraints. Discret. Appl. Math. 99(1-3): 39-54 (2000) - [j10]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Mod-2 Independence and Domination in Graphs. Int. J. Found. Comput. Sci. 11(3): 355-363 (2000) - [c14]Petter Kristiansen, Jan Arne Telle:
Generalized H-Coloring of Graphs. ISAAC 2000: 456-466 - [c13]Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle:
Graph Coloring on a Coarse Grained Multiprocessor. WG 2000: 184-195
1990 – 1999
- 1999
- [j9]Andrzej Proskurowski, Jan Arne Telle:
Classes of graphs with restricted interval models. Discret. Math. Theor. Comput. Sci. 3(4): 167-176 (1999) - [c12]Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
Multi-coloring Trees. COCOON 1999: 271-280 - [c11]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Mod-2 Independence and Domination in Graphs. WG 1999: 101-109 - 1998
- [j8]Pinar Heggernes, Jan Arne Telle:
Partitioning Graphs into Generalized Dominating Sets. Nord. J. Comput. 5(2): 128-142 (1998) - [j7]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
On the Complexity of Graph Covering Problems. Nord. J. Comput. 5(3): 173-195 (1998) - [c10]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Independent Sets with Domination Constraints. ICALP 1998: 176-187 - [c9]Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle:
Linear-Time Register Allocation for a Fixed Number of Registers. SODA 1998: 574-583 - [c8]Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle:
Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT 1998: 222-233 - 1997
- [j6]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Covering Regular Graphs. J. Comb. Theory B 71(1): 1-16 (1997) - [j5]Jan Arne Telle, Andrzej Proskurowski:
Algorithms for Vertex Partitioning Problems on Partial k-Trees. SIAM J. Discret. Math. 10(4): 529-550 (1997) - [c7]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG 1997: 242-257 - 1996
- [j4]Virginia Mary Lo, Sanjay V. Rajopadhye, Jan Arne Telle, Xiaoxiong Zhong:
Parallel Divide and Conquer on Meshes. IEEE Trans. Parallel Distributed Syst. 7(10): 1049-1058 (1996) - [c6]Monika Rauch Henzinger, Jan Arne Telle:
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. SWAT 1996: 16-27 - [c5]Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle:
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. SWAT 1996: 173-184 - 1994
- [j3]Jan Arne Telle:
Complexity of Domination-Type Problems in Graphs. Nord. J. Comput. 1(1): 157-171 (1994) - [c4]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Complexity of Graph Covering Problems. WG 1994: 93-105 - 1993
- [j2]Jan Arne Telle, Andrzej Proskurowski:
Efficient Sets in Partial k-Trees. Discret. Appl. Math. 44(1-3): 109-117 (1993) - [c3]Jan Arne Telle, Andrzej Proskurowski:
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. WADS 1993: 610-621 - 1991
- [j1]Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Bill Nitzberg, Jan Arne Telle, Xiaoxiong Zhong:
OREGAMI: Tools for mapping parallel computations to parallel architectures. Int. J. Parallel Program. 20(3): 237-270 (1991) - 1990
- [c2]Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle:
OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures. ICPP (2) 1990: 88-92 - [c1]Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle:
Mapping Divide-and-Conquer Algorithms to Parallel Architectures. ICPP (3) 1990: 128-135
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
