Recognition and proper coloring of unit segment intersection graphs
From MaRDI portal
Cites work
- A better heuristic for orthogonal graph drawings
- A bipartite strengthening of the crossing Lemma
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
- A Separator Theorem for Planar Graphs
- A separator theorem for string graphs and its applications
- A special planar satisfiability problem and a consequence of its NP- completeness
- Algorithms for area-efficient orthogonal drawing
- Balanced line separators of unit disk graphs
- Chromatic scheduling and frequency assignment
- Computing the independence number of intersection graphs
- Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity
- Decidability of string graphs
- Decidability of string graphs
- Every planar graph is the intersection graph of segments in the plane (extended abstract)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- Fine-grained complexity of coloring unit disks and balls
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
- Geometric separator theorems and applications
- Graph theory with applications
- How many ways can one draw a graph?
- scientific article; zbMATH DE number 4200260 (Why is no real title available?)
- scientific article; zbMATH DE number 3981198 (Why is no real title available?)
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- Inapproximability of orthogonal compaction
- Intersection dimension of bipartite graphs
- Intersection graphs of curves in the plane
- Intersection graphs of segments
- Kontaktprobleme der konformen Abbildung.
- Models and solution techniques for frequency assignment problems
- Near-optimal separators in string graphs
- NP completeness of finding the chromatic index of regular graphs
- On intersection representations of co-planar graphs
- On the complexity of k-SAT
- On the complexity of orthogonal compaction
- On the exact complexity of Hamiltonian Cycle and \(q\)-Colouring in disk graphs
- Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams
- Optimality program in segment and string graphs
- Proper colorability of segment intersection graphs
- Recognizing string graphs in NP
- Recognizing string graphs is decidable
- Refining the hierarchies of classes of geometric intersection graphs
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
- Representing graphs by disks and balls (a survey of recognition-complexity results)
- Separator theorems and Turán-type results for planar intersection graphs
- Separators for sphere-packings and nearest neighbor graphs
- String graphs. II: Recognizing string graphs is NP-hard
- Subexponential algorithms for variants of homomorphism problem in string graphs
- Subexponential Parameterized algorithms on disk graphs (extended abstract)
- The frame dimension and the complete overlap dimension of a graph
- The NP-Completeness of Edge-Coloring
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism
- Topology of Thin Film RC Circuits
- Unit disk graph recognition is NP-hard
- Which problems have strongly exponential complexity?
This page was built for publication: Recognition and proper coloring of unit segment intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891153)
