scientific article; zbMATH DE number 2209732
From MaRDI portal
Publication:5692715
zbMath1079.52505MaRDI QIDQ5692715
Publication date: 28 September 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37)
Related Items (51)
Diverse partitions of colored points ⋮ A note on harmonic subgraphs in labelled geometric graphs ⋮ A survey of mass partitions ⋮ Plane bichromatic trees of low degree ⋮ Alternating paths and cycles of minimum length ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Near equipartitions of colored point sets ⋮ Carathéodory's theorem in depth ⋮ Geometric planar networks on bichromatic collinear points ⋮ Monochromatic empty triangles in two-colored point sets ⋮ Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane ⋮ Pruning boxes in a box-based classification method ⋮ Supervised box clustering ⋮ Monochromatic partitioning of colored points by lines ⋮ Linear transformation distance for bichromatic matchings ⋮ On Hamiltonian alternating cycles and paths ⋮ The hamburger theorem ⋮ Colored spanning graphs for set visualization ⋮ Colored ray configurations ⋮ A note on two geometric paths with few crossings for points labeled by integers in the plane ⋮ Computing optimal islands ⋮ On geometric graphs on point sets in the plane ⋮ Universal point sets for 2-coloured trees ⋮ Unnamed Item ⋮ Bounds for point recolouring in geometric graphs ⋮ Balanced partitions of 3-colored geometric sets in the plane ⋮ Encompassing colored planar straight line graphs ⋮ Planar Bichromatic Bottleneck Spanning Trees ⋮ Weight-Equitable Subdivision of Red and Blue Points in the Plane ⋮ Connecting Red Cells in a Bicolour Voronoi Diagram ⋮ Separated Matchings and Small Discrepancy Colorings ⋮ Geometric Graphs in the Plane Lattice ⋮ Stabbing segments with rectilinear objects ⋮ Long alternating paths in bicolored point sets ⋮ Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon ⋮ Structural properties of bichromatic non-crossing matchings ⋮ Noncrossing monochromatic subtrees and staircases in 0-1 matrices ⋮ Computing the coarseness with strips or boxes ⋮ Bicolored graph partitioning, or: gerrymandering at its worst ⋮ Drawing colored graphs with constrained vertex positions and few bends per edge ⋮ On the connectivity of visibility graphs ⋮ Extended box clustering for classification problems ⋮ Rainbow polygons for colored point sets in the plane ⋮ Hamiltonian Alternating Paths on Bicolored Double-Chains ⋮ The balanced connected subgraph problem ⋮ Vertex-colored encompassing graphs ⋮ Planar bichromatic minimum spanning trees ⋮ Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position ⋮ Monochromatic geometric k-factors in red-blue sets with white and Steiner points ⋮ Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph ⋮ Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points
This page was built for publication:
