FACULTY OF ELECTRONICS  
TELECOMMUNICATIONS AND INFORMATICS  

Piotr Borowiecki  		 Strona domowa Politechniki Gdańskiej
PUBLICATIONS

Go to

Research interests

ScopusScopus

ORCIDORCID

dblp computer science bibliographydblp

Links

My home page

Last modified: 2021.06.29

Journal papers , conference proceedings and book chapters

P. Borowiecki, D. Dereniowski, D. Osula
The complexity of bicriteria tree-depth,
in: Proc. FCT'21, Lecture Notes in Computer Science 12867 (2021) 100-113.
P. Borowiecki, M.Borowiecki, E. Drgas-Burchardt, E.Sidorowicz
Graph classes generated by Mycielskians,
Discussiones Mathematicae Graph Theory 40 4 (2020) 1163-1173.
P. Borowiecki
Computational aspects of greedy partitioning of graphs,
Journal of Combinatorial Optimization 35 2 (2018) 641-665.
P. Borowiecki, E. Sidorowicz
Dynamic F-free coloring of graphs,
Graphs and Combinatorics 34 3 (2018) 457-475.
P. Borowiecki
On computational aspects of greedy partitioning of graphs,
in: Proc. FAW'17, Lecture Notes in Computer Science 10336 (2017) 34-46.
P. Borowiecki, M. Gentner, Ch. Loewenstein, D. Rautenbach
Independence in uniform linear triangle-free hypergraphs,
Discrete Mathematics 339 7 (2016) 1878-1883.
P. Borowiecki, S. Das, D. Dereniowski, Ł. Kuszner
Distributed evacuation in graphs with multiple exits,
in: Proc. SIROCCO'16, Lecture Notes in Computer Science 9988 (2016) 228-241.
G. Bacso, P. Borowiecki, M. Hujter, Zs. Tuza
Minimum order of graphs with given coloring parameters,
Discrete Mathematics 338 4 (2015) 621-632.
P. Borowiecki, D. Dereniowski, Ł. Kuszner
Distributed graph searching with a sense of direction,
Distributed Computing 28 3 (2015) 155-170.
P. Borowiecki, D. Rautenbach
New potential functions for greedy independence and coloring,
Discrete Applied Mathematics 182 (2015) 61-72.
P. Borowiecki, D. Dereniowski, P. Prałat
Brushing with additional cleaning restrictions,
Theoretical Computer Science 557 (2014) 76-86.
P. Borowiecki, D. Dereniowski
On-line ranking of split graphs,
Discrete Mathematics and Theoretical Computer Science 15 2 (2013) 195-214.
P. Borowiecki, F. Goering, J. Harant, D. Rautenbach
The potential of greed for independence,
Journal of Graph Theory 71 3 (2012) 245-259.
P. Borowiecki, E. Sidorowicz
Dynamic coloring of graphs,
Fundamenta Informaticae 114 2 (2012) 105-128.
P. Borowiecki, K. Budajova, S. Jendrol', S. Krajči
Parity vertex colourings of graphs,
Discussiones Mathematicae Graph Theory 31 1 (2011) 183-195.
P. Borowiecki, F. Goering
GreedyMAX-type algorithms for the maximum independent set problem,
in: Proc. SOFSEM'11, Lecture Notes in Computer Science 6543 (2011) 146-156.
P. Borowiecki, M. Borowiecki, E. Sidorowicz, Z. Skupień
On extremal sizes of locally k-tree graphs,
Czechoslovak Mathematical Journal 60 2 (2010) 571-587.
P. Borowiecki
Algorithmic bounds on the chromatic number of a graph,
in: Proc. IEEE 1st International Conference on Information Technology (2008) 285-288.
P. Borowiecki
Algorytmiczne oszacowania liczby chromatycznej grafu,
Zeszyty Naukowe Politechniki Gdańskiej, Ser. Technologie Informacyjne 15 (2008) 159-164.
P. Borowiecki
Nowe oszacowania górne dla liczby chromatycznej grafu i ich zastosowania algorytmiczne,
Zeszyty Naukowe Politechniki Gdańskiej, Ser. Technologie Informacyjne 13 (2007) 435-442.
P. Borowiecki
On-line partitioning for on-line scheduling with resource conflicts,
in: Proc. PPAM'07, Lecture Notes in Computer Science 4967 (2007) 981-990.
P. Borowiecki
On-line P-coloring of graphs,
Discussiones Mathematicae Graph Theory 26 3 (2006) 389-401.
P. Borowiecki, E. Sidorowicz
Efektywność algorytmów dynamicznego kolorowania grafów - zastosowania w sieciach optycznych WDM,
Zeszyty Naukowe Politechniki Śląskiej, Ser. Automatyka 144 (2006) 135-142.
P. Borowiecki
On-line coloring of graphs,
in: M.Kubale ed., Graph Colorings. Contemporary Mathematics 352, American Mathematical Society (2004) 21-33.  
P. Borowiecki
Kolorowanie w trybie on-line,
w: Optymalizacja dyskretna. Modele i metody kolorowania grafów. WNT, W-wa (2002) 53-71.
P. Borowiecki
Efektywność algorytmów kolorowania grafów w trybie on-line (II),
Zeszyty Naukowe Politechniki Śląskiej, Ser. Automatyka 136 (2002) 11-20.
P. Borowiecki, M. Kubale
A survey of hard-to-color graphs for off-line and on-line model of vertex coloring,
Journal of Applied Computer Science 9 2 (2001) 7-17.
P. Borowiecki, M. Kubale
A survey of hard-to-color graphs for off-line and on-line model of vertex coloring,
in: Proc. System - Modelling - Control, 10th International Conference. Zakopane, Poland, 1 (2001) 75-82.
P. Borowiecki
Efektywność algorytmów kolorowania grafów w trybie on-line,
Zeszyty Naukowe Politechniki Śląskiej, Ser. Automatyka 131 (2000) 12-23.
P. Borowiecki
Kolorowanie grafów w trybie on-line,
Zeszyty Naukowe Politechniki Śląskiej, Ser. Automatyka 123 (1998) 65-75.
P. Borowiecki
Characterization of graphs critical for first-fit coloring,
in: Proc. 13th Workshop on Discrete Optimization. Burg, Germany (1998) 8-12.
P. Borowiecki, M. Hałuszczak
Partitions of some planar graphs into two linear forests,
Discussiones Mathematicae Graph Theory 17 1 (1997) 95-102.
P. Borowiecki, J. Ivančo
P-bipartitions of minor hereditary properties,
Discussiones Mathematicae Graph Theory 17 1 (1997) 89-93.
P. Borowiecki
P-Bipartitions of graphs,
Vishwa Int. J. Graph Theory 2 2 (1996) 109-116.

Guest editorships

Discussiones Mathematicae Graph Theory 31 2 (2011) 207-409,
CID 2009 Special Issue (with E. Drgas-Burchardt & E. Sidorowicz).  
Discussiones Mathematicae Graph Theory 29 2 (2009) 205-418,
CID 2007 Special Issue (with D. Michalak & E. Sidorowicz).

Preprints

P. Borowiecki, D. Dereniowski, D. Osula
The complexity of bicriteria tree-depth,
arXiv:2101.06645 (January, 2021) 1-23.
P. Borowiecki, M. Gentner, Ch. Loewenstein, D. Rautenbach  
Independence in uniform linear triangle-free hypergraphs,
arXiv:1507.04323 (July, 2015) 1-9.
G. Bacso, P. Borowiecki, M. Hujter, Zs. Tuza
Minimum order of graphs with given coloring parameters,
arXiv:1312.7522 (December, 2013) 1-23.

Links to my records in some bibliographic databases
My home page | top of page