The following pages link to Andrei Asinowski (Q397168):
Displaying 38 items.
- (Q221583) (redirect page) (← links)
- Cut equivalence of \(d\)-dimensional guillotine partitions (Q397169) (← links)
- Counting triangulations of balanced subdivisions of convex polygons (Q510541) (← links)
- Counting triangulations of some classes of subdivided convex polygons (Q518180) (← links)
- Separable \(d\)-permutations and guillotine partitions (Q659578) (← links)
- A polyominoes-permutations injection and tree-like convex polyominoes (Q662025) (← links)
- Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
- Dyck paths with coloured ascents (Q925029) (← links)
- Suballowable sequences and geometric permutations (Q942103) (← links)
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends (Q967371) (← links)
- Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects (Q1647701) (← links)
- Enumerating polyominoes with fixed perimeter defect (Q1689885) (← links)
- Point sets with many non-crossing perfect matchings (Q1699275) (← links)
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3 (Q1945952) (← links)
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations (Q1953524) (← links)
- Polycubes with small perimeter defect (Q2093266) (← links)
- Generating functions for lattice paths with several forbidden patterns (Q2199903) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata (Q2292858) (← links)
- Recovering highly-complex linear recurrences of integer sequences (Q2398508) (← links)
- Forbidden families of geometric permutations in \(\mathbb R^{d}\) (Q2486854) (← links)
- The maximal number of geometric permutations for \(n\) disjoint translates of a convex set in \(\mathbb R\) is \(\Omega(n)\) (Q2492643) (← links)
- Triangulations with few ears: symmetry classes and disjointness (Q2830343) (← links)
- String graphs of k-bend paths on a grid (Q2840697) (← links)
- Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings (Q2970420) (← links)
- Proper n-Cell Polycubes in n − 3 Dimensions (Q3087949) (← links)
- Vertex Intersection Graphs of Paths on a Grid (Q3143733) (← links)
- Suballowable sequences of permutations (Q3439457) (← links)
- (Q4607878) (← links)
- (Q4993532) (← links)
- (Q5074767) (← links)
- Counting Houses of Pareto Optimal Matchings in the House Allocation Problem (Q5265030) (← links)
- (Q5404254) (← links)
- Formulae for Polyominoes on Twisted Cylinders (Q5404902) (← links)
- (Q5692696) (← links)
- (Q5874399) (← links)
- The triples of geometric permutations for families of disjoint translates (Q5951924) (← links)
- Down-step statistics in generalized Dyck paths (Q6045418) (← links)
