Pages that link to "Item:Q5299997"
From MaRDI portal
The following pages link to OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE (Q5299997):
Displaying 43 items.
- Independent dominating set problem revisited (Q476836) (← links)
- On the proper orientation number of bipartite graphs (Q484321) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Regular augmentation of planar graphs (Q747622) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds (Q2037107) (← links)
- Upward planar drawings with three and more slopes (Q2151439) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- Complexity of domination in triangulated plane graphs (Q2178742) (← links)
- On compatible triangulations with a minimum number of Steiner points (Q2192383) (← links)
- Extending simple drawings (Q2206853) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- On the geometric red-blue set cover problem (Q2232240) (← links)
- Dispersing and grouping points on planar segments (Q2232600) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- Polygon simplification by minimizing convex corners (Q2272403) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- \((k,p)\)-planarity: a relaxation of hybrid planarity (Q2664946) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- Snapping Graph Drawings to the Grid Optimally (Q2961511) (← links)
- Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Q2980910) (← links)
- Reconstruction of Weakly Simple Polygons from Their Edges (Q3177902) (← links)
- Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity (Q4625134) (← links)
- The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← links)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
- Maximum Area Axis-Aligned Square Packings. (Q5005181) (← links)
- Extending Partial Orthogonal Drawings (Q5014122) (← links)
- Extending Partial Orthogonal Drawings (Q5084696) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Drawing Clustered Planar Graphs on Disk Arrangements (Q5216285) (← links)
- Multilevel Planarity (Q5856666) (← links)
- Upward Planar Drawings with Three and More Slopes (Q5886036) (← links)
- Particle-based assembly using precise global control (Q5896892) (← links)
- Complexity of fall coloring for restricted graph classes (Q5918283) (← links)
- On the minimum consistent subset problem (Q5918312) (← links)
- Level-planar drawings with few slopes (Q5918472) (← links)
- Particle-based assembly using precise global control (Q5918538) (← links)
- The dispersive art gallery problem (Q6092310) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- Exact algorithms and hardness results for geometric red-blue hitting set problem (Q6111475) (← links)
- Unit-length rectangular drawings of graphs (Q6117041) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q6117080) (← links)
