2 citations · 2 across the 1 of their papers we have counts for
5 papers
Colouring polygon visibility graphs and their generalizations
James Davies, Tomasz Krawczyk, Rose McCarty +1
Curve pseudo-visibility graphs generalize polygon and pseudo-polygon visibility graphs and form a hereditary class of graphs. We prove that every curve pseudo-visibility graph with…
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…
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…
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,…
Asymmetric coloring games on incomparability graphs
Tomasz Krawczyk, Bartosz Walczak
Consider the following game on a graph : Alice and Bob take turns coloring the vertices of properly from a fixed set of colors; Alice wins when the entire graph has been col…