DOIAbstract
AbstractWe prove that recognizing string graphs (i.e., intersection graphs of curves in the plane) and some related problems are NP-hard
AbstractWe prove that recognizing string graphs (i.e., intersection graphs of curves in the plane) and some related problems are NP-hard
We show that string graphs can be recognized in nondeterministic exponential time by giving an expo...
Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point ...
In this paper we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn gr...
AbstractA string graph is the intersection graph of a set of curves in the plane. Each curve is repr...
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented ...
AbstractWe prove that recognizing string graphs (i.e., intersection graphs of curves in the plane) a...
A graph is called a string graph if its vertices can be represented by continuous curves ("strings"...
AbstractString graphs (intersection graphs of curves in the plane) were originally studied in connec...
This thesis is devoted to the outer and grounded string representations of graphs and their subclass...
AbstractDNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet....
String graphs are the intersection graphs of curves in the plane. Asinowski et al. [JGAA 2012] intro...
We show that string graphs can be recognized in nondeterministic exponential time by giving an expon...
AbstractWe show that string graphs can be recognized in nondeterministic exponential time by giving ...
DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this...
AbstractWe provide a construction of a graph on O(n) vertices which can be represented as the inters...
We show that string graphs can be recognized in nondeterministic exponential time by giving an expo...
Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point ...
In this paper we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn gr...
AbstractA string graph is the intersection graph of a set of curves in the plane. Each curve is repr...
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented ...
AbstractWe prove that recognizing string graphs (i.e., intersection graphs of curves in the plane) a...
A graph is called a string graph if its vertices can be represented by continuous curves ("strings"...
AbstractString graphs (intersection graphs of curves in the plane) were originally studied in connec...
This thesis is devoted to the outer and grounded string representations of graphs and their subclass...
AbstractDNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet....
String graphs are the intersection graphs of curves in the plane. Asinowski et al. [JGAA 2012] intro...
We show that string graphs can be recognized in nondeterministic exponential time by giving an expon...
AbstractWe show that string graphs can be recognized in nondeterministic exponential time by giving ...
DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this...
AbstractWe provide a construction of a graph on O(n) vertices which can be represented as the inters...
We show that string graphs can be recognized in nondeterministic exponential time by giving an expo...
Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point ...
In this paper we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn gr...
Add to ORKG