Przemysław Gordinowicz

From MaRDI portal
Person:385385

Available identifiers

zbMath Open gordinowicz.przemyslawDBLP12/8077WikidataQ62058453 ScholiaQ62058453MaRDI QIDQ385385

List of research outcomes





PublicationDate of PublicationType
Erratum: The 2‐surviving rate of planar graphs with average degree lower than 922023-10-04Paper
Edge and pair queries-random graphs and complexity2023-06-15Paper
The polynomial method for 3-path extendability of list colourings of planar graphs2023-05-24Paper
The polynomial method for list-colouring extendability of outerplanar graphs2022-01-05Paper
Dense free subgroups of automorphism groups of homogeneous partially ordered sets2019-03-20Paper
Centroidal localization game2019-03-05Paper
https://portal.mardi4nfdi.de/entity/Q31206512019-03-05Paper
The 2‐surviving rate of planar graphs with average degree lower than2019-01-03Paper
Localization game on geometric and planar graphs2018-12-03Paper
Cops and robbers on intersection graphs2018-06-28Paper
Cops and robbers ordinals of cop-win trees2017-02-27Paper
Cops and Robbers on String Graphs2016-01-11Paper
Planar graph is on fire2015-10-08Paper
https://portal.mardi4nfdi.de/entity/Q52654082015-07-24Paper
Brushing without capacity restrictions2014-05-06Paper
Cops and robbers playing on edges2014-04-30Paper
Cops and robbers on intersection graphs2014-01-14Paper
On automorphisms of the countable p.e.c. graph2013-12-02Paper
The robber strikes back2013-08-13Paper
The capture time of the hypercube2013-06-07Paper
\textsc{polish} -- Let us play the cleaning game2013-01-07Paper
The first player wins the one-colour triangle avoidance game on 16 vertices2012-09-05Paper
https://portal.mardi4nfdi.de/entity/Q30125802011-07-06Paper
On graphs isomorphic to their neighbour and non-neighbour sets2010-06-17Paper
Quick max-flow algorithm2009-09-18Paper
On multidimensional generalization of binary searchN/APaper

Research outcomes over time

This page was built for person: Przemysław Gordinowicz