Pages that link to "Item:Q644821"

The following pages link to Coding and counting arrangements of pseudolines (Q644821):

Displaying 18 items.

• Improved enumeration of simple topological graphs (Q377494) (← links)
• Ramsey numbers and monotone colorings (Q1713498) (← links)
• Cambrian acyclic domains: counting \(c\)-singletons (Q2006983) (← links)
• Many order types on integer grids of polynomial size (Q2096371) (← links)
• Constructing large peak-pit Condorcet domains (Q2112304) (← links)
• Enumeration of Gelfand-Cetlin type reduced words (Q2121754) (← links)
• Optimal reconfiguration of optimal ladder lotteries (Q2227490) (← links)
• Realization spaces of arrangements of convex bodies (Q2408184) (← links)
• THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS (Q2874619) (← links)
• Reconstructing Point Set Order Typesfrom Radial Orderings (Q2942609) (← links)
• The Bundled Crossing Number (Q2961534) (← links)
• Reconstructing Point Set Order Types from Radial Orderings (Q2988723) (← links)
• Subquadratic Encodings for Point Configurations (Q5115787) (← links)
• New algorithms and bounds for halving pseudolines (Q5918765) (← links)
• Bounding and computing obstacle numbers of graphs (Q6542540) (← links)
• The complexity of order type isomorphism (Q6624165) (← links)
• Inscribable order types (Q6624174) (← links)
• The Dirac-Goodman-Pollack conjecture (Q6624175) (← links)