Pages that link to "Item:Q4018853"
From MaRDI portal
The following pages link to The Problem of Compatible Representatives (Q4018853):
Displaying 50 items.
- The complexity of separating points in the plane (Q262254) (← links)
- A polynomial time solution for labeling a rectilinear map (Q293240) (← links)
- Following a curve with the discrete Fréchet distance (Q300222) (← links)
- Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions (Q335346) (← links)
- Removing local extrema from imprecise terrains (Q419504) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- Matching colored points with rectangles (Q511687) (← links)
- Regular augmentation of planar graphs (Q747622) (← links)
- The reach of axis-aligned squares in the plane (Q783038) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Matching points with rectangles and squares (Q955221) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Approximate map labeling is in \(\Omega (n\log n)\) (Q1338784) (← links)
- Polynomial time algorithms for three-label point labeling. (Q1401261) (← links)
- The hardness of placing street names in a Manhattan type map (Q1608339) (← links)
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- On the complexity of clustering with relaxed size constraints in fixed dimension (Q1704856) (← links)
- Algorithmic aspects of proportional symbol maps (Q1957642) (← links)
- Computing orbit period in max-min algebra (Q1962019) (← links)
- Dominating set of rectangles intersecting a straight line (Q2025079) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q2196563) (← links)
- Dispersing and grouping points on planar segments (Q2232600) (← links)
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410) (← links)
- Systems of distant representatives in Euclidean space (Q2347967) (← links)
- Generalised arc consistency for the AllDifferent constraint: an empirical survey (Q2389692) (← links)
- Computing conforming partitions of orthogonal polygons with minimum stabbing number (Q2402271) (← links)
- The complexity of reasoning with global constraints (Q2454812) (← links)
- A practical map labeling algorithm. (Q2482896) (← links)
- Approximation algorithms on consistent dynamic map labeling (Q2629235) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- On the Complexity of Clustering with Relaxed Size Constraints (Q2830056) (← links)
- Exploring and Triangulating a Region by a Swarm of Robots (Q3088095) (← links)
- Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line (Q3467840) (← links)
- Balanced location on a graph (Q4351195) (← links)
- (Q4389705) (← links)
- Non-crossing Paths with Geographic Constraints (Q4625135) (← links)
- EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING (Q4682165) (← links)
- LABELING A RECTILINEAR MAP WITH SLIDING LABELS (Q4682173) (← links)
- LABELING POINTS WITH CIRCLES (Q4682174) (← links)
- The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← 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)
- Convex Quadrangulations of Bichromatic Point Sets (Q5149559) (← links)
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE (Q5299997) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- LABELING POINTS ON A SINGLE LINE (Q5696540) (← links)
