J. Telle

Publications143
h-index27
Citations2,438
Highly Influential Citations167
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • H. Bodlaender
  • 400 Publications, 16,518 Citations
  • F. Fomin
  • 453 Publications, 10,893 Citations
  • M. Vatshelle
  • 50 Publications, 745 Citations
  • M. Fellows
  • 317 Publications, 15,828 Citations
  • Publications
  • Influence
Algorithms for Vertex Partitioning Problems on Partial k-Trees
In this paper, we consider a large class of vertex partitioning problems and apply to them the theory of algorithm design for problems restricted to partial k-trees. We carefully describe the details… Expand
  • 296
  • 22
  • PDF
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
TLDR
We provide dynamic programming algorithms for many locally checkable vertex subset and vertex partitioning problems. Expand
  • 49
  • 9
  • PDF
Partitioning Graphs into Generalized Dominating Sets
TLDR
We study the computational complexity of partitioning the vertices of a graph into generalized dominating sets. Expand
  • 89
  • 8
Complexity of Domination-Type Problems in Graphs
  • J. Telle
  • Mathematics, Computer Science
  • Nord. J. Comput.
  • 1 March 1994
TLDR
We give a characterization of these graph parameters that unifies their definitions, facilitates their common algorithmic treatment and allows for their uniform complexity classification. Expand
  • 111
  • 6
  • PDF
Boolean-Width of Graphs
TLDR
We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Expand
  • 37
  • 6
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems
TLDR
We give a formal description of vertex subset optimization problems in a class that includes several variants of domination, independence, efficiency and packing. Expand
  • 71
  • 5
Interval Completion Is Fixed Parameter Tractable
TLDR
We present an algorithm with runtime $O(k^{2k}n^3m) for the k-Interval Completion problem of deciding whether a graph on n vertices and m edges can be made into an interval graph by adding at most k edges. Expand
  • 65
  • 5
  • PDF
Interval completion with few edges
We present an algorithm with runtime O(k(2k)n3 * m) for the following NP-complete problem: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k… Expand
  • 41
  • 5
  • PDF
Generalized H-Coloring of Graphs
TLDR
For fixed simple graph H and subsets of natural numbers σ and ρ, we introduce (H, σ, ρ)-colorings as generalizations of H-colorings of graphs. Expand
  • 27
  • 5
Solving #SAT and MAXSAT by Dynamic Programming
TLDR
We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT using similar, but more modern, graph structure tools. Expand
  • 27
  • 5
  • PDF