19 citations · 53 across the 15 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019
Improved bounds for the excluded-minor approximation of treedepth
Wojciech Czerwiński, Wojciech Nadara, Marcin Pilipczuk
Treedepth, a more restrictive graph width parameter than treewidth and pathwidth, plays a major role in the theory of sparse graph classes. We show that there exists a constant …
cs.DM2015
Non-dominating sequences of vectors using only resets and increments
Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski
We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequenc…