The following pages link to Recognizing string graphs in NP (Q5917583):
Displaying 41 items.
- Improved enumeration of simple topological graphs (Q377494) (← links)
- Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces (Q464617) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- Spiraling and folding: the word view (Q548656) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- Spatial reasoning in a fuzzy region connection calculus (Q835806) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets (Q2088073) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Almost all string graphs are intersection graphs of plane convex sets (Q2189736) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Bounds on the bend number of split and cocomparability graphs (Q2322713) (← links)
- Planarity of streamed graphs (Q2333805) (← links)
- Segment representations with small resolution (Q2338214) (← links)
- Drawing interactive Euler diagrams from region connection calculus specifications (Q2629218) (← links)
- Untangling two systems of noncrossing curves (Q2630858) (← links)
- Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search (Q2938524) (← links)
- Order-Preserving 1-String Representations of Planar Graphs (Q2971141) (← links)
- WORD EQUATIONS WITH ONE UNKNOWN (Q3086244) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- Folding and Spiralling: The Word View (Q3503458) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- A New Approach to Exact Crossing Minimization (Q3541091) (← links)
- Word Equations with One Unknown (Q3637238) (← links)
- Intersection Graphs of Rays and Grounded Segments (Q4585058) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Separators in region intersection graphs (Q4638049) (← links)
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs (Q5014117) (← links)
- Hanani--Tutte and Hierarchical Partial Planarity (Q5058130) (← links)
- (Q5116474) (← links)
- Almost all string graphs are intersection graphs of plane convex sets (Q5116528) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- The Complexity of Several Realizability Problems for Abstract Topological Graphs (Q5452218) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- Refining the hierarchies of classes of geometric intersection graphs (Q5892293) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- General lower bounds for the minor crossing number of graphs (Q5962348) (← links)
- B0-VPG Representation of AT-free Outerplanar Graphs (Q6202310) (← links)
