scientific article; zbMATH DE number 431988
From MaRDI portal
Publication:3138746
Recommendations
- Suballowable sequences and geometric permutations
- Enumerating order types for small sets with applications
- Enumerating order types for small point sets with applications
- The complexity of point configurations
- Allowable double permutation sequences, arrangements of double pseudolines of Michel Pocchiola and their applications to planar families of convex sets
Cited in
(46)- Stabbing information of a simple polygon
- Better lower bounds on detecting affine and spherical degeneracies
- A Ramsey property of order types
- Illumination by floodlights
- An orderly algorithm and some applications in finite geometry
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
- On the number of directions determined by a three-dimensional points set
- The number of extreme triples of a planar point set
- Minimal tangent visibility graphs
- Enumeration of Gelfand-Cetlin type reduced words
- A farewell to Ricky Pollack
- A positive fraction mutually avoiding sets theorem
- Approximating the rectilinear crossing number
- Higher-order Erdős-Szekeres theorems
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- Non-stretchable pseudo-visibility graphs
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Approximating the rectilinear crossing number
- Graphs with large obstacle numbers
- Allowable double permutation sequences, arrangements of double pseudolines of Michel Pocchiola and their applications to planar families of convex sets
- A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
- Enumerating topological (n_k)-configurations
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations
- Subquadratic encodings for point configurations
- Recognizing Visibility Graphs of Triangulated Irregular Networks
- Enumerating order types for small sets with applications
- Helly-type problems
- Arrangements of pseudocircles: on circularizability
- Sweeps, arrangements and signotopes
- The Polyhedral Geometry of Pivot Rules and Monotone Paths
- Bounding and computing obstacle numbers of graphs
- Underlying flag polymatroids
- The Dirac-Goodman-Pollack conjecture
- Covering the edges of a complete geometric graph with convex polygons
- Orientation of convex sets
- A pseudo-algorithmic separation of lines from pseudo-lines
- A canonical tree decomposition for chirotopes
- A canonical tree decomposition for order types, and some applications
- Bounding and computing obstacle numbers of graphs
- Orientation of good covers
- Linear embeddings of random complexes
- Crossing and non-crossing families
- Using oriented matroids to bound the monotone rank of a matrix
- Hamiltonicity and colorings of arrangement graphs
- Suballowable sequences and geometric permutations
- Neighborly embedded manifolds
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 Q3138746)
