Recommendations
Cited in
(only showing first 100 items - show all)- The properties of random trees
- LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies
- The Erdős-Szekeres problem for non-crossing convex sets
- Formalizing generalized maps in Coq
- Fringe analysis for extquick: An in situ distributive external sorting algorithm
- Optimal heapsort algorithm
- Bounding and computing obstacle numbers of graphs
- Design and formal proof of a new optimal image segmentation program with hypermaps
- A scheme for constructing ordered minimal perfect hashing functions
- On the number of simple arrangements of five double pseudolines
- Coding and counting arrangements of pseudolines
- Three-dimensional convex hull as a fruitful source of diagrams
- Computing pseudotriangulations via branched coverings
- scientific article; zbMATH DE number 778197 (Why is no real title available?)
- Many order types on integer grids of polynomial size
- Why is the 3D Delaunay triangulation difficult to construct?
- Reprint of: Extreme point and halving edge search in abstract order types
- Faradžev Read-type enumeration of non-isomorphic CC systems
- Space saving generalization of \(B\)-trees with \(2/3\) utilization
- On the Folkman-Lawrence topological representation theorem for oriented matroids of rank 3
- Improved deterministic parallel integer sorting
- Parallel hashing algorithms
- Computer solution to the 17-point Erdős-Szekeres problem
- Formal specification and proofs for the topology and classification of combinatorial surfaces
- Designing and proving correct a convex hull algorithm with hypermaps in Coq
- Enumeration of Gelfand-Cetlin type reduced words
- Extreme point and halving edge search in abstract order types
- Matroids from modules
- Towards optimal parallel bucket sorting
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
- A SAT attack on the Erdős-Szekeres conjecture
- Enumeration, Counting, and Random Generation of Ladder Lotteries
- Convex hulls of random order types
- Computational geometry and discrete computations
- Ramsey numbers and monotone colorings
- Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
- A characterization of heaps and its applications
- New algorithms and bounds for halving pseudolines
- Optimal reconfiguration of optimal ladder lotteries
- Bicolored order types
- On Delaunay oriented matroids for convex distance functions
- On the computation of units and class numbers by a generalization of Lagrange's algorithm
- Qualitative reasoning with directional relations
- Permutation statistics and (k,)-hook Schur functions
- Arrangements of pseudocircles: on circularizability
- Enumerating topological \((n_k)\)-configurations
- Cambrian acyclic domains: counting \(c\)-singletons
- Condorcet domains of tiling type
- Multitriangulations, pseudotriangulations and primitive sorting networks
- The ring of k-regular sequences
- Cell complexes, oriented matroids and digital geometry.
- The use and usefulness of numeration systems
- A note on some tree similarity measures
- A combinatorial version of Sylvester's four-point problem
- Efficient enumeration of all ladder lotteries and its application
- Two extensions of the Erdős-Szekeres problem
- On unimodular tournaments
- Every bit counts: the binary representation of typed data and programs
- XSAT and NAE-SAT of linear CNF classes
- Parking functions, valet functions and priority queues
- An optimal algorithm for reconstructing point set order types from radial orderings
- Exact computation of the sign of a finite sum
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Enumeration of simple complete topological graphs
- On maximal weakly separated set-systems
- A note on some algorithms for matroids
- Plücker environments, wiring and tiling diagrams, and weakly separated set-systems
- Principal -cone for a tree
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Static competitive facility location: an overview of optimisation approaches.
- q-hook length formulas for forests
- Data reduction for graph coloring problems
- Reconstructing point set order types from radial orderings
- A verified ODE solver and the Lorenz attractor
- The expected linearity of a simple equivalence algorithm
- The sorting order on a Coxeter group.
- Data reduction for graph coloring problems
- On Some SAT-Variants over Linear Formulas
- An adaptive subdivision method for root finding of univariate polynomials
- Resurrecting the asymptotics of linear recurrences
- On some extremal results for order types
- The complexity of order type isomorphism
- The Dirac-Goodman-Pollack conjecture
- Creating order in sequence spaces with simple machines
- Mahonian statistics on labeled forests
- Implementing Euclid's straightedge and compass constructions in type theory
- A survey of techniques in applied computational complexity
- A new measure of presortedness
- Exploiting few inversions when sorting: Sequential and parallel algorithms
- A search problem on graphs which generalizes some group testing problems with two defectives
- Realization spaces of arrangements of convex bodies
- A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
- Grassmannians and pseudosphere arrangements
- Combining Isabelle and QEPCAD-B in the Prover’s Palette
- Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes
- Topological art in simple galleries
- Geodesic order types
- Cycle action on treelike structures.
- Reconstructing Point Set Order Types from Radial Orderings
- Initial hulls and zero dimensional objects
This page was built for publication: Axioms and hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1202183)
