5 citations · 6 across the 5 of their papers we have counts for
8 papers
Beyond circular-arc graphs -- recognizing lollipop graphs and medusa graphs
Deniz Ağaoğlu Çağırıcı, Onur Çağırıcı, Jan Derbisz +5
In 1992 Biró, Hujter and Tuza introduced, for every fixed connected graph , the class of -graphs, defined as the intersection graphs of connected subgraphs of some subdivisio…
Computational Aspects of Problems on Visibility and Disk Graph Representations
Onur Çağırıcı
This thesis focuses on two concepts which are widely studied in the field of computational geometry. Namely, visibility and unit disk graphs. In the field of visibility, we have st…
Clique-Width of Point Configurations
Onur Çağırıcı, Petr Hliněný, Filip Pokrývka +1
While structural width parameters (of the input) belong to the standard toolbox of graph algorithms, it is not the usual case in computational geometry. As a case study we propose…
On Colourability of Polygon Visibility Graphs
Onur Çağirici, Petr Hliněný, Bodhayan Roy
We study the problem of colouring visibility graphs of polygons. In particular, for visibility graphs of simple polygons, we provide a polynomial algorithm for 4-colouring, and pro…
On conflict-free chromatic guarding of simple polygons
Onur Çağırıcı, Subir Kumar Ghosh, Petr Hliněný +1
We study the problem of colouring the vertices of a polygon, such that every viewer in it can see a unique colour. The goal is to minimise the number of colours used. This is also…
On embeddability of unit disk graphs onto straight lines
Onur Çağırıcı
Unit disk graphs are the intersection graphs of unit radius disks in the Euclidean plane. Deciding whether there exists an embedding of a given unit disk graph, i.e. unit disk grap…