About Me
I am a postdoctoral researcher at the Department of Computer Science, Toronto Metropolitan University .
My main area of interest is computational geometry.
Particularly, I am interested in visibility graphs and unit disk graphs.
I am a member of Geometric Computing Lab.
address
245 Church St.
Toronto, ON
M5B 1Z4
cagirici@ryerson.ca
phone
TBA
Research
My areas of interest
Conflict-free coloring of polygon visibility graphs
Conflict-free coloring of a simple graph is assigning colors to a subset of vertices such that every vertex in the graph sees a unique color. A polygon visibility graph is a graph that describes the visibility relations among the vertices of a given polygon.
Unit disk graph recognition on restricted domains
Recognizing of a unit disk graph is determining whether a given simple graph can be realized as an intersection graph of unit disks. A restricted domain is a pre-determined solution space in which the disks are allowed to be centered.
Maximum clique of a disk set
A clique is a set of disks where each disk mutually intersect. The aim is to find such a set with maximum cardinality. It is not yet known whether this problem is tractable.
Events I have attended
Workshops
May 2019, Telč, Czech Republic -- ATCAGC '20
May 2019, Telč, Czech Republic -- Crossing Numbers Workshop '19
October 2017, Telč, Czech Republic -- MEMICS '17
May 2017, Osnabrück, Germany -- Crossing Numbers Workshop '17
October 2016, Telč, Czech Republic -- MEMICS '16
Symposiums/Conferences
August 2022, Online -- MMAR '22
July 2022, Santander, Spain -- DMD '22
September 2021, Online -- EUROCOMB '21
August 2021, Online -- CSGT '21
August 2020, Online -- CSGT '20
June 2020, Online -- CSR '20
June 2020, Online -- WG '20
September 2019, Průhonice, Czech Republic -- GD '19
June 2019, Smižany, Slovakia -- CSGT '19
May 2018, Budapest, Hungary -- SoCG '18
Miscellaneous
April 2017, Žďár nad Sázavou, Czech Republic -- Spring School of Combinatorics '17
December 2016, Prague, Czech Republic -- CE-ITI '16
Short CV
For my full CV click here.
Activities
2022
visiting researcher at Jagiellonian University Kraków, Poland
2021
postdoctoral researcher at TMU Toronto, Canada
2019
visiting researcher at ENS de Lyon Lyon, France
2017
visiting researcher at UASLP San Luis Potosí, Mexico
visiting researcher at UNAM Mexico City, Mexico
visiting researcher at Cinvestav Mexico City, Mexico
visiting researcher at Jagiellonian University Kraków, Poland
2016 - 21
PhD at Masaryk University Brno, Czech Republic
2012-15
MSc at Izmir University of Economics Izmir, Turkey
2010
Internship at University of Cantabria Santander, Spain
2008
Internship at Coretech Istanbul, Turkey
2007-11
BSc at Izmir University of Economics Izmir, Turkey
Publications
O. Çağırıcı: On embeddability of unit disk graphs onto straight lines. TOCS '22
O. Çağırıcı, Y. Bahoo, S. LaValle: Bouncing Robots in Rectilinear Polygons. MMAR '22
O. Çağırıcı, P. Hliněný, F. Pokrývka, A. Sankaran: Clique-Width of Point Configurations. JCTB '21
D. Ağaoğlu, O. Çağırıcı: Unit disk visibility graphs. EUROCOMB '21
O. Çağırıcı, P. Hliněný, F. Pokrývka, A. Sankaran: Clique-Width of Point Configurations. WG '20
O. Çağırıcı: On embeddability of unit disk graphs onto straight lines. CSR '20
O. Çağırıcı, S. K. Ghosh, P. Hliněný, B. Roy: On conflict-free chromatic guarding of simple polygons. COCOA '19
O. Çağırıcı, P. Hliněný, B. Roy: On Colourability of Polygon Visibility Graphs. FSTTCS '17
O. Çağırıcı, L. Casuso, C. Medina, T. Patiño, M. Raggi, E. Roldán-Pensado, G. Salazar, J. Urrutia: On upward straight-line embeddings of oriented paths. ECG '17