Onur Ugurlu

According to our database, Onur Ugurlu authored at least 12 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2023

Detecting the Most Vital Articulation Points in Wireless Multi-Hop Networks.

Vahid Khalilpour Akram, Onur Ugurlu

IEEE/ACM Trans. Netw., October, 2023

ADA-PC: An asynchronous distributed algorithm for minimizing pairwise connectivity in wireless multi-hop networks.

Onur Ugurlu

Comput. Networks, May, 2023

2022

Comparative analysis of centrality measures for identifying critical nodes in complex networks.

Onur Ugurlu

J. Comput. Sci., 2022

A localized distributed algorithm for vertex cover problem.

Vahid Khalilpour Akram, Onur Ugurlu

J. Comput. Sci., 2022

2021

A Greedy Algorithm for Minimum Cut into Bounded Sets Problem.

Onur Ugurlu, Vahid Khalilpour Akram, Deniz Türsel Eliiyi

Proceedings of the 17th International Conference on Network and Service Management, 2021

2020

Independent strong weak domination: A mathematical programming approach.

Murat Ersen Berberler, Onur Ugurlu, Zeynep Nihan Berberler

Discret. Math. Algorithms Appl., 2020

Parallel Identification of Central Nodes in Wireless Multi-hop Networks.

Deniz Türsel Eliiyi, Hilal Arslan, Vahid Khalilpour Akram, Onur Ugurlu

Proceedings of the 28th Signal Processing and Communications Applications Conference, 2020

A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation.

Onur Ugurlu, Vahid Khalilpour Akram, Deniz Türsel Eliiyi

Proceedings of the 16th International Conference on Network and Service Management, 2020

2018

Rotalama problemleri için algoritmik yaklaşımlar (Algoritmic approaches for routing problems)

Onur Ugurlu

PhD thesis, 2018

2016

One-dimensional Cutting Stock Problem with Divisible Items.

Deniz Tanir, Onur Ugurlu, Asli Guler, Urfat G. Nuriyev

CoRR, 2016

A Hybrid Genetic Algorithm for Minimum Weight Dominating Set Problem.

Onur Ugurlu, Deniz Tanir

Proceedings of the Recent Developments and the New Direction in Soft-Computing Foundations and Applications, 2016

2015

A new algorithm for finding vertex-disjoint paths.

Mehmet Kurt, Murat Ersen Berberler, Onur Ugurlu

Int. Arab J. Inf. Technol., 2015