×

zbMATH — the first resource for mathematics

Telle, Jan Arne

Compute Distance To:
Author ID: telle.jan-arne Recent zbMATH articles by "Telle, Jan Arne"
Published as: Telle, Jan Arne; Telle, J. A.; Teile, Jan Arne
Documents Indexed: 98 Publications since 1993, including 3 Books

Publications by Year

Citations contained in zbMATH Open

80 Publications have been cited 600 times in 437 Documents Cited by Year
Algorithms for vertex partitioning problems on partial \(k\)-trees. Zbl 0885.68118
Telle, Jan Arne; Proskurowski, Andrzej
97
1997
Finding \(k\) disjoint triangles in an arbitrary graph. Zbl 1112.68418
Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne
25
2004
Boolean-width of graphs. Zbl 1225.68133
Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin
25
2011
Interval completion is fixed parameter tractable. Zbl 1227.05241
Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne
25
2009
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Zbl 1408.68111
Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin
23
2013
Partitioning graphs into generalized dominating sets. Zbl 0905.68100
Heggernes, Pinar; Telle, Jan Arne
22
1998
Covering regular graphs. Zbl 0895.05049
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
20
1997
Computing minimal triangulations in time \(O(n^{\alpha}\log n) = o(n ^{2.376})\). Zbl 1105.05066
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve
19
2005
A practical algorithm for making filled graphs minimal. Zbl 0952.68104
Blair, J. R. S.; Heggernes, P.; Telle, J. A.
18
2001
Complexity of graph covering problems. Zbl 0911.68076
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
17
1998
Independent sets with domination constraints. Zbl 0939.05063
Halldórsson, Magnús M.; Kratochvíl, Jan; Telle, Jan Arne
14
2000
Linear-time register allocation for a fixed number of register. Zbl 0930.68016
Bodlaender, Hans; Gustedt, Jens; Telle, Jan Arne
13
1998
Generalized \(H\)-coloring of graphs. Zbl 1044.68129
Kristiansen, Petter; Telle, Jan Arne
13
2000
Graph searching, elimination trees, and a generalization of bandwidth. Zbl 1082.68082
Fomin, Fedor V.; Heggernes, Pinar; Telle, Jan Arne
12
2005
\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Zbl 1216.05153
Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin
11
2010
Classes of graphs with restricted interval models. Zbl 0930.05083
Proskurowski, Andrzej; Telle, Jan Arne
10
1999
Interval completion with few edges. Zbl 1232.68074
Heggernes, Pinar; Paul, Christophe; Teile, Jan Arne; Villanger, Yngve
10
2007
Multicoloring trees. Zbl 1054.68016
Halldórsson, Magnús M.; Kortsarz, Guy; Proskurowski, Andrzej; Salman, Ravit; Shachnai, Hadas; Telle, Jan Arne
9
2003
Memory requirements for table computations in partial \(k\)-tree algorithms. Zbl 0959.68096
Aspvall, B.; Proskurowski, A.; Telle, J. A.
9
2000
On the Boolean-width of a graph: structure and applications. Zbl 1310.05193
Adler, Isolde; Bui-Xuan, Binh-Minh; Rabinovich, Yuri; Renault, Gabriel; Telle, Jan Arne; Vatshelle, Martin
9
2010
Characterization of domination-type parameters in graphs. Zbl 0801.05058
Telle, Jan Arne
8
1993
Complexity of colored graph covers. I: Colored directed multigraphs. Zbl 0890.68095
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
8
1997
The treewidth of Java programs. Zbl 1014.68883
Gustedt, Jens; Mæhle, Ole A.; Telle, Jan Arne
7
2002
Locally constrained graph homomorphisms and equitable partitions. Zbl 1205.05141
Fiala, Jiří; Paulusma, Daniël; Telle, Jan Arne
7
2008
Feedback vertex set on graphs of low clique-width. Zbl 1257.05165
Bui-Xuan, Binh-Minh; Suchý, Ondřej; Telle, Jan Arne; Vatshelle, Martin
7
2013
Connecting terminals and 2-disjoint connected subgraphs. Zbl 1417.05112
Telle, Jan Arne; Villanger, Yngve
7
2013
The graph formulation of the union-closed sets conjecture. Zbl 1301.05183
Bruhn, Henning; Charbit, Pierre; Schaudt, Oliver; Telle, Jan Arne
7
2015
Mim-width. III. Graph powers and generalized distance domination problems. Zbl 1442.05157
Jaffke, Lars; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne
6
2019
Mim-width. II. The feedback vertex set problem. Zbl 1442.05158
Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
6
2020
Between treewidth and clique-width. Zbl 1345.05104
Sæther, Sigve Hortemo; Telle, Jan Arne
6
2016
Planar decompositions and the crossing number of graphs with an excluded minor. Zbl 1120.05063
Wood, David R.; Telle, Jan Arne
6
2007
Generalized graph clustering: recognizing \((p,q)\)-cluster graphs. Zbl 1309.68153
Heggernes, Pinar; Lokshtanov, Daniel; Nederlof, Jesper; Paul, Christophe; Telle, Jan Arne
6
2010
New tools and simpler algorithms for branchwidth. Zbl 1162.68503
Paul, Christophe; Telle, Jan Arne
5
2005
Leaf powers and their properties: Using the trees. Zbl 1183.68425
Fellows, Michael R.; Meister, Daniel; Rosamond, Frances A.; Sritharan, R.; Telle, Jan Arne
5
2008
Solving #SAT and MaxSAT by dynamic programming. Zbl 1341.68204
Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin
5
2015
Recognizing digraphs of Kelly-width 2. Zbl 1216.05160
Meister, Daniel; Telle, Jan Arne; Vatshelle, Martin
5
2010
On satisfiability problems with a linear structure. Zbl 1398.68235
Gaspers, Serge; Papadimitriou, Christos H.; Sæther, Sigve Hortemo; Telle, Jan Arne
4
2017
Graph coloring on coarse grained multicomputers. Zbl 1029.68114
Gebremedhin, Assefaw Hadish; Guérin Lassous, Isabelle; Gustedt, Jens; Telle, Jan Arne
4
2003
On the complexity of reconstructing \(H\)-free graphs from their star systems. Zbl 1230.05215
Fomin, Fedor V.; Kratochvíl, Jan; Lokshtanov, Daniel; Mancini, Federico; Telle, Jan Arne
4
2011
A width parameter useful for chordal and co-comparability graphs. Zbl 1380.05151
Kang, Dong Yeap; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne
4
2017
Between treewidth and clique-width. Zbl 1409.05201
Sæther, Sigve Hortemo; Telle, Jan Arne
4
2014
Mod-2 independence and domination in graphs. Zbl 1320.05121
Halldórsson, Magnús M.; Kratochvíl, Jan; Telle, Jan Arne
4
2000
Finding good decompositions for dynamic programming on dense graphs. Zbl 1352.68110
Hvidevold, Eivind Magnus; Sharmin, Sadia; Telle, Jan Arne; Vatshelle, Martin
4
2012
Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\). Zbl 1297.05120
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve
4
2005
Mim-width. I. Induced path problems. Zbl 1437.05223
Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
3
2020
Recognizability equals definability for graphs of bounded treewidth and bounded chordality. Zbl 1346.05249
Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne
3
2015
Mod-2 independence and domination in graphs. Zbl 0943.05081
Halldórsson, Magnús M.; Kratochvíl, Jan; Telle, Jan Arne
3
1999
Tree-decompositions of small pathwidth. Zbl 1067.68108
Telle, Jan Arne
3
2005
Matrix and graph orders derived from locally constrained graph homomorphisms. Zbl 1156.05338
Fiala, Jiří; Paulusma, Daniël; Telle, Jan Arne
3
2005
Planar decompositions and the crossing number of graphs with an excluded minor. Zbl 1185.05050
Wood, David R.; Telle, Jan Arne
3
2007
FPT algorithms for domination in biclique-free graphs. Zbl 1365.68291
Telle, Jan Arne; Villanger, Yngve
3
2012
Chordal digraphs. Zbl 1256.05088
Meister, Daniel; Telle, Jan Arne
3
2012
Boolean-width of graphs. Zbl 1273.68273
Bui-Xuan, B.-M.; Telle, J. A.; Vatshelle, M.
3
2009
Upper bounds on Boolean-width with applications to exact algorithms. Zbl 1407.68370
Rabinovich, Yuri; Telle, Jan Arne; Vatshelle, Martin
3
2013
A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width. Zbl 07228433
Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne
3
2018
Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width. Zbl 1443.68131
Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
2
2018
Generalized \(H\)-coloring and \(H\)-covering of trees. Zbl 1022.68095
Fiala, Jiří; Heggernes, Pinar; Kristiansen, Petter; Telle, Jan Arne
2
2002
Generalized \(H\)-coloring and \(H\)-covering of trees. Zbl 1094.68609
Fiala, Jiří; Heggernes, Pinar; Kristiansen, Petter; Telle, Jan Arne
2
2003
Space-efficient construction variants of dynamic programming. Zbl 1102.68720
Bodlaender, Hans L.; Telle, Jan Arne
2
2004
A width parameter useful for chordal and co-comparability graphs. Zbl 06711880
Kang, Dong Yeap; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne
2
2017
Feedback vertex set on graphs of low cliquewidth. Zbl 1267.05247
Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin
2
2009
Solving MaxSAT and #SAT on structured CNF formulas. Zbl 1423.68470
Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin
2
2014
Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm. Zbl 1211.05065
Dorn, Frederic; Telle, Jan Arne
2
2009
The teaching size: computable teachers and learners for universal languages. Zbl 07097485
Telle, Jan Arne; Hernández-Orallo, José; Ferri, Cèsar
1
2019
Maximum matching width: new characterizations and a fast algorithm for dominating set. Zbl 1395.05116
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne
1
2018
Iterated colorings of graphs. Zbl 1038.05022
Hedetniemi, Sandra M.; Hedetniemi, Stephen T.; McRae, Alice A.; Parks, Dee; Telle, Jan Arne
1
2004
Efficient sets in partial \(k\)-trees. Zbl 0787.68083
Telle, Jan Arne; Proskurowski, Andrzej
1
1993
The graph formulation of the union-closed sets conjecture. Zbl 1293.05165
Bruhn, Henning; Charbit, Pierre; Telle, Jan Arne
1
2013
Making an arbitrary filled graph minimal by removing fill edges. Zbl 0886.05104
Blair, Jean R. S.; Heggernes, Pinar; Telle, Jan Arne
1
1996
Tree-decompositions of small pathwidth. Zbl 1184.05126
Telle, Jan Arne
1
2001
Edge-maximal graphs of branchwidth \(K\). Zbl 1200.05194
Paul, Christophe; Telle, Jan Arne
1
2005
On the complexity of reconstructing \(H\)-free graphs from their star systems. Zbl 1136.68459
Fomin, Fedor V.; Kratochvíl, Jan; Lokshtanov, Daniel; Mancini, Federico; Telle, Jan Arne
1
2008
Towards a taxonomy of techniques for designing parameterized algorithms. Zbl 1154.68561
Sloper, Christian; Telle, Jan Arne
1
2006
Characterization and recognition of digraphs of bounded Kelly-width. Zbl 1141.68545
Meister, Daniel; Telle, Jan Arne; Vatshelle, Martin
1
2007
Two birds with one stone: The best of branchwidth and treewidth with one algorithm. Zbl 1145.05320
Dorn, Frederic; Telle, Jan Arne
1
2006
PRO: a model for the design and analysis of efficient and scalable parallel algorithms. Zbl 1123.68140
Gebremedhin, Assefaw Hadish; Essaïdi, Mohamed; Guérin Lassous, Isabelle; Gustedt, Jens; Telle, Jan Arne
1
2006
Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches. Zbl 1229.05153
Paul, Christophe; Telle, Jan Arne
1
2009
Maximum matching width: new characterizations and a fast algorithm for dominating set. Zbl 1378.68082
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne
1
2015
Chordal digraphs. Zbl 1273.05089
Meister, Daniel; Telle, Jan Arne
1
2010
Branchwidth of chordal graphs. Zbl 1211.05167
Paul, Christophe; Telle, Jan Arne
1
2009
Mim-width. II. The feedback vertex set problem. Zbl 1442.05158
Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
6
2020
Mim-width. I. Induced path problems. Zbl 1437.05223
Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
3
2020
Mim-width. III. Graph powers and generalized distance domination problems. Zbl 1442.05157
Jaffke, Lars; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne
6
2019
The teaching size: computable teachers and learners for universal languages. Zbl 07097485
Telle, Jan Arne; Hernández-Orallo, José; Ferri, Cèsar
1
2019
A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width. Zbl 07228433
Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne
3
2018
Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width. Zbl 1443.68131
Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
2
2018
Maximum matching width: new characterizations and a fast algorithm for dominating set. Zbl 1395.05116
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne
1
2018
On satisfiability problems with a linear structure. Zbl 1398.68235
Gaspers, Serge; Papadimitriou, Christos H.; Sæther, Sigve Hortemo; Telle, Jan Arne
4
2017
A width parameter useful for chordal and co-comparability graphs. Zbl 1380.05151
Kang, Dong Yeap; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne
4
2017
A width parameter useful for chordal and co-comparability graphs. Zbl 06711880
Kang, Dong Yeap; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne
2
2017
Between treewidth and clique-width. Zbl 1345.05104
Sæther, Sigve Hortemo; Telle, Jan Arne
6
2016
The graph formulation of the union-closed sets conjecture. Zbl 1301.05183
Bruhn, Henning; Charbit, Pierre; Schaudt, Oliver; Telle, Jan Arne
7
2015
Solving #SAT and MaxSAT by dynamic programming. Zbl 1341.68204
Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin
5
2015
Recognizability equals definability for graphs of bounded treewidth and bounded chordality. Zbl 1346.05249
Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne
3
2015
Maximum matching width: new characterizations and a fast algorithm for dominating set. Zbl 1378.68082
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne
1
2015
Between treewidth and clique-width. Zbl 1409.05201
Sæther, Sigve Hortemo; Telle, Jan Arne
4
2014
Solving MaxSAT and #SAT on structured CNF formulas. Zbl 1423.68470
Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin
2
2014
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Zbl 1408.68111
Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin
23
2013
Feedback vertex set on graphs of low clique-width. Zbl 1257.05165
Bui-Xuan, Binh-Minh; Suchý, Ondřej; Telle, Jan Arne; Vatshelle, Martin
7
2013
Connecting terminals and 2-disjoint connected subgraphs. Zbl 1417.05112
Telle, Jan Arne; Villanger, Yngve
7
2013
Upper bounds on Boolean-width with applications to exact algorithms. Zbl 1407.68370
Rabinovich, Yuri; Telle, Jan Arne; Vatshelle, Martin
3
2013
The graph formulation of the union-closed sets conjecture. Zbl 1293.05165
Bruhn, Henning; Charbit, Pierre; Telle, Jan Arne
1
2013
Finding good decompositions for dynamic programming on dense graphs. Zbl 1352.68110
Hvidevold, Eivind Magnus; Sharmin, Sadia; Telle, Jan Arne; Vatshelle, Martin
4
2012
FPT algorithms for domination in biclique-free graphs. Zbl 1365.68291
Telle, Jan Arne; Villanger, Yngve
3
2012
Chordal digraphs. Zbl 1256.05088
Meister, Daniel; Telle, Jan Arne
3
2012
Boolean-width of graphs. Zbl 1225.68133
Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin
25
2011
On the complexity of reconstructing \(H\)-free graphs from their star systems. Zbl 1230.05215
Fomin, Fedor V.; Kratochvíl, Jan; Lokshtanov, Daniel; Mancini, Federico; Telle, Jan Arne
4
2011
\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Zbl 1216.05153
Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin
11
2010
On the Boolean-width of a graph: structure and applications. Zbl 1310.05193
Adler, Isolde; Bui-Xuan, Binh-Minh; Rabinovich, Yuri; Renault, Gabriel; Telle, Jan Arne; Vatshelle, Martin
9
2010
Generalized graph clustering: recognizing \((p,q)\)-cluster graphs. Zbl 1309.68153
Heggernes, Pinar; Lokshtanov, Daniel; Nederlof, Jesper; Paul, Christophe; Telle, Jan Arne
6
2010
Recognizing digraphs of Kelly-width 2. Zbl 1216.05160
Meister, Daniel; Telle, Jan Arne; Vatshelle, Martin
5
2010
Chordal digraphs. Zbl 1273.05089
Meister, Daniel; Telle, Jan Arne
1
2010
Interval completion is fixed parameter tractable. Zbl 1227.05241
Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne
25
2009
Boolean-width of graphs. Zbl 1273.68273
Bui-Xuan, B.-M.; Telle, J. A.; Vatshelle, M.
3
2009
Feedback vertex set on graphs of low cliquewidth. Zbl 1267.05247
Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin
2
2009
Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm. Zbl 1211.05065
Dorn, Frederic; Telle, Jan Arne
2
2009
Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches. Zbl 1229.05153
Paul, Christophe; Telle, Jan Arne
1
2009
Branchwidth of chordal graphs. Zbl 1211.05167
Paul, Christophe; Telle, Jan Arne
1
2009
Locally constrained graph homomorphisms and equitable partitions. Zbl 1205.05141
Fiala, Jiří; Paulusma, Daniël; Telle, Jan Arne
7
2008
Leaf powers and their properties: Using the trees. Zbl 1183.68425
Fellows, Michael R.; Meister, Daniel; Rosamond, Frances A.; Sritharan, R.; Telle, Jan Arne
5
2008
On the complexity of reconstructing \(H\)-free graphs from their star systems. Zbl 1136.68459
Fomin, Fedor V.; Kratochvíl, Jan; Lokshtanov, Daniel; Mancini, Federico; Telle, Jan Arne
1
2008
Interval completion with few edges. Zbl 1232.68074
Heggernes, Pinar; Paul, Christophe; Teile, Jan Arne; Villanger, Yngve
10
2007
Planar decompositions and the crossing number of graphs with an excluded minor. Zbl 1120.05063
Wood, David R.; Telle, Jan Arne
6
2007
Planar decompositions and the crossing number of graphs with an excluded minor. Zbl 1185.05050
Wood, David R.; Telle, Jan Arne
3
2007
Characterization and recognition of digraphs of bounded Kelly-width. Zbl 1141.68545
Meister, Daniel; Telle, Jan Arne; Vatshelle, Martin
1
2007
Towards a taxonomy of techniques for designing parameterized algorithms. Zbl 1154.68561
Sloper, Christian; Telle, Jan Arne
1
2006
Two birds with one stone: The best of branchwidth and treewidth with one algorithm. Zbl 1145.05320
Dorn, Frederic; Telle, Jan Arne
1
2006
PRO: a model for the design and analysis of efficient and scalable parallel algorithms. Zbl 1123.68140
Gebremedhin, Assefaw Hadish; Essaïdi, Mohamed; Guérin Lassous, Isabelle; Gustedt, Jens; Telle, Jan Arne
1
2006
Computing minimal triangulations in time \(O(n^{\alpha}\log n) = o(n ^{2.376})\). Zbl 1105.05066
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve
19
2005
Graph searching, elimination trees, and a generalization of bandwidth. Zbl 1082.68082
Fomin, Fedor V.; Heggernes, Pinar; Telle, Jan Arne
12
2005
New tools and simpler algorithms for branchwidth. Zbl 1162.68503
Paul, Christophe; Telle, Jan Arne
5
2005
Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\). Zbl 1297.05120
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve
4
2005
Tree-decompositions of small pathwidth. Zbl 1067.68108
Telle, Jan Arne
3
2005
Matrix and graph orders derived from locally constrained graph homomorphisms. Zbl 1156.05338
Fiala, Jiří; Paulusma, Daniël; Telle, Jan Arne
3
2005
Edge-maximal graphs of branchwidth \(K\). Zbl 1200.05194
Paul, Christophe; Telle, Jan Arne
1
2005
Finding \(k\) disjoint triangles in an arbitrary graph. Zbl 1112.68418
Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne
25
2004
Space-efficient construction variants of dynamic programming. Zbl 1102.68720
Bodlaender, Hans L.; Telle, Jan Arne
2
2004
Iterated colorings of graphs. Zbl 1038.05022
Hedetniemi, Sandra M.; Hedetniemi, Stephen T.; McRae, Alice A.; Parks, Dee; Telle, Jan Arne
1
2004
Multicoloring trees. Zbl 1054.68016
Halldórsson, Magnús M.; Kortsarz, Guy; Proskurowski, Andrzej; Salman, Ravit; Shachnai, Hadas; Telle, Jan Arne
9
2003
Graph coloring on coarse grained multicomputers. Zbl 1029.68114
Gebremedhin, Assefaw Hadish; Guérin Lassous, Isabelle; Gustedt, Jens; Telle, Jan Arne
4
2003
Generalized \(H\)-coloring and \(H\)-covering of trees. Zbl 1094.68609
Fiala, Jiří; Heggernes, Pinar; Kristiansen, Petter; Telle, Jan Arne
2
2003
The treewidth of Java programs. Zbl 1014.68883
Gustedt, Jens; Mæhle, Ole A.; Telle, Jan Arne
7
2002
Generalized \(H\)-coloring and \(H\)-covering of trees. Zbl 1022.68095
Fiala, Jiří; Heggernes, Pinar; Kristiansen, Petter; Telle, Jan Arne
2
2002
A practical algorithm for making filled graphs minimal. Zbl 0952.68104
Blair, J. R. S.; Heggernes, P.; Telle, J. A.
18
2001
Tree-decompositions of small pathwidth. Zbl 1184.05126
Telle, Jan Arne
1
2001
Independent sets with domination constraints. Zbl 0939.05063
Halldórsson, Magnús M.; Kratochvíl, Jan; Telle, Jan Arne
14
2000
Generalized \(H\)-coloring of graphs. Zbl 1044.68129
Kristiansen, Petter; Telle, Jan Arne
13
2000
Memory requirements for table computations in partial \(k\)-tree algorithms. Zbl 0959.68096
Aspvall, B.; Proskurowski, A.; Telle, J. A.
9
2000
Mod-2 independence and domination in graphs. Zbl 1320.05121
Halldórsson, Magnús M.; Kratochvíl, Jan; Telle, Jan Arne
4
2000
Classes of graphs with restricted interval models. Zbl 0930.05083
Proskurowski, Andrzej; Telle, Jan Arne
10
1999
Mod-2 independence and domination in graphs. Zbl 0943.05081
Halldórsson, Magnús M.; Kratochvíl, Jan; Telle, Jan Arne
3
1999
Partitioning graphs into generalized dominating sets. Zbl 0905.68100
Heggernes, Pinar; Telle, Jan Arne
22
1998
Complexity of graph covering problems. Zbl 0911.68076
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
17
1998
Linear-time register allocation for a fixed number of register. Zbl 0930.68016
Bodlaender, Hans; Gustedt, Jens; Telle, Jan Arne
13
1998
Algorithms for vertex partitioning problems on partial \(k\)-trees. Zbl 0885.68118
Telle, Jan Arne; Proskurowski, Andrzej
97
1997
Covering regular graphs. Zbl 0895.05049
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
20
1997
Complexity of colored graph covers. I: Colored directed multigraphs. Zbl 0890.68095
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
8
1997
Making an arbitrary filled graph minimal by removing fill edges. Zbl 0886.05104
Blair, Jean R. S.; Heggernes, Pinar; Telle, Jan Arne
1
1996
Characterization of domination-type parameters in graphs. Zbl 0801.05058
Telle, Jan Arne
8
1993
Efficient sets in partial \(k\)-trees. Zbl 0787.68083
Telle, Jan Arne; Proskurowski, Andrzej
1
1993
all top 5

