Searching for authors named "Jan Arne Telle" – sorted by Relevance.
-
Partitioning Problems: Characterization, Complexity and Algorithms on Partial k-Trees
- Vertex Partitioning Problems: Characterization, Complexity and Algorithms on Partial k-Trees Jan
- Cited by 2 (1 self) – Add To MetaCart
-
Tree-Decompositions of Small Pathwidth
- Tree-decompositions of small pathwidth Jan Arne Telle Department of Informatics, University
- Cited by 2 (1 self) – Add To MetaCart
-
Edge-maximal graphs of branchwidth k
- Edge-maximal graphs of branchwidth k Christophe Paul 1 CNRS - LIRMM, Montpellier, France Jan Arne
- Cited by 1 (1 self) – Add To MetaCart
-
Two birds with one stone: the best of branchwidth and treewidth with one algorithm
- and Jan Arne Telle Department of Informatics, University of Bergen, Bergen, Norway Abstract. In this paper
- Cited by 4 (3 self) – Add To MetaCart
-
Classes of Graphs with Restricted Interval Models
- and Information Sciences University of Oregon Eugene, Oregon, USA Jan Arne Telle Department of Informatics
- Cited by 1 (0 self) – Add To MetaCart
-
I V
- submission) a Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle REPORT NO 378 november 2008 a The content
- Add To MetaCart
-
Partitioning Graphs Into Generalized Dominating Sets
- Department of Informatics, University of Bergen N-5020 Bergen, Norway Pinar.Heggernes@(email omitted); JAN ARNE
- Cited by 15 (1 self) – Add To MetaCart
-
Algorithms For Vertex Partitioning Problems On Partial k-Trees
- ALGORITHMS FOR VERTEX PARTITIONING PROBLEMS ON PARTIAL K-TREES JAN ARNE TELLE y AND ANDRZEJ
- Cited by 30 (2 self) – Add To MetaCart
-
Mod-2 Independence and Domination in Graphs
- Mod-2 Independence and Domination in Graphs Magn'us M. Halld'orsson 1;3 , Jan Kratochv'il 2
- Add To MetaCart
-
Graph searching, elimination trees, and a generalization of bandwidth
- Heggernes, and Jan Arne Telle ffomin, pinar, telleg@(email omitted); Department of Informatics, University
- Cited by 4 (0 self) – Add To MetaCart

