1 citations · 1 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Improved lower bounds on the on-line chain partitioning of posets of bounded dimension
Csaba Biró, Israel R. Curbelo
An on-line chain partitioning algorithm receives a poset, one element at a time, and irrevocably assigns the element to one of the chains. Over 30 years ago, Szemerédi proved that…
math.CO2021
Improved lower bound on the on-line chain partitioning of semi-orders with representation
Csaba Biró, Israel R. Curbelo
An on-line chain partitioning algorithm receives a poset, one element at a time, and irrevocably assigns the element to one of the chains in the partition. The on-line chain partit…