Andrei Asinowski
Academic positions:
2005-2006: Postdoctoral COMBSTRU position at Department of Mathematics, Bielefeld University, Germany (Information Theory and Complexity working group, supervisor Rudolf Ahlswede).
2006-2008: Postdoctoral position at Caesarea Rothschild Institute for Interdisciplinary Applications of Computer Sciences, University of Haifa, Israel (host Toufik Mansour).
2008-2010: Postdoctoral position at Department of Mathematics, Technion - Israel Institute of Technology, Haifa, Israel.
2010-2011: Research staff member at CGGC - The Center for Graphics and Geometric Computing, Technion - Israel Institute of Technology, Haifa, Israel (host Gill Barequet).
Currently (from March 2012): Postdoctoral position in Freie Universität, Berlin; member of EuroGiga / ComPoSe.


M. Sc. Thesis:
A. Asinowski. Geometric permutations for planar families of disjoint translates of a convex set.
Supervisor M. Katchalski.
Technion - Israel Institute of Technology, 1999. [pdf]

Ph. D. Thesis:
A. Asinowski. Geometric permutations in the plane and in Euclidean spaces of higher dimension.
Supervisor M. Katchalski.
Technion - Israel Institute of Technology, 2005. [pdf]

Publications:

  1. A. Asinowski, A. Holmsen, and M. Katchalski.
    The triples of geometric permutations for families of disjoint translations.
    Discrete Math. 241 (2001), 23-32.
    doi:10.1016/S0012-365X(01)00107-8. [pdf]

  2. A. Asinowski, A. Holmsen, M. Katchalski, and H. Tverberg.
    Geometric permutations of large families of translates.
    In: Discrete and Computational Geometry: The Goodman-Pollack Festschrift, B. Aronov, S. Basu, J. Pach, M. Sharir (eds.), vol. 25 of Algorithms and Combinatorics, Springer-Verlag, Germany, 2003, 157-176. [pdf]

  3. A. Asinowski and M. Katchalski.
    Forbidden families of geometric permutations in R d.
    Discrete Comput. Geom. 34 (2005), 1-10.
    doi:10.1007/s00454-004-1110-x. [pdf]

  4. A. Asinowski and M. Katchalski.
    The maximal number of geometric permutations for n disjoint translates of a convex set in R 3 is Ω(n).
    Discrete Comput. Geom. 35 (2006), 473-480.
    doi:10.1007/s00454-005-1219-6. [pdf]

  5. A. Asinowski and T. Mansour.
    Dyck paths with coloured ascents.
    European J. of Combinatorics 29 (2008), 1262-1279.
    doi:10.1016/j.ejc.2007.06.005. [pdf]

  6. A. Asinowski.
    Suballowable sequences and geometric permutations.
    Discrete Math. 308 (2008), 4745-4762.
    doi:10.1016/j.disc.2007.08.086. [pdf]

  7. A. Asinowski and T. Mansour.
    Separable d-permutations and Guillotine partitions.
    Annals of Comb. 14 (2010) 17-43.
    doi:10.1007/s00026-010-0043-8

  8. A. Asinowski and A. H. Suk.
    Edge intersection graphs of a system of paths in a grid.
    Discrete Applied Math., 157 (2009), 3174-3180.
    doi:10.1016/j.dam.2009.06.015.

  9. A. Asinowski and B. Ries.
    Some properties of edge intersection graphs of single-bend paths on a grid.
    Discrete Math. 212 (2012), 427-440.
    doi:10.1016/j.disc.2011.10.005

  10. G. Aleksandrowicz, A. Asinowski, and G. Barequet.
    A polyominoes-permutations injection and counting tree-like convex polyominoes.
    J. of Combinatorial Theory (Series A), 119 (2012), 503-520.
    doi:10.1016/j.jcta.2011.10.008

  11. A. Asinowski, E. Cohen, M. C. Golumbic, V. Limouzy, M. Lipshteyn, and M. Stern.
    Vertex Intersection Graphs of Paths on a Grid.
    Journal of Graph Algorithms and Applications, 16(2) (2012), 129-150.

  12. A. Asinowski, G. Barequet, R. Barequet, and G. Rote.
    Proper n-cell polycubes in n-3 dimensions.
    Journal of Integer Sequences, Vol. 15 (2012), Issue 8, Article 12.8.4.