7 citations · 20 across the 23 of their papers we have counts for
28 papers
Totally Disjoint Diametral Paths
Tınaz Ekim, Arthur Farley
In this paper, we study totally disjoint diametral paths in simple connected graphs. A diametral path in a graph is a shortest path that connects two vertices whose mutual distance…
A Benders Decomposition Approach for the k-Defensive Domination Problem
Bilge Varol, Tınaz Ekim, Kübra Tanınmış
The k-defensive domination problem is a powerful modeling tool for strategic decision-making in network security and disaster/emergency management, where multiple nodes may be simu…
Perfect Graph Modification Problems: An Integer Programming Approach
Burak Nur Erdem, Tınaz Ekim, Zeki Caner Taşkın
Graph modification problems aim to find a small set of modifications to a graph so that it satisfies a desired property. The literature is rather rich in NP-completeness results an…
Sparse Sets in Triangle-free Graphs
Tınaz Ekim, Burak Nur Erdem, John Gimbel
A set of vertices is -sparse if it induces a graph with a maximum degree of at most . In this missive, we consider the order of the largest -sparse set in a triangle-free…
Generation of weighted trees, block trees and block graphs
Tınaz Ekim, Mordechai Shalom, Mehmet Aziz Yirik
We present a general framework to generate trees every vertex of which has a non-negative weight and a color. The colors are used to impose certain restrictions on the weight and c…
Constructing extremal triangle-free graphs using integer programming
Ali Erdem Banak, Tınaz Ekim, Z. Caner Taşkın
The maximum number of edges in a graph with matching number m and maximum degree d has been determined in [1] and [2], where some extremal graphs have also been provided. Then, a n…