Pages that link to "Item:Q1276946"
From MaRDI portal
The following pages link to Label placement by maximum independent set in rectangles (Q1276946):
Displaying 22 items.
- On Map Labeling with Leaders (Q3644729) (← links)
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs (Q3655149) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- Minimum point-overlap labelling* (Q4999330) (← links)
- Evaluation of Labeling Strategies for Rotating Maps (Q5266612) (← links)
- Minimum Point-Overlap Labeling (Q5283379) (← links)
- Graph Drawing (Q5711599) (← links)
- (Q5743499) (← links)
- (Q5874486) (← links)
- Many disjoint edges in topological graphs (Q5890932) (← links)
- Optimizing active ranges for consistent dynamic map labeling (Q5902232) (← links)
- Disjoint edges in complete topological graphs (Q5917904) (← links)
- Many disjoint edges in topological graphs (Q5919826) (← links)
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
- Keep your distance: land division with separation (Q6114476) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
- A survey on variant domination problems in geometric intersection graphs (Q6536206) (← links)
- Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)
- New partitioning techniques and faster algorithms for approximate interval scheduling (Q6614114) (← links)
