A new algorithm for finding vertex-disjoint paths. - Mehmet Kurt; Murat Ersen Berberler; Onur Ugurlu (Int. Arab J. Inf. Technol., 2015)

A Hybrid Genetic Algorithm for Minimum Weight Dominating Set Problem. - Onur Ugurlu; Deniz Tanir (WCSC, 2016)

One-dimensional Cutting Stock Problem with Divisible Items. - Deniz Tanir; Onur Ugurlu; Asli Guler; Urfat G. Nuriyev (CoRR, 2016)

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

A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation. - Onur Ugurlu; Vahid Khalilpour Akram; Deniz Türsel Eliiyi (CNSM, 2020)

Parallel Identification of Central Nodes in Wireless Multi-hop Networks. - Deniz Türsel Eliiyi; Hilal Arslan; Vahid Khalilpour Akram; Onur Ugurlu (SIU, 2020)

Independent strong weak domination: A mathematical programming approach. - Murat Ersen Berberler; Onur Ugurlu; Zeynep Nihan Berberler (Discret. Math. Algorithms Appl., 2020)

A Greedy Algorithm for Minimum Cut into Bounded Sets Problem. - Onur Ugurlu; Vahid Khalilpour Akram; Deniz Türsel Eliiyi (CNSM, 2021)

A localized distributed algorithm for vertex cover problem. - Vahid Khalilpour Akram; Onur Ugurlu (J. Comput. Sci., 2022)

Comparative analysis of centrality measures for identifying critical nodes in complex networks. - Onur Ugurlu (J. Comput. Sci., 2022)

ADA-PC: An asynchronous distributed algorithm for minimizing pairwise connectivity in wireless multi-hop networks. - Onur Ugurlu (Comput. Networks, 2023)

Detecting the Most Vital Articulation Points in Wireless Multi-Hop Networks. - Vahid Khalilpour Akram; Onur Ugurlu (IEEE/ACM Trans. Netw., 2023)

Distributed Detecting of Critical Nodes for Maximization of Connected Components in Wireless Multi-hop Networks. - Onur Ugurlu; Nusin Akram; Yesim Aygul; Vahid Khalilpour Akram; Orhan Dagdeviren (Ad Hoc Networks, 2025)