Pages that link to "Item:Q1276946"
From MaRDI portal
The following pages link to Label placement by maximum independent set in rectangles (Q1276946):
Displaying 50 items.
- A polynomial time solution for labeling a rectilinear map (Q293240) (← links)
- Labeling a rectilinear map more efficiently (Q294599) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- Coloring intersection graphs of \(x\)-monotone curves in the plane (Q485004) (← links)
- Matching colored points with rectangles (Q511687) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- A new fast heuristic for labeling points (Q987799) (← links)
- An upper bound for cubicity in terms of boxicity (Q1025528) (← links)
- A note on maximum independent sets in rectangle intersection graphs (Q1029038) (← links)
- Optimal algorithm for a special point-labeling problem (Q1029054) (← links)
- Polynomial time algorithms for three-label point labeling. (Q1401261) (← links)
- Hardness of approximation for non-overlapping local alignments. (Q1427808) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371) (← links)
- An algorithmic framework for labeling network maps (Q1750356) (← links)
- Anchored rectangle and square packings (Q1751252) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Trimming of graphs, with application to point labeling (Q1959389) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- Limit theory of combinatorial optimization for random geometric graphs (Q2075326) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Collision-free routing problem with restricted L-path (Q2161235) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- On grids in topological graphs (Q2249043) (← links)
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling (Q2359523) (← links)
- Faster approximation for maximum independent set on unit disk graph (Q2398507) (← links)
- Admission control with advance reservations in simple networks (Q2466012) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Approximation algorithms on consistent dynamic map labeling (Q2629235) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- On disjoint crossing families in geometric graphs (Q2857373) (← links)
- Mixed Map Labeling (Q2947031) (← links)
- Coloring and Maximum Independent Set of Rectangles (Q3088088) (← links)
- DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION (Q3401890) (← links)
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
- On the Approximability of Orthogonal Order Preserving Layout Adjustment (Q3449805) (← links)
- Approximation Algorithms for Geometric Intersection Graphs (Q3508563) (← links)