Cited by 661 Authors

29 Telle, Jan Arne
17 Paulusma, Daniël
16 Fomin, Fedor V.
15 Bodlaender, Hans L.
14 Heggernes, Pinar
13 Fiala, Jiří
13 Henning, Michael Anthony
13 Thilikos, Dimitrios M.
11 Hattingh, Johannes H.
11 Kratochvíl, Jan
11 Kwon, Ojoung
10 Joubert, Ernst J.
10 Lokshtanov, Daniel
9 Golovach, Petr A.
9 Gutin, Gregory Z.
9 Vatshelle, Martin
8 Papadopoulos, Charis
8 Pilipczuk, Michał
8 Wang, Jianxin
7 Niedermeier, Rolf
7 Szeider, Stefan
7 Todinca, Ioan
7 Villanger, Yngve
7 Yeo, Anders
6 Jaffke, Lars
6 Kim, Eun Jung
6 Kratsch, Dieter
6 Mancini, Federico
6 Marx, Dániel
6 Paul, Christophe
6 Perez, Anthony
6 Sæther, Sigve Hortemo
5 Berry, Anne
5 Bui-Xuan, Binh-Minh
5 Cardoso, Domingos Moreira
5 Crespelle, Christophe
5 Dereniowski, Dariusz
5 Feng, Qilong
5 Haynes, Teresa W.
5 Hell, Pavol
5 Kanté, Mamadou Moustapha
5 van ’t Hof, Pim
4 Chen, Jian-er
4 Habib, Michel A.
4 Halldórsson, Magnús Mar
4 Huang, Jing
4 Klavík, Pavel
4 Lampis, Michael
4 Nederlof, Jesper
4 Nishizeki, Takao
4 Rossmanith, Peter
4 Sau, Ignasi
4 Saurabh, Saket
4 Strømme, Torstein J. F.
4 Tesař, Marek
4 Van Leeuwen, Erik Jan
4 Zhou, Xiao
3 Abu-Khzam, Faisal N.
3 Adler, Isolde
3 Belmonte, Rémy
3 Bergougnoux, Benjamin
3 Brandstädt, Andreas
3 Bruhn, Henning
3 Chalopin, Jérémie
3 Cygan, Marek
3 Desormeaux, Wyatt J.
3 Dorn, Frederic
3 Dyer, Danny D.
3 Feder, Tomás
3 Fellows, Michael Ralph
3 Fernau, Henning
3 Ganian, Robert
3 Guillemot, Sylvain
3 Guo, Jiong
3 Hedetniemi, Stephen Travis
3 Hliněný, Petr
3 Konstantinidis, Athanasios L.
3 Liedloff, Mathieu
3 Meister, Daniel
3 Mengel, Stefan
3 Mezzini, Mauro
3 Munaro, Andrea
3 Panda, Bhawani Sankar
3 Pilipczuk, Marcin L.
3 Rama, Paula
3 Rao, Michaël
3 Schaudt, Oliver
3 Simonet, Geneviève
3 Uhlmann, Johannes
3 Xia, Ge
3 Yang, Boting
2 Agrawal, Akanksha
2 Alber, Jochen
2 Aldi, Marco
2 Araújo, Júlio César Silva
2 Bendraouche, Mohamed
2 Bessy, Stéphane
2 Betzler, Nadja
2 Bichler, Martin
2 Biedl, Therese C.
...and 561 more Authors
all top 5

