Piotr Borowiecki

Available identifiers

Publication	Date of Publication	Type
The complexity of bicriteria tree-depth	2023-02-01	Paper
The complexity of bicriteria tree-depth	2022-05-20	Paper
Graph classes generated by Mycielskians	2020-08-26	Paper
On Computational Aspects of Greedy Partitioning of Graphs	2019-04-26	Paper
Dynamic \(F\)-free coloring of graphs	2018-06-07	Paper
Computational aspects of greedy partitioning of graphs	2018-03-01	Paper
Distributed Evacuation in Graphs with Multiple Exits	2016-12-01	Paper
Brushing with additional cleaning restrictions	2016-06-27	Paper
Independence in uniform linear triangle-free hypergraphs	2016-04-27	Paper
Distributed graph searching with a sense of direction	2015-07-22	Paper
New potential functions for greedy independence and coloring	2015-02-06	Paper
Minimum order of graphs with given coloring parameters	2015-01-23	Paper
On-line ranking of split graphs	2014-02-14	Paper
The potential of greed for independence	2012-11-23	Paper
Dynamic coloring of graphs	2012-05-11	Paper
Parity vertex colouring of graphs	2011-10-05	Paper
GreedyMAX-type algorithms for the maximum independent set problem	2011-02-15	Paper
On extremal sizes of locally \(k\)-tree graphs.	2011-02-11	Paper
On-line P-coloring of graphs	2008-01-18	Paper
Partitions of some planar graphs into two linear forests	1999-02-02	Paper
P-bipartitions of minor hereditary properties	1998-09-28	Paper

This page was built for person: Piotr Borowiecki