default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrei Asinowski
Person information
- affiliation: University of Klagenfurt, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Andrei Asinowski, Cyril Banderier:
From geometry to generating functions: rectangulations and permutations. CoRR abs/2401.05558 (2024)- [i11]Andrei Asinowski, Jean Cardinal, Stefan Felsner, Éric Fusy:
Combinatorics of rectangulations: Old and new bijections. CoRR abs/2402.01483 (2024) - 2022
- [j26]Andrei Asinowski
, Benjamin Hackl, Sarah J. Selkirk:
Down-step statistics in generalized Dyck paths. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - 2021
- [j25]Andrei Asinowski, Cyril Banderier, Benjamin Hackl:
Flip-sort and combinatorial aspects of pop-stack sorting. Discret. Math. Theor. Comput. Sci. 22(2) (2021) - 2020
- [j24]Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata. Algorithmica 82(3): 386-428 (2020) - [c8]Andrei Asinowski, Cyril Banderier:
On Lattice Paths with Marked Patterns: Generating Functions and Multivariate Gaussian Distribution. AofA 2020: 1:1-1:16 - [i10]Andrei Asinowski, Cyril Banderier, Benjamin Hackl:
Flip-sort and combinatorial aspects of pop-stack sorting. CoRR abs/2003.04912 (2020) - [i9]Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk:
Down-step statistics in generalized Dyck paths. CoRR abs/2007.15562 (2020)
2010 – 2019
- 2018
- [j23]Andrei Asinowski, Günter Rote:
Point sets with many non-crossing perfect matchings. Comput. Geom. 68: 7-33 (2018) - [c7]Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem. AofA 2018: 10:1-10:14 - [c6]Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects. LATA 2018: 195-206 - [c5]Andrei Asinowski, Gill Barequet, Yufei Zheng:
Polycubes with Small Perimeter Defect. SODA 2018: 93-100 - 2017
- [j22]Andrei Asinowski, Christian Krattenthaler, Toufik Mansour:
Counting triangulations of some classes of subdivided convex polygons. Eur. J. Comb. 62: 92-114 (2017) - [j21]Andrei Asinowski, Gill Barequet, Yufei Zheng:
Enumerating Polyominoes with Fixed Perimeter Defect. Electron. Notes Discret. Math. 61: 61-67 (2017) - [j20]Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet, Ronnie Barequet:
Recovering highly-complex linear recurrences of integer sequences. Inf. Process. Lett. 127: 62-66 (2017) - 2016
- [j19]Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting houses of Pareto optimal matchings in the house allocation problem. Discret. Math. 339(12): 2919-2932 (2016) - [j18]Andrei Asinowski, Christian Krattenthaler, Toufik Mansour:
Counting triangulations of balanced subdivisions of convex polygons. Electron. Notes Discret. Math. 54: 73-78 (2016) - [j17]Andrei Asinowski, Alon Regev:
Triangulations with Few Ears: Symmetry Classes and Disjointness. Integers 16: A5 (2016) - [i8]Andrei Asinowski, Christian Krattenthaler, Toufik Mansour:
Counting triangulations of some classes of subdivided convex polygons. CoRR abs/1604.02870 (2016) - 2015
- [j16]Oswin Aichholzer, Andrei Asinowski, Tillmann Miltzow:
Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position. Electron. J. Comb. 22(1): 1 (2015) - [j15]Andrei Asinowski, Tillmann Miltzow, Günter Rote:
Quasi-parallel segments and characterization of unique bichromatic matchings. J. Comput. Geom. 6(1): 185-219 (2015) - [i7]Andrei Asinowski, Günter Rote:
Point sets with many non-crossing matchings. CoRR abs/1502.04925 (2015) - [i6]Andrei Asinowski:
The number of non-crossing perfect plane matchings is minimized (almost) only by point sets in convex position. CoRR abs/1502.05332 (2015) - 2014
- [j14]Andrei Asinowski, Gill Barequet, Toufik Mansour, Ron Y. Pinter:
Cut equivalence of d-dimensional guillotine partitions. Discret. Math. 331: 165-174 (2014) - [c4]Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting Houses of Pareto Optimal Matchings in the House Allocation Problem. FUN 2014: 301-312 - [c3]Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet, Ronnie Barequet:
Formulae for Polyominoes on Twisted Cylinders. LATA 2014: 76-87 - [i5]Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting One-sided Exchange Stable Matchings. CoRR abs/1401.5354 (2014) - [i4]Oswin Aichholzer, Andrei Asinowski, Tillmann Miltzow:
Disjoint compatibility graph of non-crossing matchings of points in convex position. CoRR abs/1403.5546 (2014) - 2013
- [j13]Andrei Asinowski, Gill Barequet, Mireille Bousquet-Mélou, Toufik Mansour, Ron Y. Pinter:
Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations. Electron. J. Comb. 20(2): 35 (2013) - [j12]Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet:
Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3. Discret. Math. 313(10): 1078-1086 (2013) - [c2]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013: 73-84 - [i3]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013) - [i2]Andrei Asinowski, Tillmann Miltzow, Günter Rote:
Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings. CoRR abs/1302.4400 (2013) - 2012
- [j11]Andrei Asinowski, Bernard Ries:
Some properties of edge intersection graphs of single-bend paths on a grid. Discret. Math. 312(2): 427-440 (2012) - [j10]Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet:
A polyominoes-permutations injection and tree-like convex polyominoes. J. Comb. Theory A 119(3): 503-520 (2012) - [j9]Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern:
Vertex Intersection Graphs of Paths on a Grid. J. Graph Algorithms Appl. 16(2): 129-150 (2012) - 2011
- [j8]Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern:
String graphs of k-bend paths on a grid. Electron. Notes Discret. Math. 37: 141-146 (2011) - [c1]Andrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote:
Proper n-Cell Polycubes in n - 3 Dimensions. COCOON 2011: 180-191
2000 – 2009
- 2009
- [j7]Andrei Asinowski, Andrew Suk:
Edge intersection graphs of systems of paths on a grid with a bounded number of bends. Discret. Appl. Math. 157(14): 3174-3180 (2009) - 2008
- [j6]Andrei Asinowski:
Suballowable sequences and geometric permutations. Discret. Math. 308(20): 4745-4762 (2008) - [j5]Andrei Asinowski, Toufik Mansour:
Dyck paths with coloured ascents. Eur. J. Comb. 29(5): 1262-1279 (2008) - 2006
- [j4]Andrei Asinowski, Meir Katchalski:
The Maximal Number of Geometric Permutations for n Disjoint Translates of a Convex Set in R Is Omega(n). Discret. Comput. Geom. 35(3): 473-480 (2006) - [j3]Andrei Asinowski:
Suballowable sequences of permutations. Electron. Notes Discret. Math. 25: 17-18 (2006) - [i1]Andrei Asinowski:
Suballowable sequences of permutations. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - 2005
- [j2]Andrei Asinowski, Meir Katchalski:
Forbidden Families of Geometric Permutations in Rd. Discret. Comput. Geom. 34(1): 1-10 (2005) - 2001
- [j1]Andrei Asinowski, Andreas F. Holmsen, Meir Katchalski:
The triples of geometric permutations for families of disjoint translates. Discret. Math. 241(1-3): 23-32 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-28 23:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
