4 papers
A framework for distributed discrete evacuation strategies
Piotr Borowiecki, Dariusz Dereniowski, Łukasz Kuszner
In this paper, we study discrete evacuation in networks, where agents know the network topology and designated exit nodes but do not know the number and initial positions of other…
The Complexity of Bicriteria Tree-Depth
Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph . We introduce a bicriteria generalization in which additionally the…
Independence in Uniform Linear Triangle-free Hypergraphs
Piotr Borowiecki, Michael Gentner, Christian Löwenstein +1
The independence number of a hypergraph is the maximum cardinality of a set of vertices of that does not contain an edge of . Generalizing Shearer's classical low…
Minimum order of graphs with given coloring parameters
Gabor Bacso, Piotr Borowiecki, Mihaly Hujter +1
A complete -coloring of a graph is an assignment of colors to the vertices such that no two vertices of the same color are adjacent, and the uni…