Publication:5692715

From MaRDI portal
Revision as of 05:37, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath1079.52505MaRDI QIDQ5692715

Atsushi Kaneko, Mikio Kano

Publication date: 28 September 2005



68Q25: Analysis of algorithms and problem complexity

52A37: Other problems of combinatorial convexity


Related Items

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, A survey of mass partitions, The balanced connected subgraph problem, Planar Bichromatic Bottleneck Spanning Trees, Monochromatic partitioning of colored points by lines, Alternating paths and cycles of minimum length, Monochromatic empty triangles in two-colored point sets, Computing optimal islands, Universal point sets for 2-coloured trees, Balanced partitions of 3-colored geometric sets in the plane, Computing the coarseness with strips or boxes, Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon, On the connectivity of visibility graphs, Extended box clustering for classification problems, Vertex-colored encompassing graphs, Diverse partitions of colored points, Bounds for point recolouring in geometric graphs, Long alternating paths in bicolored point sets, Bicolored graph partitioning, or: gerrymandering at its worst, Drawing colored graphs with constrained vertex positions and few bends per edge, Planar bichromatic minimum spanning trees, Plane bichromatic trees of low degree, 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, Stabbing segments with rectilinear objects, Rainbow polygons for colored point sets in the plane, Structural properties of bichromatic non-crossing matchings, Noncrossing monochromatic subtrees and staircases in 0-1 matrices, Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points, A note on harmonic subgraphs in labelled geometric graphs, Near equipartitions of colored point sets, Carathéodory's theorem in depth, Pruning boxes in a box-based classification method, Supervised box clustering, Encompassing colored planar straight line graphs, Discrete geometry on colored point sets in the plane -- a survey, Geometric planar networks on bichromatic collinear points, On geometric graphs on point sets in the plane, Monochromatic geometric k-factors in red-blue sets with white and Steiner points, Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane, Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position, Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph, Hamiltonian Alternating Paths on Bicolored Double-Chains