![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Piotr Borowiecki
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Piotr Borowiecki
, Ewa Drgas-Burchardt
, Elzbieta Sidorowicz
:
Hypergraph operations preserving sc-greediness. Discuss. Math. Graph Theory 44(3): 1217 (2024) - 2023
- [j18]Piotr Borowiecki
, Dariusz Dereniowski
, Dorota Osula:
The complexity of bicriteria tree-depth. Theor. Comput. Sci. 947: 113682 (2023) - 2021
- [c5]Piotr Borowiecki
, Dariusz Dereniowski, Dorota Osula:
The Complexity of Bicriteria Tree-Depth. FCT 2021: 100-113 - [i2]Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula:
The Complexity of Bicriteria Tree-Depth. CoRR abs/2101.06645 (2021) - 2020
- [j17]Mieczyslaw Borowiecki
, Piotr Borowiecki
, Ewa Drgas-Burchardt
, Elzbieta Sidorowicz
:
Graph classes generated by Mycielskians. Discuss. Math. Graph Theory 40(4): 1163-1173 (2020)
2010 – 2019
- 2018
- [j16]Piotr Borowiecki
, Elzbieta Sidorowicz
:
Dynamic F-free Coloring of Graphs. Graphs Comb. 34(3): 457-475 (2018) - [j15]Piotr Borowiecki
:
Computational aspects of greedy partitioning of graphs. J. Comb. Optim. 35(2): 641-665 (2018) - 2017
- [c4]Piotr Borowiecki
:
On Computational Aspects of Greedy Partitioning of Graphs. FAW 2017: 34-46 - 2016
- [j14]Piotr Borowiecki
, Michael Gentner, Christian Löwenstein, Dieter Rautenbach:
Independence in uniform linear triangle-free hypergraphs. Discret. Math. 339(7): 1878-1883 (2016) - [c3]Piotr Borowiecki
, Shantanu Das, Dariusz Dereniowski
, Lukasz Kuszner
:
Distributed Evacuation in Graphs with Multiple Exits. SIROCCO 2016: 228-241 - 2015
- [j13]Piotr Borowiecki
, Dieter Rautenbach:
New potential functions for greedy independence and coloring. Discret. Appl. Math. 182: 61-72 (2015) - [j12]Piotr Borowiecki
, Dariusz Dereniowski
, Lukasz Kuszner
:
Distributed graph searching with a sense of direction. Distributed Comput. 28(3): 155-170 (2015) - [j11]Gábor Bacsó, Piotr Borowiecki
, Mihály Hujter, Zsolt Tuza:
Minimum order of graphs with given coloring parameters. Discret. Math. 338(4): 621-632 (2015) - 2014
- [j10]Piotr Borowiecki
, Dariusz Dereniowski
, Pawel Pralat:
Brushing with additional cleaning restrictions. Theor. Comput. Sci. 557: 76-86 (2014) - 2013
- [j9]Piotr Borowiecki
, Dariusz Dereniowski
:
On-line ranking of split graphs. Discret. Math. Theor. Comput. Sci. 15(2): 195-214 (2013) - [i1]Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza:
Minimum order of graphs with given coloring parameters. CoRR abs/1312.7522 (2013) - 2012
- [j8]Piotr Borowiecki
, Elzbieta Sidorowicz
:
Dynamic Coloring of Graphs. Fundam. Informaticae 114(2): 105-128 (2012) - [j7]Piotr Borowiecki
, Frank Göring
, Jochen Harant, Dieter Rautenbach:
The potential of greed for independence. J. Graph Theory 71(3): 245-259 (2012) - 2011
- [j6]Piotr Borowiecki
, Kristína Budajová, Stanislav Jendrol'
, Stanislav Krajci:
Parity vertex colouring of graphs. Discuss. Math. Graph Theory 31(1): 183-195 (2011) - [j5]Piotr Borowiecki, Ewa Drgas-Burchardt
, Elzbieta Sidorowicz
:
Preface. Discuss. Math. Graph Theory 31(2): 207 (2011) - [c2]Piotr Borowiecki
, Frank Göring
:
GreedyMAX-type Algorithms for the Maximum Independent Set Problem. SOFSEM 2011: 146-156
2000 – 2009
- 2009
- [j4]Piotr Borowiecki
, Danuta Michalak, Elzbieta Sidorowicz
:
Preface of guest editors. Discuss. Math. Graph Theory 29(2): 207 (2009) - 2007
- [c1]Piotr Borowiecki
:
On-Line Partitioning for On-Line Scheduling with Resource Conflicts. PPAM 2007: 981-990 - 2006
- [j3]Piotr Borowiecki
:
On-line P-coloring of graphs. Discuss. Math. Graph Theory 26(3): 389-401 (2006)
1990 – 1999
- 1997
- [j2]Piotr Borowiecki
, Jaroslav Ivanco:
P-bipartitions of minor hereditary properties. Discuss. Math. Graph Theory 17(1): 89-93 (1997) - [j1]Piotr Borowiecki
, Mariusz Haluszczak:
Partitions of some planar graphs into two linear forests. Discuss. Math. Graph Theory 17(1): 95-102 (1997)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint