Folgen
Onur Çağırıcı
Onur Çağırıcı
N/A
Bestätigte E-Mail-Adresse bei novanta.com
Titel
Zitiert von
Zitiert von
Jahr
On conflict-free chromatic guarding of simple polygons
O Çağırıcı, SK Ghosh, P Hliněný, B Roy
International Conference on Combinatorial Optimization and Applications, 601-612, 2019
102019
On colourability of polygon visibility graphs
O Çağirici, P Hliněný, B Roy
arXiv preprint arXiv:1906.01904, 2019
72019
Exploiting coplanar clusters to enhance 3d localization in wireless sensor networks
O Cagirici
arXiv preprint arXiv:1502.07790, 2015
52015
Bouncing robots in rectilinear polygons
O Çağırıcı, Y Bahoo, SM LaValle
2022 26th International Conference on Methods and Models in Automation and …, 2022
32022
Unit Disk Visibility Graphs
D Ağaoğlu, O Çağırıcı
Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021
32021
On upward straight-line embeddings of oriented paths
O Cagırıcı, L Casuso, C Medina, T Patino, M Raggi, E Roldán-Pensado, ...
XVII Spanish Meeting on Computational Geometry, 49-52, 2017
32017
On Embeddability of Unit Disk Graphs onto Straight Lines
O Cagirici
CSR 2020 Program Committee, 2020
22020
Recognizing -graphs – beyond circular-arc graphs
D Ağaoğlu Çağırıcı, O Çağırıcı, J Derbisz, TA Hartmann, P Hliněný, ...
Dagstuhl: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023
12023
Clique-width of point configurations
O Cagirici, P Hliněný, F Pokrývka, A Sankaran
Springer, Lecture Notes in Computer Science, 2020
12020
Avoiding the Flip Ambiguities in 2D Wireless Sensor Localization by Using Unit Disk Graph Property
O Cagirici
arXiv preprint arXiv:1604.03396, 2016
12016
Exploiting coplanar clusters to enhance 3D localization in wireless sensor networks
O Çağırıcı
İzmir Ekonomi Üniversitesi, 2015
12015
Arithmetic Billiard Paths Revisited: Escaping from a Rectangular Room
S Kundu, Y Bahoo, O Çağırıcı, SM LaValle
2023 27th International Conference on Methods and Models in Automation and …, 2023
2023
On embeddability of unit disk graphs onto straight lines
O Çağırıcı
Theory of Computing Systems 67 (2), 264-289, 2023
2023
Recognizing H-Graphs-Beyond Circular-Arc Graphs
D Agaoglu Cagirici, O Cagirici, J Derbisz, T Hartmann, P Hliněný, ...
Schloss Dagstuhl--Leibniz-Zentrum f {\" u} r Informatik, 2023
2023
Recognizing H-Graphs-Beyond Circular-Arc Graphs
DA Çagirici, O Çagirici, J Derbisz, TA Hartmann, P Hliněný, J Kratochvil, ...
48th International Symposium on Mathematical Foundations of Computer Science …, 2023
2023
Clique-width of point configurations
O Çağırıcı, P Hliněný, F Pokrývka, A Sankaran
Journal of Combinatorial Theory, Series B 158, 43-73, 2023
2023
Beyond circular-arc graphs--recognizing lollipop graphs and medusa graphs
DA Çağırıcı, O Çağırıcı, J Derbisz, TA Hartmann, P Hliněný, J Kratochvíl, ...
arXiv preprint arXiv:2212.05433, 2022
2022
Beyond circular-arc graphs--recognizing lollipop graphs and medusa graphs
D Ağaoğlu Çağırıcı, O Çağırıcı, J Derbisz, TA Hartmann, P Hliněný, ...
arXiv e-prints, arXiv: 2212.05433, 2022
2022
APUD (1, 1) Recognition in Polynomial Time
D Ağaoğlu Çağırıcı, O Çağırıcı
arXiv e-prints, arXiv: 2210.04090, 2022
2022
BEYOND CIRCULAR-ARC GRAPHS–RECOGNIZING LOLLIPOP GRAPHS AND MEDUSA GRAPHS.
DAGLUCA GIRICI, O Çagirici, J Derbisz, T HARTMANN, P Hlinený, ...
2022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20