Vertex intersection graphs of paths on a grid A Asinowski, E Cohen, MC Golumbic, V Limouzy, M Lipshteyn, M Stern Journal of Graph Algorithms and Applications 16 (2), 129-150, 2012 | 74 | 2012 |

Edge intersection graphs of systems of paths on a grid with a bounded number of bends A Asinowski, A Suk Discrete Applied Mathematics 157 (14), 3174-3180, 2009 | 38 | 2009 |

Orders induced by segments in floorplan partitions and (2-14-3, 3-41-2)-avoiding permutations A Asinowski, G Barequet, M Bousquet-Mélou, T Mansour, R Pinter arXiv preprint arXiv:1011.1889, 2010 | 30 | 2010 |

Some properties of edge intersection graphs of single-bend paths on a grid A Asinowski, B Ries Discrete Mathematics 312 (2), 427-440, 2012 | 29 | 2012 |

Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata A Asinowski, A Bacher, C Banderier, B Gittenberger Algorithmica 82 (3), 386-428, 2020 | 28 | 2020 |

Coloring hypergraphs induced by dynamic point sets and bottomless rectangles A Asinowski, J Cardinal, N Cohen, S Collette, T Hackl, M Hoffmann, ... Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013 | 26 | 2013 |

Pop-stack sorting and its image: permutations with overlapping runs A Asinowski, C Banderier, S Billey, B Hackl, S Linusson Acta Mathematica Universitatis Comenianae 88 (3), 395-402, 2019 | 24 | 2019 |

Separable *d*-Permutations and Guillotine PartitionsA Asinowski, T Mansour Annals of Combinatorics 14, 17-43, 2010 | 21 | 2010 |

Flip-sort and combinatorial aspects of pop-stack sorting A Asinowski, C Banderier, B Hackl Discrete Mathematics & Theoretical Computer Science 22 (Special issues), 2021 | 20 | 2021 |

Dyck paths with coloured ascents A Asinowski, T Mansour European Journal of Combinatorics 29 (5), 1262-1279, 2008 | 19 | 2008 |

Disjoint compatibility graph of non-crossing matchings of points in convex position O Aichholzer, A Asinowski, T Miltzow arXiv preprint arXiv:1403.5546, 2014 | 16 | 2014 |

Common transversals and geometric permutations A Asinowski Master's thesis, Technion IIT, Haifa, Israel, 1998 | 16 | 1998 |

String graphs of k-bend paths on a grid A Asinowski, E Cohen, MC Golumbic, V Limouzy, M Lipshteyn, M Stern Electronic Notes in Discrete Mathematics 37, 141-146, 2011 | 15 | 2011 |

Generating functions for lattice paths with several forbidden patterns A Asinowski, C Banderier, V Roitner Sém. Lothar. Combin. B 84, 265, 2020 | 14 | 2020 |

Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects A Asinowski, A Bacher, C Banderier, B Gittenberger International Conference on Language and Automata Theory and Applications …, 2018 | 14 | 2018 |

Point sets with many non-crossing perfect matchings A Asinowski, G Rote Computational Geometry 68, 7-33, 2018 | 14 | 2018 |

Quasi-parallel segments and characterization of unique bichromatic matchings A Asinowski, T Miltzow, G Rote arXiv preprint arXiv:1302.4400, 2013 | 13 | 2013 |

Enumerating polyominoes with fixed perimeter defect A Asinowski, G Barequet, Y Zheng Electronic Notes in Discrete Mathematics 61, 61-67, 2017 | 10 | 2017 |

Counting houses of Pareto optimal matchings in the house allocation problem A Asinowski, B Keszegh, T Miltzow Discrete Mathematics 339 (12), 2919-2932, 2016 | 10 | 2016 |

Proper *n*-Cell Polycubes in *n* − 3 DimensionsA Asinowski, G Barequet, R Barequet, G Rote Computing and Combinatorics: 17th Annual International Conference, COCOON …, 2011 | 10 | 2011 |