Pages that link to "Item:Q3357538"
From MaRDI portal
The following pages link to Noncrossing Subgraphs in Topological Layouts (Q3357538):
Displaying 24 items.
- 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)
- Configurations with few crossings in topological graphs (Q876504) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- The complexity of detecting crossingfree configurations in the plane (Q1317860) (← links)
- Satisfiability of co-nested formulas (Q1323332) (← links)
- The complexity of induced minors and related problems (Q1346772) (← links)
- On the complexity of trial and error for constraint satisfaction problems (Q1678168) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Complete graph drawings up to triangle mutations (Q2136833) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- Polyline drawings with topological constraints (Q2290634) (← links)
- Advancements on SEFE and partitioned book embedding problems (Q2339452) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- Topological Drawings of Complete Bipartite Graphs (Q2961537) (← links)
- Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph (Q3439409) (← links)
- (Q4691772) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Bad drawings of small complete graphs (Q5206933) (← links)
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs (Q5384459) (← links)
- The Complexity of Several Realizability Problems for Abstract Topological Graphs (Q5452218) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)