default search action
Onur Çagirici
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Onur Çagirici, Petr Hlinený, Bodhayan Roy:
On colourability of polygon visibility graphs. Eur. J. Comb. 117: 103820 (2024) - 2023
- [j2]Onur Çagirici, Petr Hlinený
, Filip Pokrývka, Abhisekh Sankaran:
Clique-width of point configurations. J. Comb. Theory B 158(Part): 43-73 (2023) - [j1]Onur Çagirici:
On Embeddability of Unit Disk Graphs Onto Straight Lines. Theory Comput. Syst. 67(2): 264-289 (2023) - [c8]Yeganeh Bahoo, Onur Cagirici, Kody Manastyrski, Rahnuma Islam Nishat, Christopher Kolios, Roni Sherman:
Conflict-Free Chromatic Guarding of Orthogonal Polygons with Sliding Cameras. CCCG 2023: 63-70 - [c7]Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman:
Recognizing H-Graphs - Beyond Circular-Arc Graphs. MFCS 2023: 8:1-8:14 - [c6]Somnath Kundu, Yeganeh Bahoo, Onur Çagirici, Steven M. LaValle:
Arithmetic Billiard Paths Revisited: Escaping from a Rectangular Room. MMAR 2023: 478-483 - 2022
- [c5]Onur Çagirici, Yeganeh Bahoo, Steven M. LaValle:
Bouncing Robots in Rectilinear Polygons. MMAR 2022: 193-198 - [i11]Deniz Agaoglu Çagirici, Onur Çagirici:
APUD(1, 1) Recognition in Polynomial Time. CoRR abs/2210.04090 (2022) - [i10]Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman:
Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. CoRR abs/2212.05433 (2022) - 2021
- [i9]Onur Çagirici, Deniz Agaoglu:
Unit Disk Visibility Graphs. CoRR abs/2103.14092 (2021) - [i8]Onur Çagirici:
Computational Aspects of Problems on Visibility and Disk Graph Representations. CoRR abs/2111.00609 (2021) - 2020
- [c4]Onur Çagirici:
On Embeddability of Unit Disk Graphs onto Straight Lines. CSR 2020: 184-197 - [c3]Onur Çagirici, Petr Hlinený
Clique-Width of Point Configurations. WG 2020: 54-66 - [i7]Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran:
Clique-Width of Point Configurations. CoRR abs/2004.02282 (2020)
2010 – 2019
- 2019
- [c2]Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený
On Conflict-Free Chromatic Guarding of Simple Polygons. COCOA 2019: 601-612 - [i6]Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy:
On conflict-free chromatic guarding of simple polygons. CoRR abs/1904.08624 (2019) - [i5]Onur Çagirici, Petr Hlinený, Bodhayan Roy:
On Colourability of Polygon Visibility Graphs. CoRR abs/1906.01904 (2019) - 2018
- [i4]Onur Çagirici:
Axes-parallel unit disk graph recognition is NP-hard. CoRR abs/1811.09881 (2018) - 2017
- [c1]Onur Cagirici, Petr Hlinený
On Colourability of Polygon Visibility Graphs. FSTTCS 2017: 21:1-21:14 - [i3]Onur Çagirici:
Utilizing hyperplanar substructures to perform efficient range-based WSN localization. CoRR abs/1712.02391 (2017) - 2016
- [i2]Onur Cagirici:
Avoiding the Flip Ambiguities in 2D Wireless Sensor Localization by Using Unit Disk Graph Property. CoRR abs/1604.03396 (2016) - 2015
- [i1]Onur Cagirici:
Exploiting Coplanar Clusters to Enhance 3D Localization in Wireless Sensor Networks. CoRR abs/1502.07790 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: