2 citations · 3 across the 13 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
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…
math.OC2026
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…