Piotr Borowiecki

Orcid: 0000-0002-5239-6540

According to our database1, Piotr Borowiecki authored at least 22 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hypergraph operations preserving sc-greediness.
Discuss. Math. Graph Theory, 2024

2023
The complexity of bicriteria tree-depth.
Theor. Comput. Sci., February, 2023

2020
Graph classes generated by Mycielskians.
Discuss. Math. Graph Theory, 2020

2018
Computational aspects of greedy partitioning of graphs.
J. Comb. Optim., 2018

Dynamic F-free Coloring of Graphs.
Graphs Comb., 2018

2016
Independence in uniform linear triangle-free hypergraphs.
Discret. Math., 2016

Distributed Evacuation in Graphs with Multiple Exits.
Proceedings of the Structural Information and Communication Complexity, 2016

2015
Minimum order of graphs with given coloring parameters.
Discret. Math., 2015

Distributed graph searching with a sense of direction.
Distributed Comput., 2015

New potential functions for greedy independence and coloring.
Discret. Appl. Math., 2015

2014
Brushing with additional cleaning restrictions.
Theor. Comput. Sci., 2014

2013
On-line ranking of split graphs.
Discret. Math. Theor. Comput. Sci., 2013

2012
The potential of greed for independence.
J. Graph Theory, 2012

Dynamic Coloring of Graphs.
Fundam. Informaticae, 2012

2011
Preface.
Discuss. Math. Graph Theory, 2011

Parity vertex colouring of graphs.
Discuss. Math. Graph Theory, 2011

GreedyMAX-type Algorithms for the Maximum Independent Set Problem.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

2009
Preface of guest editors.
Discuss. Math. Graph Theory, 2009

2007
On-Line Partitioning for On-Line Scheduling with Resource Conflicts.
Proceedings of the Parallel Processing and Applied Mathematics, 2007

2006
On-line P-coloring of graphs.
Discuss. Math. Graph Theory, 2006

1997
P-bipartitions of minor hereditary properties.
Discuss. Math. Graph Theory, 1997

Partitions of some planar graphs into two linear forests.
Discuss. Math. Graph Theory, 1997


  Loading...