Add to ORKGAbstract We present an algorithm with runtime O(k 2k n 3 m) for the following NP-complete problem [9, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open questio
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
We study the design of fixed-parameter algorithms for problems already known to be solvable in polyn...
We initiate the study of a new parameterization of graph problems. In a multiple interval representa...
We give an algorithm with runtime O(k 2k n 3 m) for the NP-complete problem [GT35 in 6] of deciding ...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
Given an arbitrary graph G = (V,E) and a proper interval graph H = (V,F) with E ⊆ F we say that H i...
Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a sin...
AbstractFor a given graph G=(V,E), the interval completion problem of G is to find an edge set F suc...
AbstractA t-interval representation of a graph expresses it as the intersection graph of a family of...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
AbstractThis paper deals with the problem of adding edges to a graph such that the resulting graph b...
The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a sup...
The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a sup...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
We study the design of fixed-parameter algorithms for problems already known to be solvable in polyn...
We initiate the study of a new parameterization of graph problems. In a multiple interval representa...
We give an algorithm with runtime O(k 2k n 3 m) for the NP-complete problem [GT35 in 6] of deciding ...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
Given an arbitrary graph G = (V,E) and a proper interval graph H = (V,F) with E ⊆ F we say that H i...
Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a sin...
AbstractFor a given graph G=(V,E), the interval completion problem of G is to find an edge set F suc...
AbstractA t-interval representation of a graph expresses it as the intersection graph of a family of...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
AbstractThis paper deals with the problem of adding edges to a graph such that the resulting graph b...
The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a sup...
The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a sup...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
We study the design of fixed-parameter algorithms for problems already known to be solvable in polyn...
We initiate the study of a new parameterization of graph problems. In a multiple interval representa...