The triples of geometric permutations for families of disjoint translates. - Andrei Asinowski; Andreas F. Holmsen; Meir Katchalski (Discret. Math., 2001)

Forbidden Families of Geometric Permutations in Rd. - Andrei Asinowski; Meir Katchalski (Discret. Comput. Geom., 2005)

The Maximal Number of Geometric Permutations for n Disjoint Translates of a Convex Set in R Is Omega(n). - Andrei Asinowski; Meir Katchalski (Discret. Comput. Geom., 2006)

Suballowable sequences of permutations. - Andrei Asinowski (Electron. Notes Discret. Math., 2006)

Suballowable sequences and geometric permutations. - Andrei Asinowski (Discret. Math., 2008)

Dyck paths with coloured ascents. - Andrei Asinowski; Toufik Mansour (Eur. J. Comb., 2008)

Edge intersection graphs of systems of paths on a grid with a bounded number of bends. - Andrei Asinowski; Andrew Suk (Discret. Appl. Math., 2009)

Proper n-Cell Polycubes in n - 3 Dimensions. - Andrei Asinowski; Gill Barequet; Ronnie Barequet; Günter Rote (COCOON, 2011)

String graphs of k-bend paths on a grid. - Andrei Asinowski; Elad Cohen; Martin Charles Golumbic; Vincent Limouzy; Marina Lipshteyn; Michal Stern (Electron. Notes Discret. Math., 2011)

Some properties of edge intersection graphs of single-bend paths on a grid. - Andrei Asinowski; Bernard Ries (Discret. Math., 2012)

A polyominoes-permutations injection and tree-like convex polyominoes. - Gadi Aleksandrowicz; Andrei Asinowski; Gill Barequet (J. Comb. Theory A, 2012)

Vertex Intersection Graphs of Paths on a Grid. - Andrei Asinowski; Elad Cohen; Martin Charles Golumbic; Vincent Limouzy; Marina Lipshteyn; Michal Stern (J. Graph Algorithms Appl., 2012)

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. - Andrei Asinowski; Jean Cardinal; Nathann Cohen; Sébastien Collette; Thomas Hackl; Michael Hoffmann 001; Kolja B. Knauer; Stefan Langerman; Michal Lason; Piotr Micek; Günter Rote; Torsten Ueckerdt (WADS, 2013)

Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations. - Andrei Asinowski; Gill Barequet; Mireille Bousquet-Mélou; Toufik Mansour; Ron Y. Pinter (Electron. J. Comb., 2013)

Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3. - Gadi Aleksandrowicz; Andrei Asinowski; Gill Barequet (Discret. Math., 2013)

Formulae for Polyominoes on Twisted Cylinders. - Gadi Aleksandrowicz; Andrei Asinowski; Gill Barequet; Ronnie Barequet (LATA, 2014)

Counting One-sided Exchange Stable Matchings. - Andrei Asinowski; Balázs Keszegh; Tillmann Miltzow (CoRR, 2014)

Cut equivalence of d-dimensional guillotine partitions. - Andrei Asinowski; Gill Barequet; Toufik Mansour; Ron Y. Pinter (Discret. Math., 2014)

Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position. - Oswin Aichholzer; Andrei Asinowski; Tillmann Miltzow (Electron. J. Comb., 2015)

The number of non-crossing perfect plane matchings is minimized (almost) only by point sets in convex position. - Andrei Asinowski (CoRR, 2015)

Point sets with many non-crossing matchings. - Andrei Asinowski; Günter Rote (CoRR, 2015)

Quasi-parallel segments and characterization of unique bichromatic matchings. - Andrei Asinowski; Tillmann Miltzow; Günter Rote (J. Comput. Geom., 2015)

Counting houses of Pareto optimal matchings in the house allocation problem. - Andrei Asinowski; Balázs Keszegh; Tillmann Miltzow (Discret. Math., 2016)

Counting triangulations of balanced subdivisions of convex polygons. - Andrei Asinowski; Christian Krattenthaler; Toufik Mansour (Electron. Notes Discret. Math., 2016)

Triangulations with Few Ears: Symmetry Classes and Disjointness. - Andrei Asinowski; Alon Regev (Integers, 2016)

Counting triangulations of some classes of subdivided convex polygons. - Andrei Asinowski; Christian Krattenthaler; Toufik Mansour (Eur. J. Comb., 2017)

Enumerating Polyominoes with Fixed Perimeter Defect. - Andrei Asinowski; Gill Barequet; Yufei Zheng (Electron. Notes Discret. Math., 2017)

Recovering highly-complex linear recurrences of integer sequences. - Gadi Aleksandrowicz; Andrei Asinowski; Gill Barequet; Ronnie Barequet (Inf. Process. Lett., 2017)

Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem. - Andrei Asinowski; Axel Bacher; Cyril Banderier; Bernhard Gittenberger (AofA, 2018)

Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects. - Andrei Asinowski; Axel Bacher; Cyril Banderier; Bernhard Gittenberger (LATA, 2018)

Polycubes with Small Perimeter Defect. - Andrei Asinowski; Gill Barequet; Yufei Zheng (SODA, 2018)

Point sets with many non-crossing perfect matchings. - Andrei Asinowski; Günter Rote (Comput. Geom., 2018)

On Lattice Paths with Marked Patterns: Generating Functions and Multivariate Gaussian Distribution. - Andrei Asinowski; Cyril Banderier (AofA, 2020)

Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata. - Andrei Asinowski; Axel Bacher; Cyril Banderier; Bernhard Gittenberger (Algorithmica, 2020)

Flip-sort and combinatorial aspects of pop-stack sorting. - Andrei Asinowski; Cyril Banderier; Benjamin Hackl (Discret. Math. Theor. Comput. Sci., 2021)

Down-step statistics in generalized Dyck paths. - Andrei Asinowski; Benjamin Hackl; Sarah J. Selkirk (Discret. Math. Theor. Comput. Sci., 2022)

From geometry to generating functions: rectangulations and permutations. - Andrei Asinowski; Cyril Banderier (CoRR, 2024)

Combinatorics of rectangulations: old and new bijections. - Andrei Asinowski; Jean Cardinal; Stefan Felsner; Éric Fusy (Comb. Theory, 2025)