Andrei Asinowski

According to our database1, Andrei Asinowski authored at least 35 papers between 2001 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 





Down-step statistics in generalized Dyck paths.
CoRR, 2020

Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata.
Algorithmica, 2020

On Lattice Paths with Marked Patterns: Generating Functions and Multivariate Gaussian Distribution.
Proceedings of the 31st International Conference on Probabilistic, 2020

Point sets with many non-crossing perfect matchings.
Comput. Geom., 2018

Polycubes with Small Perimeter Defect.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects.
Proceedings of the Language and Automata Theory and Applications, 2018

Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem.
Proceedings of the 29th International Conference on Probabilistic, 2018

Recovering highly-complex linear recurrences of integer sequences.
Inf. Process. Lett., 2017

Enumerating Polyominoes with Fixed Perimeter Defect.
Electron. Notes Discret. Math., 2017

Counting triangulations of some classes of subdivided convex polygons.
Eur. J. Comb., 2017

Triangulations with Few Ears: Symmetry Classes and Disjointness.
Integers, 2016

Counting triangulations of balanced subdivisions of convex polygons.
Electron. Notes Discret. Math., 2016

Counting houses of Pareto optimal matchings in the house allocation problem.
Discret. Math., 2016

Quasi-parallel segments and characterization of unique bichromatic matchings.
J. Comput. Geom., 2015

Point sets with many non-crossing matchings.
CoRR, 2015

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

Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position.
Electron. J. Comb., 2015

Cut equivalence of d-dimensional guillotine partitions.
Discret. Math., 2014

Counting One-sided Exchange Stable Matchings.
CoRR, 2014

Formulae for Polyominoes on Twisted Cylinders.
Proceedings of the Language and Automata Theory and Applications, 2014

Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3.
Discret. Math., 2013

Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations.
Electron. J. Comb., 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Vertex Intersection Graphs of Paths on a Grid.
J. Graph Algorithms Appl., 2012

A polyominoes-permutations injection and tree-like convex polyominoes.
J. Comb. Theory, Ser. A, 2012

Some properties of edge intersection graphs of single-bend paths on a grid.
Discret. Math., 2012

String graphs of k-bend paths on a grid.
Electron. Notes Discret. Math., 2011

Proper n-Cell Polycubes in n - 3 Dimensions.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Edge intersection graphs of systems of paths on a grid with a bounded number of bends.
Discret. Appl. Math., 2009

Dyck paths with coloured ascents.
Eur. J. Comb., 2008

Suballowable sequences and geometric permutations.
Discret. Math., 2008

Suballowable sequences of permutations.
Electron. Notes Discret. Math., 2006

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

Forbidden Families of Geometric Permutations in R<sup>d</sup>.
Discret. Comput. Geom., 2005

The triples of geometric permutations for families of disjoint translates.
Discret. Math., 2001