Cited in 63 Serials

69 Discrete Applied Mathematics
67 Theoretical Computer Science
34 Algorithmica
26 Discrete Mathematics
20 Journal of Computer and System Sciences
19 Information Processing Letters
14 European Journal of Combinatorics
8 SIAM Journal on Discrete Mathematics
8 Journal of Combinatorial Optimization
7 Graphs and Combinatorics
6 Theory of Computing Systems
6 Journal of Discrete Algorithms
5 Information and Computation
5 Discussiones Mathematicae. Graph Theory
5 Discrete Optimization
4 Journal of Graph Theory
4 Algorithms
3 Computers & Operations Research
3 European Journal of Operational Research
3 Linear Algebra and its Applications
3 Distributed Computing
3 The Electronic Journal of Combinatorics
3 Computer Science Review
2 Artificial Intelligence
2 Networks
2 SIAM Journal on Computing
2 Journal of Parallel and Distributed Computing
2 International Journal of Foundations of Computer Science
2 Discrete Mathematics, Algorithms and Applications
2 ACM Transactions on Computation Theory
1 American Mathematical Monthly
1 Computers & Mathematics with Applications
1 Communications in Mathematical Physics
1 Mathematics of Computation
1 Applied Mathematics and Computation
1 Czechoslovak Mathematical Journal
1 Information Sciences
1 Journal of Applied Probability
1 Journal of Combinatorial Theory. Series B
1 Quaestiones Mathematicae
1 Operations Research Letters
1 Journal of Complexity
1 Discrete & Computational Geometry
1 Annals of Operations Research
1 Machine Learning
1 Computational Geometry
1 Journal of Global Optimization
1 The Australasian Journal of Combinatorics
1 Cybernetics and Systems Analysis
1 Journal of Scheduling
1 Journal of Graph Algorithms and Applications
1 Journal of Discrete Mathematical Sciences & Cryptography
1 Acta Mathematica Sinica. English Series
1 RAIRO. Operations Research
1 ACM Transactions on Computational Logic
1 ACM Journal of Experimental Algorithmics
1 Journal of Applied Logic
1 Contributions to Discrete Mathematics
1 Mathematics in Computer Science
1 Ars Mathematica Contemporanea
1 International Journal of Combinatorics
1 ACM Transactions on Algorithms
1 Prikladnaya Diskretnaya Matematika

Citations by Year