List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| The complexity of bicriteria tree-depth Theoretical Computer Science | 2023-02-01 | Paper |
| The complexity of bicriteria tree-depth Fundamentals of Computation Theory | 2022-05-20 | Paper |
| Graph classes generated by Mycielskians Discussiones Mathematicae Graph Theory | 2020-08-26 | Paper |
| On Computational Aspects of Greedy Partitioning of Graphs Frontiers in Algorithmics | 2019-04-26 | Paper |
| Dynamic \(F\)-free coloring of graphs Graphs and Combinatorics | 2018-06-07 | Paper |
| Computational aspects of greedy partitioning of graphs Journal of Combinatorial Optimization | 2018-03-01 | Paper |
| Distributed Evacuation in Graphs with Multiple Exits Structural Information and Communication Complexity | 2016-12-01 | Paper |
| Brushing with additional cleaning restrictions Theoretical Computer Science | 2016-06-27 | Paper |
| Independence in uniform linear triangle-free hypergraphs Discrete Mathematics | 2016-04-27 | Paper |
| Distributed graph searching with a sense of direction Distributed Computing | 2015-07-22 | Paper |
| New potential functions for greedy independence and coloring Discrete Applied Mathematics | 2015-02-06 | Paper |
| Minimum order of graphs with given coloring parameters Discrete Mathematics | 2015-01-23 | Paper |
| On-line ranking of split graphs | 2014-02-14 | Paper |
| The potential of greed for independence Journal of Graph Theory | 2012-11-23 | Paper |
| Dynamic coloring of graphs Fundamenta Informaticae | 2012-05-11 | Paper |
| Parity vertex colouring of graphs Discussiones Mathematicae Graph Theory | 2011-10-05 | Paper |
| GreedyMAX-type algorithms for the maximum independent set problem SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
| On extremal sizes of locally \(k\)-tree graphs. Czechoslovak Mathematical Journal | 2011-02-11 | Paper |
| On-line P-coloring of graphs Discussiones Mathematicae Graph Theory | 2008-01-18 | Paper |
| Partitions of some planar graphs into two linear forests Discussiones Mathematicae Graph Theory | 1999-02-02 | Paper |
| P-bipartitions of minor hereditary properties Discussiones Mathematicae Graph Theory | 1998-09-28 | Paper |
Research outcomes over time
This page was built for person: Piotr Borowiecki
