Recommendations
Cited in
(only showing first 100 items - show all)- The properties of random trees
- Sweeps, arrangements and signotopes
- Enumerating topological \((n_k)\)-configurations
- Swapping labeled tokens on graphs
- Split sequence hash search
- Principal \(\Gamma\)-cone for a tree
- Ramsey numbers and monotone colorings
- The ring of \(k\)-regular sequences
- On Some SAT-Variants over Linear Formulas
- Data reduction for graph coloring problems
- Condorcet domains of tiling type
- On the computation of units and class numbers by a generalization of Lagrange's algorithm
- On the number of simple arrangements of five double pseudolines
- Design and formal proof of a new optimal image segmentation program with hypermaps
- Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
- A new measure of presortedness
- Towards optimal parallel bucket sorting
- Data reduction for graph coloring problems
- Creating order in sequence spaces with simple machines
- A characterization of heaps and its applications
- Enumeration of simple complete topological graphs
- Coding and counting arrangements of pseudolines
- Formal specification and proofs for the topology and classification of combinatorial surfaces
- XSAT and NAE-SAT of linear CNF classes
- Why is the 3D Delaunay triangulation difficult to construct?
- On the Folkman-Lawrence topological representation theorem for oriented matroids of rank 3
- Efficient enumeration of all ladder lotteries and its application
- The expected linearity of a simple equivalence algorithm
- LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies
- Multitriangulations, pseudotriangulations and primitive sorting networks
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
- Optimal heapsort algorithm
- The use and usefulness of numeration systems
- A SAT attack on the Erdős-Szekeres conjecture
- A note on some tree similarity measures
- Computer solution to the 17-point Erdős-Szekeres problem
- The method of creative telescoping
- The node visit cost of brother trees
- Multitriangulations as complexes of star polygons
- The sorting order on a Coxeter group.
- Permutation statistics and \((k,\ell)\)-hook Schur functions
- Mahonian statistics on labeled forests
- An adaptive subdivision method for root finding of univariate polynomials
- A note on some algorithms for matroids
- Qualitative reasoning with directional relations
- On maximal weakly separated set-systems
- On Delaunay oriented matroids for convex distance functions
- Designing and proving correct a convex hull algorithm with hypermaps in Coq
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Resurrecting the asymptotics of linear recurrences
- On the relationship between son-trees and symmetric binary B-trees
- Geodesic order types
- Reprint of: Extreme point and halving edge search in abstract order types
- Computing pseudotriangulations via branched coverings
- Exploiting few inversions when sorting: Sequential and parallel algorithms
- Matroids from modules
- Formalizing generalized maps in Coq
- A combinatorial version of Sylvester's four-point problem
- A scheme for constructing ordered minimal perfect hashing functions
- Plücker environments, wiring and tiling diagrams, and weakly separated set-systems
- q-hook length formulas for forests
- Grassmannians and pseudosphere arrangements
- Improved deterministic parallel integer sorting
- A survey of techniques in applied computational complexity
- Static competitive facility location: an overview of optimisation approaches.
- A characterization of one-element commutation classes
- Two extensions of the Erdős-Szekeres problem
- Many order types on integer grids of polynomial size
- On some extremal results for order types
- The complexity of order type isomorphism
- The Dirac-Goodman-Pollack conjecture
- Cycle action on treelike structures.
- Every bit counts: the binary representation of typed data and programs
- A verified ODE solver and the Lorenz attractor
- scientific article; zbMATH DE number 778197 (Why is no real title available?)
- Robustness and Randomness
- An optimal algorithm for reconstructing point set order types from radial orderings
- Realization spaces of arrangements of convex bodies
- Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes
- Topological art in simple galleries
- Automated mathematical discovery and verification: minimizing pentagons in the plane
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Exact computation of the sign of a finite sum
- On unimodular tournaments
- Arrangements of pseudocircles: on circularizability
- Optimal reconfiguration of optimal ladder lotteries
- Combining Isabelle and QEPCAD-B in the Prover’s Palette
- Cell complexes, oriented matroids and digital geometry.
- Three-dimensional convex hull as a fruitful source of diagrams
- Implementing Euclid's straightedge and compass constructions in type theory
- Matricial characterization of tournaments with maximum number of diamonds
- Enumeration of Gelfand-Cetlin type reduced words
- Faradžev Read-type enumeration of non-isomorphic CC systems
- Bounding and computing obstacle numbers of graphs
- The 2-page crossing number of \(K_{n}\)
- The Erdős-Szekeres problem for non-crossing convex sets
- Initial hulls and zero dimensional objects
- Orientation of convex sets
- Extreme point and halving edge search in abstract order types
- Enumeration, Counting, and Random Generation of Ladder Lotteries
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)
