scientific article; zbMATH DE number 1017008

zbMATH Open0881.52001MaRDI QIDQ4339095FDOQ4339095

Publication date: 4 June 1997

Title of this publication is not available (Why is that?)

Recommendations

scientific article; zbMATH DE number 1749054
scientific article; zbMATH DE number 3846365
Combinatorial geometry and its algorithmic applications. The Alcalá lectures

arrangements density graph theory convexity combinatorial geometry convex sets coverings packings polygonal approximations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Other designs, configurations (05B30) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)

Cited In (only showing first 100 items - show all)

Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
On the stability of some Erdős-Ko-Rado type results
Independence numbers and chromatic numbers of some distance graphs
Dynamic coresets
Combinatorial geometry and its algorithmic applications. The Alcalá lectures
Inequalities between lattice packing and covering densities of centrally symmetric plane convex bodies
Improved results on geometric hitting set problems
Areas of triangles and Beck's theorem in planes over finite fields
On the diameter of separated point sets with many nearly equal distances
On the number of regular vertices of the union of Jordan regions
New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
An optimal extension of the centerpoint theorem
Drawing outerplanar graphs using thirteen edge lengths
Unit distances and diameters in Euclidean spaces
Title not available (Why is that?)
A PTAS for a disc covering problem using width-bounded separators
Covering the plane with copies of a convex disk
Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
Hitting sets when the VC-dimension is small
The geometry of Minkowski spaces -- a survey. I
Embedding a set of rational points in lower dimensions
Nearly equal distances and Szemerédi's regularity lemma
On large subgraphs with small chromatic numbers contained in distance graphs
Title not available (Why is that?)
Diameters of random distance graphs
Independence numbers of random subgraphs of a distance graph
Crossing-free segments and triangles in point configurations
Independence numbers of random subgraphs of distance graphs
Convexity and sumsets
Piercing quasi-rectangles-on a problem of Danzer and Rogers
On levels in arrangements of surfaces in three dimensions
The Szemerédi-Trotter theorem in the complex plane
Separator theorems and Turán-type results for planar intersection graphs
Pointed drawings of planar graphs
Packing and covering with centrally symmetric convex disks
The shortest distance among points in general position.
Hamiltonian paths in distance graphs
Monotone paths in line arrangements
Geometry and combinatorics of the cutting angle method
Opaque sets
Covering a rectangle with six and seven circles
On the number of edges in induced subgraphs of a special distance graph
A new estimate for the number of edges in induced subgraphs of a special distance graph
A non-linear lower bound for planar epsilon-nets
Packing, covering and tiling in two-dimensional spaces
Extremal problems for geometric hypergraphs
Configurations between geometry and combinatorics.
Spectral partitioning works: planar graphs and finite element meshes
Relative \((p,\varepsilon )\)-approximations in geometry
On some monotone path problems in line arrangements
Noncrossing monochromatic subtrees and staircases in 0-1 matrices
On the approximability of covering points by lines and related problems
On the maximum number of touching pairs in a finite packing of translates of a convex body
A semi-algebraic version of Zarankiewicz's problem
Drawing outerplanar graphs using three edge lengths
From harmonic analysis to arithmetic combinatorics
On distinct sums and distinct distances.
Problems related to a de Bruijn-Erdös theorem
On the chromatic number of some geometric type Kneser graphs
Gallai colorings of non-complete graphs
Distinct distances in planar point sets with forbidden 4-point patterns
A combinatorial problem on polynomials and rational functions
Disjoint edges in topological graphs and the tangled-thrackle conjecture
On the number of similar instances of a pattern in a finite set
Minimum vertex cover in ball graphs through local search
Erdös distance problem in vector spaces over finite fields
Chromatic numbers of spaces with forbidden monochromatic triangles
Independent set of intersection graphs of convex objects in 2D
Antipodality properties of finite sets in Euclidean space
Sets with few distinct distances do not have heavy lines
Coloring intersection graphs of \(x\)-monotone curves in the plane
Separable partitions
Estimate of the number of edges in special subgraphs of a distance graph
Incidences between points and generalized spheres over finite fields and related problems
Quantitative combinatorial geometry for continuous parameters
Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle
Flips in planar graphs
The number of edges in induced subgraphs of some distance graphs
The visible perimeter of an arrangement of disks
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
Random polytopes and the wet part for arbitrary probability distributions
The minimal volume of simplices containing a convex body
Edge integrity of nearest neighbor graphs and separator theorems
Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
A lower bound on opaque sets
On the chromatic number of an infinitesimal plane layer
Plane graphs with straight edges whose bounded faces are acute triangles
Approximating a convex body by a polytope using the epsilon-net theorem
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
On the number of points in general position in the plane
Traveling the boundary of Minkowski sums.
Approximation algorithms for polynomial-expansion and low-density graphs
On threshold probability for the stability of independent sets in distance graphs
On the shortest separating cycle
Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
Monotone twist maps and Dowker-type theorems
Title not available (Why is that?)
The density of Meissner polyhedra
System of unbiased representatives for a collection of bicolorings
The structure and number of global roundings of a graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339095)