2 citations · 3 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020
Vertex deletion into bipartite permutation graphs
Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk +2
A permutation graph can be defined as an intersection graph of segments whose endpoints lie on two parallel lines and , one on each. A bipartite permutation graph is a p…
cs.DS2019★ 2 cited
Testing isomorphism of circular-arc graphs -- Hsu's approach revisited
Tomasz Krawczyk
Circular-arc graphs are intersection graphs of arcs on the circle. The aim of our work is to present a polynomial time algorithm testing whether two circular-arc graphs are isomorp…
cs.DS2018
On-line partitioning of width w posets into w^O(log log w) chains
Bartłomiej Bosek, Tomasz Krawczyk
An on-line chain partitioning algorithm receives the elements of a poset one at a time, and when an element is received, irrevocably assigns it to one of the chains. In this paper,…