default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOnur Ugurlu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Onur Ugurlu
:
ADA-PC: An asynchronous distributed algorithm for minimizing pairwise connectivity in wireless multi-hop networks. Comput. Networks 227: 109703 (2023)- [j5]Vahid Khalilpour Akram, Onur Ugurlu:
Detecting the Most Vital Articulation Points in Wireless Multi-Hop Networks. IEEE/ACM Trans. Netw. 31(5): 2389-2402 (2023) - 2022
- [j4]Vahid Khalilpour Akram, Onur Ugurlu:
A localized distributed algorithm for vertex cover problem. J. Comput. Sci. 58: 101518 (2022) - [j3]Onur Ugurlu:
Comparative analysis of centrality measures for identifying critical nodes in complex networks. J. Comput. Sci. 62: 101738 (2022) - 2021
- [c4]Onur Ugurlu, Vahid Khalilpour Akram, Deniz Türsel Eliiyi:
A Greedy Algorithm for Minimum Cut into Bounded Sets Problem. CNSM 2021: 422-426 - 2020
- [j2]Murat Ersen Berberler, Onur Ugurlu, Zeynep Nihan Berberler:
Independent strong weak domination: A mathematical programming approach. Discret. Math. Algorithms Appl. 12(5): 2050062:1-2050062:8 (2020) - [c3]Onur Ugurlu, Vahid Khalilpour Akram, Deniz Türsel Eliiyi:
A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation. CNSM 2020: 1-6 - [c2]Deniz Türsel Eliiyi, Hilal Arslan, Vahid Khalilpour Akram, Onur Ugurlu:
Parallel Identification of Central Nodes in Wireless Multi-hop Networks. SIU 2020: 1-4
2010 – 2019
- 2018
- [b1]Onur Ugurlu:
Rotalama problemleri için algoritmik yaklaşımlar (Algoritmic approaches for routing problems). Ege University, Turkey, 2018 - 2016
- [c1]Onur Ugurlu, Deniz Tanir:
A Hybrid Genetic Algorithm for Minimum Weight Dominating Set Problem. WCSC 2016: 137-148 - [i1]Deniz Tanir, Onur Ugurlu, Asli Guler, Urfat G. Nuriyev:
One-dimensional Cutting Stock Problem with Divisible Items. CoRR abs/1606.01419 (2016) - 2015
- [j1]Mehmet Kurt, Murat Ersen Berberler, Onur Ugurlu:
A new algorithm for finding vertex-disjoint paths. Int. Arab J. Inf. Technol. 12(6): 550-555 (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-04-24 23:13 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:
