Instytut Matematyki
Politechnika Łódzka

dr hab. inż.
Przemysław Gordinowicz
Zakład
Zakład Analizy Danych
Stanowisko
adiunkt badawczo-dydaktyczny
Pokój
161
Telefon
(+48) 42 631-36-33
e-mail
pgordin@p.lodz.pl
Publikacje w Czasopismach Naukowych
  • Filip Pietrusiak, Renata Wieteska, Przemysław Gordinowicz, On the Solvability of the Discrete s(x, ·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs, Entropy (100pkt.), 24 (2022) (2022), art. 1353
  • Szymon Głąb, Przemysław Gordinowicz, On n-saturated closed graphs, Results in Mathematics (100pkt.), 77 (2022) (2022), art. 184
  • Przemysław Gordinowicz, Paweł Twardowski, The polynomial method for list-colouring extendability of outerplanar graphs, Ars Mathematica Contemporanea (100 pkt.), 21 (2)) (2021), art. P2.08
  • Przemysław Gordinowicz, Erratum: The 2-surviving rate of planar graphs with average degree lower than 9/2, Journal of Graph Theory, 97 (3) (2021), 466-469
  • Szymon Głąb, Przemysław Gordinowicz, Filip Strobin, Dense free subgroups of automorphism groups of homogeneous partially ordered sets, Forum Mathematicum (100 pkt.), 31 (1) (2019), 215-240, JCR
  • Przemysław Gordinowicz, P. Prałat, Small on-line Ramsey numbers – a new approach, Contributions to Discrete Mathematics (20 pkt.), 13 (2018), 101-111, JCR
  • Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Sokół, Małgorzata Śleszyńska-Nowak, Localization game on geometric and planar graphs, Discrete Applied Mathematics (25 pkt.), 251 (2018), 30-39, JCR
  • Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Sokół, Małgorzata Śleszyńska-Nowak, Centroidal localization game, Electronic Journal of Combinatorics (25 pkt.), 25 (4), art. P4.62 (2018), 1-19, JCR
  • T. Gavenčiak, Przemysław Gordinowicz, V. Jelínek, P. Klavík, J. Kratochvíl, Cops and Robbers on intersection graphs, European Journal of Combinatorics (30 pkt.), 72 (2018), 45-69, JCR
  • Przemysław Gordinowicz, The 2-surviving rate of planar graphs with average degree lower than 9/2, Journal of Graph Theory (30 pkt.), 89 (2018), 341-349, JCR
  • A. Bonato, Przemysław Gordinowicz, G. Hahn, Cops and Robbers ordinals of cop-win trees, Discrete Mathematics (25 pkt.), 340 (2017), 951-956, JCR.
  • T. Gavenčiak, Przemysław Gordinowicz, V. Jelínek, P. Klavík, J. Kratochvíl, Cops and robbers on string graphs, in: K. Elbassioni, K. Makino (eds.), Algorithms and Computation, Lecture Notes in Computer Science, 9472 (2015), 355-366.
  • Przemysław Gordinowicz, Planar graph is on fire, Theoret. Comput.Sci., 593 (2015), 160-164, JCR
  • A. Bonato, S. Finbow, Przemysław Gordinowicz, A. Haidar, W. Kinnersley, D. Mitsche, P. Pralat, L. Stacho, The robber strikes back, Computational Intelligence, Cyber Security and Computational Models, Advances in Intelligent Systems and Computing, Vol. 246 (2014), 3-12
  • D. Bryant, N. Francetic, Przemysław Gordinowicz, D. Pike, P. Prałat, Brushing without capacity restrictions, Discrete Applied Mathematics, 170 (2014), 33-45, JCR
  • A. Dudek, Przemysław Gordinowicz, P. Pralat, Cops and Robbers playing on edges, Journal of Combinatorics, 5 (2014), 131-153
  • Grzegorz Andrzejczak, Przemysław Gordinowicz, On automorphisms of the countable p.e.c. graph, Discrete Math., 313 (2013), 1206-1211, JCR
  • A. Bonato, Przemysław Gordinowicz, W. Kinnersley, P. Prałat, The capture time of the hypercube, Electronic J. Combin, 20 (2013), 1-12, JCR
  • Przemysław Gordinowicz, Paweł Prałat, The first player wins the one-colour triangle avoidance game on 16 vertices, Discuss. Math. Graph Theory, 32 (2012), 181-185, JCR
  • Przemysław Gordinowicz, R. Nowakowski, P. Prałat, POLISH - Let us play the cleaning game, Theoret. Comput. Sci., 463 (2012), 123-132, JCR
  • A. Bonato, Przemysław Gordinowicz, P. Prałat, Bounds and construction for n-e.c. tournaments, Contrib. Discrete Math., 5 (2010), 52-66, JCR
  • Przemysław Gordinowicz, On graphs isomorphic to their neighbour and non-neighbour sets, European J. Combin., 31 (2010), 1419-1428, JCR
  • Przemysław Gordinowicz, P. Prałat, The search for the smallest 3-e.c. graphs,, J. Combin. Math. Combin. Comput., 74 (2010), 129-142
  • Przemysław Gordinowicz, Quick max - flow algorithm, J. Math. Model. Algorithms, 8 (2009), 19-34